CS 210 - Introduction to Data Structures and Algorithms

What is a Binary tree?

A binary tree is a data structure in which each node stores data and has up to two children, known as a left child and a right child.

What is a Graph?

A graph is a data structure for representing connections among items, and consists of vertices connected by edges. A vertex represents an item in a graph. An edge represents a connection between two vertices in a graph.

What is a Hash table?

A hash table is a data structure that stores unordered items by mapping (or hashing) each item to a location in an array.

What is a Linked list?

A linked list is a data structure that stores an ordered list of items in nodes, where each node stores data and has a pointer to the next node.

What is a Heap?

A max-heap is a tree that maintains the simple property that a node's key is greater than or equal to the node's children's keys. A min-heap is a tree that maintains the simple property that a node's key is less than or equal to the node's children's keys.

What is a record?

A record is the data structure that stores subitems, called fields, with a name associated with each subitem.

What is an Algorithm

An algorithm describes a sequence of steps to solve a computational problem or perform a calculation. A computational problem specifies an input, a question about the input that can be answered using a computer, and the desired output.

What is an Array?

An array is a data structure that stores an ordered list of items, where each item is directly accessible by a positional index.

A linked list stores items in an unspecified order.

False

A list node's data can store a record with multiple subitems.

True

A node in binary tree can have zero, one, or two children.

True

Items stored in an array can be accessed using a positional index.

True

What is a data structure?

a way of organizing, storing, and performing operations on data. Operations performed on a data structure include accessing or updating stored data, searching for specific data, inserting new data, and removing data.

Runtime Complexity

function, T(N), that represents the number of constant time operations performed by the algorithm on an input of size N.

abstract data type (ADT)

is a data type described by predefined user operations, such as "insert data at the rear," without indicating how each operation is implemented.

Space Complexity

is a function, S(N), that represents the number of fixed-size memory units used by the algorithm for an input of size N