Q12 A technique in which one system models the behavior of a

Q12. A technique in which one system models the behavior of another system is called simulation.
    a. true
    b. false

Q13. In a(n) ____ queue, customers or jobs with higher priority are pushed to the front of the queue.
    a. circular
    b. priority
    c. linked
    d. array-based

Q14. Whenever an application is modeled on a FIFO structure, ____ are used.
    a. lists
    b. queues
    c. stacks
    d. arrays

Q15. In a priority queue, customers or jobs with higher priority are pushed to the back of the queue.
    a. true
    b. false

Q16. Queue can be derived from the class ____.
    a. LinkedListClass
    b. stack
    c. list
    d. array

Q17. One of the disadvantages of chaining is that if the item size is small, a considerable amount of space is wasted.
    a. true
    b. false

Q18. Hashing collision resolution techniques are classified into which of the following categories?
    a. open addressing only
    b. chaining only
    c. closed addressing only
    d. both open addressing and chaining

Q19. One requirement of linear search is that the item must be in the array.
    a. true
    b. false

Q20. On average, the number of comparisons made by a sequential search is equal to one-third the size of the list.
    a. true
    b. false

Q21. In linear search, you search an array starting from the middle component.
    a. true
    b. false

Q22. In sequential search, the array must be ordered.
    a. true
    b. false

Q23. If we want to design a search algorithm that is of an order less than log2n, then it ____ be comparison based.
    a. must
    b. could
    c. cannot
    d. should

Q24. In chaining, the average number of comparisons for an unsuccessful search is equal to the load factor.
    a. true
    b. false

Q25. Both random and quadratic probing eliminate ____.
    a. primary clustering
    b. secondary clustering
    c. rehashing
    d. random probing

Q26. Merge sort uses a pivot just like quick sort.
    a. true
    b. false

Q27. The insertion sort algorithm sorts the list by moving each element to its proper place.
    a. true
    b. false

Q28. The functions implementing sorting algorithms are included as private members of the related class.
    a. true
    b. false

Q29. Merge sort can be implemented for only array based lists.
    a. true
    b. false

Q30. Insertion sort tries to reduce the number of key comparisons relative to which of the following?
    a. heap sort
    b. merge sort
    c. selection sort
    d. quick sort

Q31. The worst case for the number of comparisons in quick sort is O(n²).
    a. true
    b. false

Q32. Suppose that L is a list of n elements, where n > 0. Let A(n) denote the number of key comparisons in the average case of merge sort. Which of the following is true?
    a. A(n) = O(n log₂n)
    b. A(n) = O(n log n)
    c. A(n) = O(n² log n)
    d. A(n) = O(n² log₂n)

Q33. The selection sort algorithm sorts a list by selecting the smallest element in the (unsorted portion of the) list, and then moving this smallest element to the ____ of the (unsorted) list.
    a. pivot
    b. top
    c. middle
    d. bottom

Q34. Quick sort overcomes the worst case scenario of heap sort.
    a. true
    b. false

Q35. The iterative preorder tree traversal function is known as ____.
    a. nonrecursive preorder traversal
    b. recursive preorder traversal
    c. preorder traversal
    d. nonrecursive postorder traversal

Q36. In a binary search tree, the key in the ____ node is larger than every key in the left subtree and smaller than every key in the right subtree.
    a. child
    b. root
    c. right
    d. head

Q37. Any node in a binary tree can be called a leaf node.
    a. true
    b. false

Q38. There is a unique path from the ____ to every node in the binary tree.
    a. branch
    b. root
    c. reference
    d. info

Q39. Each node in a binary tree contains data and a link to the left child and a link to the right child.
    a. true
    b. false

Q40. In an AVL tree: 1) the height of the left and right subtrees of the root differ by at most 2, and 2) the left and right subtrees of the root are AVL trees.
    a. true
    b. false

Q41. There are ____ cases to consider when deleting a node from a binary search tree.
    a. two
    b. three
    c. four
    d. five

Q42. In an preorder traversal, the binary tree is traversed as follows: 1) Traverse the left subtree, 2) Visit the node, and 3) Traverse the right subtree.
    a. true
    b. false

Q43. The adjacency matrix A_G is a two-dimensional n x n matrix such that the (i, j)the entry of A_G is 1 if there is an edge from v_i to v_j; otherwise, the (i, j)the entry is zero.
    a. true
    b. false

Q44. The ____-first traversal of a graph is similar to traversing a binary tree level by level.
    a. height
    b. depth
    c. breadth
    d. width

Q45. In an undirected graph G = (V, E), the elements of E are ordered pairs.
    a. true
    b. false

Q46. A tree T is called a ____ tree of graph G if T is a subgraph of G such that V(T ) = V(G), that is, all the vertices of G are in T.
    a. spanning
    b. binary
    c. binary search
    d. short

Q47. The edges connecting two vertices can be assigned a nonnegative real number, called the ____ of the edge.
    a. height
    b. weight
    c. depth
    d. level

Q48. A graph G has a spanning tree if and only if G is disconnected.
    a. true
    b. false

Q49. The two most common graph traversal algorithms are the height first traversal and breadth first traversal.
    a. true
    b. false

Q50. The depth first traversal is similar to the postorder traversal of a binary tree.
    a. true
    b. false