Page 21 - DCAP201_FUNDAMENTALS_OF_DATA_STRUCTURES

Fundamentals of Data Structures

Notes Linked list: A linked list, or one-way list, is a linear collection of data elements, called nodes,
where the linear order is given by means of pointers.

Queue: A queue, also called a first-in-first-out (FIFO) system, is a linear list in which deletions
can take place only at one end of the list, the "front" of the list, and insertions can take place only
at the other end of the list, the "rear" of the list.
Stack: A stack is a linear structure in which items may be added or removed only at one end.

Tree: A tree is an acyclic, connected graph which contains no loops or cycles.

1.6 Review Questions

1. Explain the concept of data structure with example.
2. Discuss how to select a data structure to solve a problem.

3. What are data types? Classify various C data types.
4. What are the different floating-point types in C? Also discuss the minimal requirement
for storage size.
5. Make distinction between character types and enumeration types.
6. Differentiate between linear and non-linear data structure.

7. Discuss the concept of stacks with example.
8. Illustrate the difference between LIFO and FIFO system.
9. Discuss linked list in brief with example.

10. Graphs are classified in the non-linear category of data structures. Comment.

Answers: Self Assessment

1. data structure 2. Resource constraints
3. data type 4. limits.h

5. Floating-point 6. Char
7. 1-byte 8. enumerated types or enum
9. 0 10. Linear
11. two-dimensional 12. Stack

13. dequeue 14. Nodes
15. tree

1.7 Further Readings

Books Davidson, 2004, Data Structures (Principles and Fundamentals), Dreamtech Press
Karthikeyan, Fundamentals, Data Structures and Problem Solving, PHI Learning
Pvt. Ltd.

14 LOVELY PROFESSIONAL UNIVERSITY