SET 1

DEPARTMENT OF ARTIFICIAL INTELLIGENCE AND DATA SCIENCE

MID SEMESTER - 1 EXAMINATION
18AIC203J - DATA STRUCTURES AND ALGORITHMS

Year/Semester & Branch: II/III & AI&DS Date:

Faculty Name: Ms.A.Nithyasri Max. Marks: 50 Time:

PART-A Answer ALL Questions (10x2=20 Marks)

1. Differentiate linear and non-linear data structures. CO1 K1
In what condition could be a doubly linked list is more beneficial than singly
2. CO1 K2
linked list.
3. Mention the features of ADT. CO1 K1
4. When singly linked list can be represented as circular linked list? CO1 K2
5. List out the different ways to implement the list? CO1 K1
6. State the applications of stack and Queue. CO2 K1
7. Convert the infix (A+B)*(C+D)/F into postfix & prefix expression CO2 K2
8. Differentiate stacks and queues CO2 K2
9. Define circular queue. CO2 K1
10. Give the applications of priority queues. CO2 K2

PART-B Answer ALL Questions (2x15=30 Marks)

Illustrate and write a routine for singly linked list with insert, delete, display
11. (a) CO1 K2
Operations.
(or)
3 2
11. (b) State the polynomial representation for 5x +3x +11x+4 using a linked list. CO1 K3
Write a routine to add two polynomials and explain with suitable examples.
i) Give an algorithm for push and pop operations on stack using a linked list.
ii)Write an algorithm to convert the following infix expression to postfix
12. (a) CO2 K3
expression using stack. Trace the algorithm and show the stack contents. The
expression is (A+B)*C/D+E/F.
(or)
i) Write routine to perform the following operations on queue.
1) Enqueue( )
2) Dequeue( )
12. (b) 3) IsEmpty( ) CO2 K2
4) IsFull( )
ii) Discuss about insertion and deletion operations performed on a dequeue
with example.

*****

Verified by Approved By
 SET 2

DEPARTMENT OF ARTIFICIAL INTELLIGENCE AND DATA SCIENCE

MID SEMESTER - 1 EXAMINATION
18AIC203J - DATA STRUCTURES AND ALGORITHMS

Year/Semester & Branch: II/III & AI&DS Date:

Faculty Name: Ms.A.Nithyasri Max. Marks: 50 Time:

PART-A Answer ALL Questions (10x2=20 Marks)

1. Define Abstract Data Type. CO1 K1
2. How the singly linked lists can be represented? CO1 K2
3. State the difference between array and linked list. CO1 K2
4. List down the applications of Linked List. CO1 K1
5. Write the postfix notation for following expression: (A+B)*C-(D-E)^F CO1 K2
6. What are priority queues? State the ways of its implementation CO2 K1
7. Mention the operations of the stack? CO2 K1
8. Differentiate double ended and circular queues CO2 K2
9. List out the applications of queue? CO2 K1
10. How do you test for an empty queue? CO2 K2

PART-B Answer ALL Questions (2x15=30 Marks)

Illustrate and write a routine for doubly linked list with insert, delete, display
11. (a) CO1 K2
Operations.
(or)
i) Discuss an algorithm for array implementation of List ADT.
11. (b) CO1 K2
ii) Derive the Radix sort application of linked list in detail.
12. (a) Briefly describe the operations of queue with examples. CO2 K2
(or)
i) Write the function to examine whether the stack is full() or empty()
12. (b) CO2 K2
ii) Explain any one application of stack.

*****
Verified by Approved By