Hello There, Guest! RegisterLogin with Facebook
Login with Facebook

New Anna University Nov / Dec 2016 Examination Important Questions
New Anna University (UG / PG) Nov/Dec 2016 and Jan 2017 Theory , Practical Exam Timetable
>>> Anna University Sixth Semester Question Bank Collection (R2013) ECE,MECH,CSE,IT,EEE,CIVIL,EIE
>>> Anna University November/December 2015 Examination Question Papers
>>> Anna University Study Materials for all Departments
>>> Anna University Question Papers : April May June 2015 Question Papers | Nov Dec 2014 and Jan 2015 Question Papers

Register or Login to Submit Study Materials , Shoutbox and also to access Many Features !!

Vidyarthiplus Shop :: Handwritten Premium Lecture Notes
Share your Study Materials with us
Share your Study Materials with us : Click Here

EE2204 Data Structures And Algorithms May June 2014 Question Paper
#1


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

   
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 :

.pdf   EE2204 DSA May June 2014 QP.pdf (Size: 856.84 KB / Downloads: 1,072)

aaru, proud to be a member of Vidyarthiplus.com (V+) - Online Students Community since Jan 2013.


Reply
#2

+2 Reputed

New Share your Study Materials with us : Click Here


Reply

Subscribe


Recommend on Google