DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

SIXTH SEMESTER B.E. DEGREE INTERNAL EXAMINATION, JULY - 2021

Introduction to Data Structures and Algorithms
THIRD INTERNALS
Time: 9:30AM–11.30AM Max. Marks: 50
Date: 30/07/2021 Sub Code:18CS652
Answer any FIVE from the following: (5 *10 = 50)

1. Define Queue. Explain the logical representation of queues

OR
2. What are the different application arears of queue data structure? Explain any one in brief.

3. Write a C program to implement queue using array.

OR
4. Write a C program to implement queue using linked list.

5. Explain the working of Circular queue with the help of neat diagram. What is the objective of
implementing a queue in circular fashion?
OR
6. Write a C program to insert and delete an element in a circular queue.

7. What is a Priority queue? How it is different from an ordinary queue? Write a C function to insert an
element into a priority queue.
OR
8. What are double ended queues? Explain with C function how to insert and delete an element using front
end of double ended queue.

9. What is a graph? Explain the terms: i) Degree ii) Path iii) Cycle iv) Loop V) Complete graph
OR
10. Explain how a graph is implemented using adjacency matrix by taking any simple graph as example.