Question Paper Code : 33310
B.E./B.Tech. DEGREE EXAMINATION, NOVEMBER/DECEMBER. 2013.
Third Semester
Electrical and. Electronics Engineering
CS 1211 — DATA STRUCTURES AND ALGORITHMS
(Common to Electronics and 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 said tobe a sequence? Is it an ADT? Justify.
2.State the differences. in implementing structure and union in C.
3.How is a stack represented in. C? How does it felicitate insertion?
4.How do you define a header node? Is it different for singly, doubly and circular linked list? Why?
5.How is an array used for representing binary free?
6.What is a threaded binary tree? State the applications.
7.State the notations used for expressing effciencies of sorting schemes.
8.What is the principle of interpolation search?
9.What are the advantages of linked representation of graphs?
10.Write the procedure for constructing graph, from a given adjacency matrix.
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 :
DS ND2013 QP.pdf (Size: 1.65 MB / Downloads: 163)
Share your Study Materials with us : 