SASTRA University 2009-2nd Year B.Tech Computer Science and Engineering Data Structure Mid Sem 1 -Academic year -2010 - Question Paper

SASTRA UNIVERSITY
Thirumalaisamudram thanjavur 613402
B.Tech Computer Science and Engineering
I Mid Sem - July 2009

Sub : Data Structure
Part A 10*2 =20
Part B 15*2 =30
MM : 50

Part A
1.With an example discuss pseudo code ?
2.What are the 3 statement construct ?
3.State the difference ranging from atomic and composite data?
4.What are the 2 basic structures which are used to implement an abstract data kind ?
5.Write the pseudo code definition for a learner data structure ?
6.What are the rules for designing a recursive algorithm ?
7.Write the pseudo code for the GCD(a,n).
8.write pseudo code for RetrieveNode (list , key ,data out)
9.state the different stack operations.
10.What is back tracking ?

Part B

11.Write the iterative Factorial and recursive factorial algorithms and show how they differ .Trace the algorithms. Emphasize more on recursive one.
OR

12. State and discuss the towers of Hanoi issue and algorithms. Show the effect of recursion.
Trace it for n =3.. write the simple C program for it.

13.Write the pseudo code for the following:
pushstack(stack,data)
. popstack(stack,dataout)
enqueue(queue,dataIN)
dequeue(queue,item)
insertNode(list,ppre,datain)
OR

14.Write pseudo code for the following:
1.searchList(list,ppre,ploc,target)
2.postfixevaluate(expr)
3.parseparens()

Earning:   Approval pending.