23-09-2014, 03:43 PM
Question Paper Code : 53309
B.E./B.Tech. DEGREE EXAMINATION, MAY/JUNE 2014.
Third Semester
Electrical and Electronics Engineering
CS 1211 - DATA STRUCTURES AND ALGORITHMS
(Common to Electronics and Instrumentation Engineering and Instrumentation and Control Engineering)
Time : Three hours (Regulation 2004/2007)
Maximum : 100 marks
Answer ALL questions.
PART A (10 x 2 = 20 marks)
1.What is the basic idea behind ADT?
2.Define depth of recursion.
3.List three examples that use linked list.
4.What are the applications of stack?
5.Define Pre-order traversal.
6.What are the two methods of binary tree implementation?
7.What is the advantage of quick sort?
8.What are the various factors to be considered in deciding a sorting algorithm?
9.Define out degree of a node
10.What is meant by strongly connected in a graph?
Full Name :Arumugam.P
College Name :SNS College Of Technology
Department :EEE
Semester :03
Subject Code :CS1211
Subject Name : Data Structures
Study Material Description :QP
Attachment :
[attachment=17302]
