DATA STRUCTURES
Unit III · Introduction to Data Structures
Clear answers, algorithms and worked examples for the current syllabus.
Questions and answers
- 01What is an ADT?2 marks
- 02Explain an abstract data type and distinguish interface from implementation.5 marks
- 03Name two factors in data-structure selection.2 marks
- 04Explain how to select a suitable data structure.5 marks
- 05What is a linear list?2 marks
- 06Define a linear list and explain its common operations.5 marks
- 07What does a singly linked-list node contain?2 marks
- 08Explain singly linked-list representation, creation and traversal.5 marks
- 09What changes when inserting at the head of a singly linked list?2 marks
- 10Explain singly linked-list insertion and deletion with algorithms.5 marks
- 11How is the last matching occurrence located?2 marks
- 12Give an algorithm to delete the last occurrence of a key in a linked list.5 marks
- 13How does a circular singly linked list end?2 marks
- 14Explain circular singly linked lists and their operations.5 marks
- 15What extra link does a doubly linked node contain?2 marks
- 16Explain doubly linked-list insertion, deletion and traversal.5 marks
- 17Which common list representation supports direct O(1) indexed access?2 marks
- 18Compare array lists, singly linked lists, circular lists and doubly linked lists.5 marks
- 19How do you search a singly linked list by key?2 marks
- 20Explain searching and counting nodes in a singly linked list.5 marks
No matching questions. Change the search or marks filter.
The 2- and 5-mark labels are practice allocations. Source examination questions retain their actual printed marks.