SRM University 2008 B.Tech Computer Science and Engineering CS-203 DATA STRUCTURES - Question Paper

BTech DEGREE EXAMINATION,DECEMBER 2008
3rd SEMESTER
CS203-DATA STRUCTURES
TIME:3 HRS MAX MARKS:70

ans ALL ques.
PART A (10 X two MARKS)



1. elaborate THE 3 kinds OF LOGIC OR FLOW OF CONTROL?
2. WHAT IS HASHING?
3. WRITE AN ALGORITHM TO PUSH AN ELEMENT IN STACK?
4. WRITE OVERFLOW CONDITION FOR QUEUE?
5 WHAT IS GARBAGE CONDITIONS?
6. WHAT IS CIRCULAR LINKED LIST?
7. describe BINARY SEARCH TREE?
8. WHAT IS USE OF HUFFERMAN'S ALGORITHM?
9. HOW DO YOU REPRESENT A GRAPH?
10. WHAT IS DIFFRENCE ranging from ADJACENCY AND COST ADJACENCY MATRIX?




PART-B (5 X 10= 50 MARKS)


11.a discuss THE subsequent
(1) LINEAR SEARCH
(2)BINARY SEARCH

(OR)

b. discuss trend MATCHING ALGORITHM WHOSE TIME COMPLEXITY IS O(n).

12.a discuss EVOLUTION OF POSTFIX EXPRESSION.

(OR)


b.EXPLAIN FOLLOWING:
(1) INSERTING AN ELEMENT IN QUEUE.
(2) DELETING AN ELEMENT IN QUEUE.

13.a INSERING AN ELEMENT INTO SORTED LINKED LIST.EXPLAIN.

(OR)

b. discuss DELETING NODE WITH A provided ITEM OF info.

14.a discuss HEAP SORT .


(OR)
b.EXPAIN TREE TRAVERSAL.

15.a discuss GRAPH TRAVERSAL.

(OR)

b. discuss WARSHALLS ALGORITHM


****************************************************************************

Earning:   Approval pending.