Multiple choices

1. The value of a pointer is an ______ A. address B. entry in a table C. array D. unknown value

2. The ___________ can be used to determine whether two stacks are identical A. rational operator B. logical operator C. relational operator D. arithmetic operator

3. The class linkedListType is an(n) ____________ class and therefore does not implement all the operations A. derived B. partial C. abstract D. generic

4. The operation _________ reinitializes the stack to an empty state A. alloc B. init C. initializeStack D. new

5. To remove, or pop, an element from the stack_____________ A. decrement stackTop by 1 B. increment stackTop by 1 C. invert stackTop D. do nothing 6. Trailer nodes at the end of the list should contain a value ___________ A. smaller than the largest value in the data set B. larger than the largest value in the data set C. smaller than the smallest value in the data set D. the same size as the smallest value in the data set

7. ____________ lists have elements that are in no particular order A. Search B. Structured C. Unsorted D. Randomized

8. A data structure in which the elements are added and removed from one end only is known as _________________ A. queue B. deque C. hash table D. stack

9. We need ___________ pointers to build a linked list A. two B. three C. four D. five

10. To determine whether the item to be inserted is already in the list, the insert function calls the _____________ member function A. isEmpty B. size C. seqSearch D. copy

11. A linked list is a collection of ______________________ A. classes B. nodes C. addresses D. memory variables

12. A stack is a __________ data structure A. FIFO B. LIFO C. FILO D. LILO 13. The _______ operation is used to add an element onto the stack A. push B. pop C. add D. insert

14. In an array list the time complexity of the remove function is identical to the time complexity of the ______________ function A. insert B. isEmpty C. isFull D. maxListSize

15. A clients program can include a header file via the ____________ statement A. pragma B. include C. using D. matching

16. Because all the elements of a stack are of the same type, you can use a(n) ______________ to implement a stack A. struct B. array C. record D. class

17. The correct syntax for the destructor of the class tempClass is ________________ A. tempClass::~tempClass() B. tempClass::~tempClass(x) C. tempClass::tempClass() D. tempClass::tempClass(x)

18. Building a linked list backward places the item to be added at the ________ of the linked list A. beginning B. end C. middle D. key point

19. Searching through a linked list or inserting an item in a linked list requires a ____________ of the list A. review B. deletion C. copying D. traversal 20. ___________________ is a basic operation of the linked list ADT A. Initializing the list B. Comparing two lists C. Sorting the list D. Dividing the list

21. The value of a pointer variable is an ______ A. address B. entry in a table C. array D. unknown value

22. An array created during the execution of a program is called a ____________ array A. static B. final C. just in time D. dynamic

23. Because initially the list is empty, the pointer first must be initialized to ______________ A. NULL B. EMPTY C. NIL D. NOP

24. The address of the first node in the list is stored in a separate location, called the ______ A. head B. tail C. key D. top

25. The function _____________, if possible, evaluates the expression and leaves the result in the stack A. printResult B. clearStack C. readExpression D. evaluateExpression

26. A linked list in which the last node points to the first node is called a ___________ linked list A. circular B. recursive C. standard D. doubly

27. If a class has member variables that are pointers, you must ensure that you implement _________ A. Garbage collection B. Base constructors C. Friend functions D. A destructor

28. A(n) ______________ is a list of items, called nodes, in which the order of the nodes is determined by the address, called the link, stored in each node A. array B. structure C. linked list D. hash table

29. A linked list is not a random access data structure such an a(n) ________________ A. stack B. deque C. structure D. array

30. The addition and deletion of elements occurs only at one end of a stack, called the ____________ of the stack A. head B. top C. bottom D. tail

31. In an array list, the time complexity of the removeAt function is identical to thetime complexity of the ______________ function. A. isEmpty B. seqSearch C. isFull D. isItemAtEqual

32. In a linked list, we always want head to point to the ____________ node A. key B. main C. first D. last 33. The ______________ operation checks whether the stack is empty A. isFullStack B. isEmptyStack C. peek D. pop

34. The data type of each __________ depends on the specific application A. pointer B. node C. address D. link

35. The stack is empty if stackTop is ______ E. 0 F. NULL G. 1 H. MAX