Scribd
Upload
31 views2 pages

20ee404-20cs432-Data Structures and Algorithm

This document is an examination paper for the B.E. in Electrical and Electronics Engineering at K.S.R. College of Engineering, focusing on Data Structures and Algorithms. It includes two parts: Part A consists of 10 short answer questions worth 2 marks each, and Part B contains 5 detailed questions worth 16 marks each. The exam covers various topics such as binary trees, hashing functions, and algorithms for shortest paths and minimum spanning trees.

Uploaded by

dd8603739
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
31 views2 pages

20ee404-20cs432-Data Structures and Algorithm

This document is an examination paper for the B.E. in Electrical and Electronics Engineering at K.S.R. College of Engineering, focusing on Data Structures and Algorithms. It includes two parts: Part A consists of 10 short answer questions worth 2 marks each, and Part B contains 5 detailed questions worth 16 marks each. The exam covers various topics such as binary trees, hashing functions, and algorithms for shortest paths and minimum spanning trees.

Uploaded by

dd8603739
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

Reg. No.

K.S.R. COLLEGE OF ENGINEERING, TIRUCHENGODE – 637 215


(AUTONOMOUS)

B. E. / B.Tech. DEGREE END SEMESTER EXAMINATION, MAY / JUNE - 2022

Fourth Semester

B.E. – ELECTRICAL AND ELECTRONICS ENGINEERING

20CS432 - Data Structure and Algorithms

(Regulations 2020)

Time: Three hours Maximum Marks: 100


Answer All Questions

PART A –– (10 x 2 = 20 Marks)

1. Relate an abstract data type with a user defined data type. CO1 R

2. Convert the following infix expression into postfix expression. CO1 E


A*(B+C^D)-E^F*(G/H).

3. List the applications of Trees. CO2 R

4. How can you identity full binary tree? CO2 E

5. Define hashing function. CO3 R

6. Suggest the other operations performed on heap. CO3 Ap

7. Define minimum cost spanning tree. CO4 U

8. Write the complexity of dijkstra’s algorithm. CO4 U

9. Identify types of Asymptotic notation. CO5 An

10. How the vertices is divided into 3 categories in prim’s algorithm? CO5 E

1
PART B –– (5 x 16 = 80 Marks)

11. (a) Explain how to evaluate arithmetic expressions using stacks. (16) CO1 An

(OR)
(b) Discuss in detail about the steps involved in insertion and deletion (16) CO1 An
into a singly and doubly linked list.

12. (a) Explain binary search tree ADT in detail. (16) CO2 U

(OR)
(b) Construct an expression tree for the expression (a + b * c) +((d * e (16) CO2 E
+ 1) * g). Give the outputs when you apply preorder, inorder and
postorder traversals.

13. (a) Create and discuss a different types of AVL tree rotations with neat (16) CO3 C
diagram.
(OR)
(b) Compare and discuss about B tree and B+ tree ADT in detail. (16) CO3 Ap

14. (a) How can you find shortest path using single source shortest path (16) CO4 E
algorithm with an example graph in detail?
(OR)
(b) Outline the principle to find the minimum cost spanning tree of an (16) CO4 U
undirected weighted graph.

15. (a) Discuss the steps involved in Kruskal’s algorithm with suitable (16) CO5 U
example.

(OR)

(b) Analyse the back tracking in knapsack problem with example. (16) CO5 An

**********

You might also like