Page 60 - DCAP605_ADVANCED_DATA_STRUCTURE_AND_ALGORITHMS

Unit 2: Linked Lists

2.14 Keywords Notes

Circular Linked List: A linear linked list in which the last element points to the first element, thus,
forming a circle.
Doubly Linked List: A linear linked list in which each element is connected to the two nearest
elements through pointers.
Linear List: A one-dimensional list of items.
Linked List: A dynamic list in which the elements are connected by a pointer to another
element.
NULL: A constant value that indicates the end of a list.

2.15 Self Assessment

Choose the appropriate answer:
1. Pointers permit the referencing of structures in a
(a) Normal way (b) Uniform way

(c) Common way (d) None
2. A recursive data structure is a data structure that has the same form regardless of the
(a) Size of the data (b) Shape of the data
(c) Origin of the data (d) Form of the data

3. The insert function takes a pointer to an existing list as the
(a) Second parameter (b) Third parameter
(c) First parameter (d) None
4. A Circular Linked List has no
(a) Beginning and no mid point (b) End and last
(c) Beginning and beginning (d) Beginning and no end

Fill in the blanks:
5. Memory allocation in Linked Lists is ................................
6. Linked list stores two items of information: ..................... and ...........................
7. An ............................. function is used to create the list.

8. A ....................... is a list of elements in which the elements of the list can be placed anywhere
in memory.
State whether the following statements are true or false:

9. We cannot insert a node after any specifi c node.
10. In the single linked list each node provides information about where the previous node is
in the list.
11. A linked list is not a recursive data structure.

LOVELY PROFESSIONAL UNIVERSITY 55