CC04 PRELIM

A stack is a linear data structure that follows a first-in-last-out (FILO) order

• True
• False

In a breadth-first search, nodes are visited in the order in which they were added to the graph.

• True
• False

A binary search tree is a type of tree where each node has at most two children.

• True
• False

The time complexity of a bubble sort algorithm is O(n^2)

• True
• False

A queue is a linear data structure that follows a first-in-first-out (FIFO) order.

• True
• False

The Big O notation is used to describe the worst-case time complexity of an algorithm.

• True
• False

A linked list is a data structure that stores data in contiguous memory locations.

• True
• False

The time complexity of the insertion sort algorithm is O(n log n).

• True
• False

Dynamic programming is a technique for solving problems by breaking them down into smaller subproblems.

• True
• False

A heap is a type of tree where the parent node is always greater than or equal to its children.

• True
• False