Data Structures and Algorithms

An Adjacency List is:

• a data structure used to represent a graph

• a type of sorting algorithm

• a method for searching data

• a way to store hierarchical data

An Adjacency Matrix is:

• a matrix used to represent a graph

• a type of data structure for sorting

• a method for solving linear equations

• a tool for statistical analysis

An Array is:

• A single value

• A collection of elements

• A mathematical operation

• A type of loop

A Binary Search Tree (BST) is a data structure that:

• Stores data in a linear fashion

• Allows duplicate elements

• Has nodes with at most two children, where the left child is less than the parent node and the right child is greater

• Is a type of graph with cycles

A Binary Tree is a data structure in which each node has at most how many children?

• One

• Two

• Three

• Four

What is Breadth-First Search (BFS)?

• A search algorithm that explores all the nodes at the present depth prior to moving on to the nodes at the next depth level.

• A search algorithm that explores as far as possible along each branch before backtracking.

• A sorting algorithm that repeatedly steps through the list, compares adjacent elements and swaps them if they are in the wrong order.

• A search algorithm that uses a divide and conquer approach to find the shortest path.

What is Chaining in Hashing?

• A method to handle collisions in a hash table

• A technique to sort data in ascending order

• A process to encrypt data

• A way to compress data

A collision in hashing occurs when:

• two different keys hash to the same index

• a key hashes to a unique index

• all keys hash to different indices

• a key cannot be hashed

A Data Structure is a way to _________.

• store and organize data

• create algorithms

• compile code

• design user interfaces

What is Depth-First Search (DFS)?

• A search algorithm that explores as far as possible along each branch before backtracking

• A search algorithm that explores all neighbors at the present depth prior to moving on to nodes at the next depth level

• A sorting algorithm that uses a divide and conquer approach

• A search algorithm that finds the shortest path in a weighted graph