Spring 2018 coSC113.101 Test 3: 5/8/2018 13. The C++ operator is used to destroy dynamic variables. b. delete b, % b, destructor a. destroy 14. Which of the following operations is allowed on pointer variables? a. exp 15. A classautomatically executes whenever a class object goes out of scope. c. pointer d. exception a. constructor 16. Linked lists allow you to overcome the size limitations of an array data type. 17. The length of a linked list is the number of nodes in the list 18. A singly linked list can be traversed in either direction. 19. A linked list is a collection of components, called (True /False) (True /False) (True /False) a. elements b. nodes c. members d. pointers 20. Every node (except of the last node) in a singly linked list contains a. the next node b. no address information c-the address of the next node d. the address of the previous node 21. The link field of the last node of a linked list is 22. Because each node of a linked list has two components, we need to declare each node as a(n) 23. What is the purpose of the following code? a nullptr b, 1 c. n-1 d. undefined a. reference and string c. index and element b. int and object d. class or struct current head; while (current l- nullptr) //Process current current current->link; a. Insertion of a node c. Traversal of a linked list b. Selection of a node d. Creation of a new list 24. Which of the following is a basic operation on singly linked lists? (An operation implemented as a member method which can be easily executed) a. Retrieve the data of an arbitrary node. b. Swap the head and the last nodes. c. Determine whether the list is nearly full. d. Make a copy of the linked list. 25. In a recursive function, the base case stops the recursion. 26. With recursion, the base case must eventually be reduced to a general case. 27. To design a recursive function, you must determine the limiting conditions. 28. Consider the following definition of a recursive function. (True/False (True/ False (True/Fals int recFunclint num) if (num>- 10) return 10