CSC 3102 Chapter : Arrays And Linked Lists
Document Summary
Review: chapters 1 and 2 of goodrich et al represent a review of csc 1253 / 1350. Introduction to computer science i and csc 1254 / 1351 introduction to computer. A sequence container is a simple 1-dimensional collection of elements. All sequence containers share the same set of basic operations: append. Expansion beyond the maximum is disallowed: elements are stored contiguously and sequentially in memory, thus, elements are referred to by index, the element count must be stored. Singly linked lists: lists have dynamic size, elements need not be stored contiguously or even in sequential order, elements are referred to by reference, each element contains a reference to the following element. This is overhead: a reference to a singly linked list consists of only a reference to its first element. Doubly linked lists: each element contains a reference to both the preceding element and the following element.
