EE2204 Data Structures And Algorithms May June 2014 Question Paper
Posted: Mon Aug 18, 2014 1:01 pm
Full Name :Arumugam.P
College Name :SNS College of Technology
Department :EEE
Semester :03
Subject Code :EE2204
Subject Name : DATA STRUCTURES AND ALGORITHMS
Study Material Description :aaru edition 2014 QP
Maximum : 100 marks
Answer ALL questions.
PART A— (10 x 2 20 marks)
1.Write an algorithm to insert after node p in a singly linked list.
2.Write the infix and postfix expression of the following Prefix expression
3.Differentiate Tree and Binary tree.
4.State the applications of trees.
5.State the need for collision resolution and the various techniques used.
6.Define bi-connectivity and articulation points.
7.What is a spanning tree? Namp any two algorithms used to find MST.
8.State the purpose of AVL trees and the various rotation methods.
9.Differentiate Dynamic Programming from Divide and Conquer and Greedy method.
10.Calculate the space, time complexity for the following code.
Attachment :
College Name :SNS College of Technology
Department :EEE
Semester :03
Subject Code :EE2204
Subject Name : DATA STRUCTURES AND ALGORITHMS
Study Material Description :aaru edition 2014 QP
- EE2204 DSA May June 2014 QP.png (33.13 KiB)
Anna University , Chennai
Question Paper Code : 51434
B.E./B.Tech. DEGREE EXAMINATION, MAY/JUNE 2014.
Third Semester
Electrical and Electronics Engineering
EE 2204/EE 36/080300003/10133 EE 306 — DATA STRUCTURES AND
ALGORITHMS
(Common to Electronics and Instrumentation Engineering and Instrumentation and
Control Engineering)
(Regulation 2008/2010)
(Common to P TEE 2204 — Data Structures and Algorithms B.E. (Part-Time) — Second Semester, Electrical and Electronics Engineering — Regulation 2009)
Time : Three hours Maximum : 100 marks
Answer ALL questions.
PART A— (10 x 2 20 marks)
1.Write an algorithm to insert after node p in a singly linked list.
2.Write the infix and postfix expression of the following Prefix expression
3.Differentiate Tree and Binary tree.
4.State the applications of trees.
5.State the need for collision resolution and the various techniques used.
6.Define bi-connectivity and articulation points.
7.What is a spanning tree? Namp any two algorithms used to find MST.
8.State the purpose of AVL trees and the various rotation methods.
9.Differentiate Dynamic Programming from Divide and Conquer and Greedy method.
10.Calculate the space, time complexity for the following code.
Attachment :
