Page 115 - DCAP201_FUNDAMENTALS_OF_DATA_STRUCTURES

Fundamentals of Data Structures

Notes 7.4 Keywords

Circular Linked List: A circular linked list is a list where last node of the list points back to the
first node (or the head) of the list.

Doubly Linked List: A doubly linked list is a list that has two references, one to the next node and
another to previous node.
Linked List: A linked list is a collection of objects linked together by references from one object
to another object.
Malloc: The function malloc is used to allocate a certain amount of memory during the execution
of a program.
Multilinked List: A multilinked list is a more general linked list with multiple links from nodes.
Node: A node is a struct with at least a data field and a reference to a node of the same type.
Singly Linked List: A singly linked list consists of a number of nodes in which each node has a
next pointer to the following element.
Sparse Matrix: A sparse matrix is a large table of data where most are undefined.

7.5 Review Questions

1. Explain the concept of linked list with example.

2. Discuss the advantages and disadvantages of linked lists.
3. Discuss the various issues associated with linked lists.
4. Illustrate how to design the node of a linked list.

5. Describe the representation of linked lists in memory with example.
6. What is a singly linked list? Illustrate how to create a singly linked list.
7. Explain doubly linked list with example.
8. Describe the concept of Linked List with two pointers.
9. In circular linked lists each node has a successor. Comment.

10. Discuss the application of Circular Linked List.

Answers: Self Assessment

1. True 2. False
3. True 4. True
5. False 6. True

7. singly 8. Head
9. doubly 10. data type
11. multilinked 12. sparse matrix
13. circular 14. NULL

15. record

108 LOVELY PROFESSIONAL UNIVERSITY