SRM University 2007 B.Tech Computer Science and Engineering BANMK - Question Paper

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING
S.R.M.ENGINEERING COLLEGE
ques. BANMK
II B.Tech (CSE)
SUBJECT: Data Structure
CODE: CS203.

UNIT – I
PART – A
1. What is mean by ADT? discuss with an example
2. Define Data structure.
3. What is a data kind list out the primitive data kinds supported by C language?
4. Define Algorithm
5. Define Array elaborate the various array operation
6. What is mean by sparse matrix?
7. What are the various kinds of control structures?
8. Write down the worst case avg. case for followings.
i. Linear search
ii. Binary search
iii. Insertion sort
iv. Selection sort
v. Merge sort
9. Compare linear and binary search.
10. How to store the string in fixed length structure.
11. How to store the string in variable length structure.
12. How to represent linear array in memory.
13. Difference ranging from open hashing and closed hashing.
14. How to avoid collisions in hashing.

PART – B
1. Explain time and space complexity of an algorithm.
2. Explain various kinds of control structure with example.
3. What is mean by string? discuss string operation and how to store the string in various structure.
4. Sort the values 25 57 48 37 12 92 86 33 using insertion and selection sort. discuss algorithm
5. Explain merge sort and radix sort algorithm.
6. Write an algorithm for binary searching with example. Analyse the time requirement of the algorithm.
7. Explain different hashing techniques in detail.




UNIT – II
PART – A

1. Define stack
2. Explain PUSH, POP operations.
3. List any 2 applications of stack
4. Write algorithm for inserting an element into stack.
5. Explain infix, polish, reverse polish notations.
6. Explain the reduction step procedure in quick sort algorithm
7. What is the complexity of quick sort algorithm?
8. What is recursion?
9. Explain the recursive algorithm for 4!
10. What is queue?
11. List any two applications of queue.
12. How to represent a queue using linear array.
13. Define deque.
14. What is priority Queue?
15. Define Record.
16. Draw the hierarchical structure of a learner record.
17. What is a pointer? List its uses.

PART – B
1. discuss the operations on stack. And provide complete algorithm
2. Translate infix expression into its equivalent postfix expression.
a. (A-B)*(D/E)
b. (A+B^D)/ (E – F) + G
c. A*(B+D)/E –F* (G+H/K)
3. Consider the subsequent postfix expression P and evaluate the expression using stack.
P: 12, 7, 3,-, /, 2, 1, 5, +,*, +,)
4. Write the complete quick sort algorithm and what is the space complexity of the algorithm.

Earning:   Approval pending.