CS270 Final Exam

Data Structures

1. To speed up item insertion and deletion in a data set, use ____.

Points Earned: 2.0/2.0

2. In a ____ queue, customers or jobs with higher priorities are pushed to the front
of the queue.

Points Earned: 2.0/2.0

3. The ____ operation on a queue returns the last element in the queue, but does
not remove the element from the queue

Points Earned: 2.0/2.0

4. Random access iterators are ____ iterators that can randomly process elements
of a container.

Points Earned: 2.0/2.0

5. The order of the nodes in a linked list is determined by the data value stored in
each node.

Points Earned: 2.0/2.0

6. Building a linked list forward places the new item to be added at the beginning
of the linked list.

Points Earned: 2.0/2.0

7. Assuming deq is a deque object, the expression deq.push_front(elem) deletes

the first element from deq.

Points Earned: 2.0/2.0

8. complexity of the function seqSearch in an array list is O(n2).

Points Earned: 2.0/2.0

9. A queuing system only consists of queues of objects waiting to be served.

Points Earned: 2.0/2.0

10. The operation ____ is used to remove the top element from the stack.

Points Earned: 2.0/2.0

11. Class objects cannot be passed as parameters to functions or returned as

function values.
Points Earned: 2.0/2.0

12. Indirect recursion requires the same careful analysis as direct recursion.

Points Earned: 2.0/2.0

13. From the binary search algorithm, it follows that every iteration of the while
loop cuts the size of the search list by half.

Points Earned: 2.0/2.0

14. Using static arrays, depending on the number of servers specified by the
user, a list of servers is created during program execution.

Points Earned: 2.0/2.0

15. A sequential search assumes that the data is in a particular order.

Points Earned: 2.0/2.0

16. In an array list the time complexity of the remove function is identical to the
time complexity of the ____ function.

Points Earned: 2.0/2.0

17. A convenient and fast way to implement an associative container data

structure is to use a ____.

Points Earned: 2.0/2.0

18. An ____ is an object that produces each element of a container, such as a

linked list, one element at a time.

Points Earned: 2.0/2.0

19. A linked list in which the last node points to the first node is called a reverse
linked list.

Points Earned: 2.0/2.0

20. A binary search can be performed only on ____.

Points Earned: 2.0/2.0

21. A ____ is a set of elements of the same type in which the elements are added
at one end.

Points Earned: 2.0/2.0

22. In 1736, Euler represented the Knigsberg bridge problem as a graph,

marking (as recorded) the birth of graph theory.

Points Earned: 2.0/2.0

23. The general case in a recursive function is the case for which the solution is
obtained directly.

Points Earned: 2.0/2.0

24. Mergesort uses the divide-and-conquer technique to sort a list.

Points Earned: 2.0/2.0

25. When an integer is subtracted from a pointer variable, the value of the
pointer variable is decremented by the integer times half the size of the memory
to which the pointer is pointing.

Points Earned: 2.0/2.0

26. Assuming vecList is a vector container, the expression ____ deletes all
elements from the container.

Points Earned: 2.0/2.0

27. The function that overloads any of the operators (), [], ->, a class must be
declared as a member of the class.

Points Earned: 2.0/2.0

28. Open addressing can be implemented in several ways.

Points Earned: 2.0/2.0

29. The statement ____ declares intList to be a vector and the component type to
be int

Points Earned: 2.0/2.0

30. Every call to a recursive function has its own code and its own set of ____ and
local variables

Points Earned: 2.0/2.0

31. The algorithm ____ is used to find the elements in one range of elements that
do not appear in another range of elements.

Points Earned: 2.0/2.0

32. The ____ in a binary tree is the number of branches on the path from the root
to the node.

Points Earned: 2.0/2.0

33. A B-tree can be ____ in three ways: inorder, preorder, and postorder.

Points Earned: 2.0/2.0

34. ____ are systems in which queues of objects are waiting to be served by
various servers

Points Earned: 2.0/2.0

35. A class and its members can be described graphically using a notation known
as Unified Modeling Language (UML) notation.

Points Earned: 2.0/2.0

36. The term asymptotic means the study of the function f as n becomes larger
and larger without bound.

Points Earned: 2.0/2.0

37. To simplify operations such as insert and delete, you can define the class to
implement the node of a linked list as a struct.

Points Earned: 2.0/2.0

38. The destructor automatically executes when the class object goes out of ____.

Points Earned: 2.0/2.0

39. The syntax for accessing a class (struct) member using the operator -> is
____.

Points Earned: 2.0/2.0

40. The expression vecCont.empty() empties the vector container of all elements.

Points Earned: 2.0/2.0

41. If we compare the push function of the stack with the insertFirst function for
general lists, we see that the algorithms to implement these operations are
similar.

Points Earned: 2.0/2.0

42. If the data needs to be processed in a First In First Out (FIFO) manner, we
typically use a(n) ____.

Points Earned: 2.0/2.0

43. A(n) ____ is a data type that separates the logical properties from the
implementation details.

Points Earned: 2.0/2.0

44. In the second form of ____, the binary operation op is applied to the elements
in the range.

Points Earned: 2.0/2.0

45. The ____ algorithm tries to extend a partial solution toward completion

Points Earned: 2.0/2.0

46. After inserting (or deleting) a node from an AVL tree, the resulting binary tree
does not have to be an AVL tree.

Points Earned: 2.0/2.0

47. Every customer has a customer number, arrival time, waiting time,
transaction time, and departure time.

Points Earned: 2.0/2.0

48. We need ____ pointers to build a linked list.

Points Earned: 0.0/2.0

49. Because an AVL tree is a binary search tree, the search algorithm for an AVL
tree is the same as the search algorithm for a binary search tree.

Points Earned: 2.0/2.0

50. The ____ operation is used to add an element onto the stack.

Points Earned: 2.0/2.0