CS8391 Data Structures Anna University Questions Answers Nov Dec 2019

CS8391 Data structures exam questions and answers, Anna University CS8391 questions, Data structures university exam solved question paper, CS8391 Data Structures CSE/IT/CCE answers, CS8391 Data structures regulation 2017

 

Exam	B.E/B.Tech. (Full Time) DEGREE END SEMESTER EXAMINATIONS
Academic Year	November December 2019
Subject Code	CS8391
Subject Name	Data Structures
Branch	Computer Science and Engineering / Information Technology / Computer and Communication Engineering
Semester	Third Semester
Regulation	2017

 

B.E / B.Tech. (Full Time) DEGREE END SEMESTER EXAMINATIONS, NOVEMBER / DECEMBER 2019

CSE / IT / CCE

Third Semester

CS8391 – Data Structures

(Regulation 2017)

Time : 3 Hours                      Answer A L L Questions                Max. Marks 100

PART-A (10 x 2 = 20 Marks)

 

1. Define Linked List.

2. Define an Abstract Data Type.

3. List the applications of stacks.

4. State the rules to be followed during infix to postfix conversions.

5. What do you mean by level of the tree?

6. Define a binary search tree.

7. What is meant by strongly connected in a graph?

8. Define adjacency list.

9. What do you mean by internal and external sorting?

10. Define radix sort.

 

PART -—B (5x13=65 Marks)

 

11. a) Explain the insertion operation linked list. How nodes are inserted after a specified node?

(OR)

b) What are the applications of linked list in dynamic storage management?

 

12. a) Write an algorithm for Push and Pop operations on Stack using Linked list.

(OR)

b) What is DeQueue? Explain its operation with example.

 

13. a) Explain the tree traversal techniques with an example.

(OR)

b) How to insert and delete an element into a binary search tree and write down the code for the insertion routine with an example.

 

14. a) Explain depth first and breadth first traversal.

(OR)

b) Explain the various applications of Graphs.

 

15. a) Write an algorithm to implement selection sort with suitable example.

(OR)

b) Write an algorithm for binary search with suitable example.

 

PART —C (1x15=15 Marks)

 

16. a) There are ‘N’ numbers of balls in the box. The colours of the balls are red and blue. You are requested to stack the balls in the bottom sealed basket one by one. The order of placing the balls is two consecutive red balls followed by two consecutive blue balls. Later, Create two empty queues Q1 and Q2. Remove the last inserted ball from the basket and place it in Q1. Similarly remove the next ball from the basket and insert in Q2. Develop a program to repeat this process until the basket is empty and also print the colour of the balls in both queues.

(OR)

b) Implement a priority queue using linked list.

 

***********

Related links/questions: Link1 Link2 Link3 Link4 Link5