1.Short notes:Threated B-tree ,B-TREE ,sequential &linked representation of graphs in computer memory ,tail recursion. 4*3=12 2.
3.
B-tree order 3 way {a,f,b,k,h,m,e,s,n,c} 3 Write an algo – (i)circular queue linked list & array. 10 4.linklist and array compare (advantage/disadvantage)
5.parentesis program. 6.find postfix :Pre: A B D I E J C F G K In: D I B E J A F C K G 7.AVL :a,z,b,y,c,n,d,w,e,v,
8.linked list :- insertion /deletion.