Presentation is loading. Please wait.

Presentation is loading. Please wait.

Department of Computer Science 1 Some Practice Let’s practice for the final a little bit. OK?

Similar presentations


Presentation on theme: "Department of Computer Science 1 Some Practice Let’s practice for the final a little bit. OK?"— Presentation transcript:

1 Department of Computer Science 1 Some Practice Let’s practice for the final a little bit. OK?

2 Department of Computer Science 2 Chapter 5 Practice Quiz 1. True or False: A linked list is a collection of nodes. Answer: True 2. True or False: The address of the first node in the list is stored in a separate location called the root. Answer: False

3 Department of Computer Science 3 Practice Quiz 3. In a linked list, every node (except the last node) contains the ____ of the next node. Answer: address 4. Deletion of an item from a linked list requires ____ of the linked list. Answer: traversal

4 Department of Computer Science 4 Practice Quiz 5. Deleting an item from a linked list is best when performed with ____ pointer(s) so that the deleted node can be freed from memory. Answer: two

5 Department of Computer Science 5 Practice Quiz 6. True or False: A doubly linked list is a linked list in which every node has a next pointer and a back pointer. Answer: True

6 Department of Computer Science 6 Practice Quiz 7. True or False: A doubly linked list can be traversed in the forward direction. Answer: False 8. A(n) ____ list is not a random access data structure such as an array. Answer: linked

7 Department of Computer Science 7 Practice Quiz 9. True or False: A linked list with header and trailer nodes simplifies the insertion and deletion operations. Answer: True 10. A linked list in which the last node points to the first node is called a(n) ____ linked list. Answer: circular


Download ppt "Department of Computer Science 1 Some Practice Let’s practice for the final a little bit. OK?"

Similar presentations


Ads by Google