cosc 237-02: Exam3 Name (Please Print): Chbes AcpDate: Theory/Short Answer (2pts each) Please answer the following five questions using True or F alse: Appending a node means to insert the node at the rear of a linked list 1. 2. 3, 4, 5. The nodes within a linked list can be considered objects within a program. A dynamic stack can never become full as nodes are inserted A linked list can grow or shrink is size as the program runs. A queue's primary operations are push and pop. (2pts each) For Questions 6-10, match the correct term (a-e) with the correct statement: 6. stores items in a last-in first-out manner. 7. is needed when an object with a pointer is declared. 8. is a series of connected nodes. 9. a. linked list b. stack c. queue d. copy constructor -stores items in a first-in first-out manner e. indicator 10. is used to determine the condition of a stack and queue. 11. (5pts) What are the primary operations for manipulating a linked list? 12. (5pts) What is the underlying data structure used to create a dynamic stack and/or dynamic queue