CSCE 121 Chapter Notes - Chapter 16: In C, Increment And Decrement Operators, Iterator

• School: Texas A&M University
• Department: Computer Sci & Engr
• Course: CSCE 121
• Professor: Michael D Quinn

Document Summary

True/false: linked lists allow you to overcome the size limitations of an array data type. Ref: 1032: memory for the components of an array does not need to be contiguous. Ref: 1032: you can use the pointer head of a linked list to traverse the list. Ref: 1036: in a linked list, if a new item is always inserted at the beginning or at the end of the list and the data read is unsorted, the linked list will be unsorted. Ref: 1040: when you build a linked list in the backward manner, a new node is always inserted at the end of the linked list. Ref: 1040: you deallocate the memory for a linked list by calling the operator clear. Ref: 1052: the length of a linked list is the number of nodes in the list. Ref: 1053: it is not possible to create an ordered linked list. Ref: 1066: a linked list is a random access data structure.