Page 185 - DCAP201_FUNDAMENTALS_OF_DATA_STRUCTURES

Fundamentals of Data Structures

Notes Multiqueue: Multiqueue is a data structure where multiple queues are maintained.
Node: The object that holds the data and refers to the next element in the list is called a node.
One-dimensional Array: The array which is used to represent and store data in a linear form is
called as 'single or one dimensional array.'
Priority Queue: A priority queue is a collection of elements where each element is assigned a
priority.
Queue: A queue is a data collection in which the items are kept in the order in which they were
inserted.
Record: A record is a special type of data structure that collects different data types that define a
particular structure.

10.8 Review Questions

1. Explain the representation of Linear Queue with example.
2. Describe the implementation of a queue using arrays.

3. What is a multiple queue? Discuss the representation of Multiple Queues.
4. Explain the concept of representing circular queues.
5. What are the different methods used for the implementation of circular queue? Explain.

6. Explain the concept of priority queues with example.
7. Illustrate the process of inserting element in priority queue.
8. Illustrate the Linked List Implementation of Priority Queue with example.

9. Describe the array and linked list implementation of a dequeue.
10. Make distinction between priority queue and dequeue.

Answers: Self Assessment

1. rear 2. Elements

3. node 4. False
5. True 6. Circular
7. Linked list 8. priority queue
9. lower 10. Order

11. highest 12. Structure
13. Dequeue 14. doubly linked lists
15. pointers

178 LOVELY PROFESSIONAL UNIVERSITY