Вы находитесь на странице: 1из 7

# Q-1 Compare Stack & Queue write down their operations with example. Q-2.

Write short note on Priority, Deque & Circular Queue and explain their operations. Q-3. Write postfix of ((A + B) ((C + D) * E / F) * G) notations, also write program for its postfix calculation. Q-4. What are the operations performed on single linear linked list? Write the algorithms. Q-5. Define Data structure and differentiate between linear and nonlinear data structure. Define ADT also. Q-6 What are sparse matrics? give an example. . Q-7 write an algorithm to implement Binary Search with example. Q-8 Explain Insertion sort algorithm. Apply this sorting on the given array elements. 35, 20, 40, 100, 3, 10, 15.\$\$\$\$\$ Q-9 Each element of an array a[-2020,1035] requires one byte of storage. If the array is column major implemented, and the beginning of the array is at location 500, determine the address of the element a[0,30]. Q-10 Write most commonly used function in data structure. Q-11What do u mean by Complexity? Explain Time Complexity and Space Complexity and write down Time-Space Trade off. Q-12 Explain the memory addressing schemes for two dimensional arrays with suitable Example. Q-13 Show how sparse matrix is represented in memory. Q-14 What do u mean by Stack? Explain with suitable example with all its operations. Q-15 How Stack can be represented in memory. Q-16 What do u mean by PUSH and POP operation in Stack and Write down their algorithm. Q-17 Write a C program to implement stack by using ARRAY. Q-18 Write a Cprogram to implement Stack dynamically. Q-19 Write down the algorithm to convert infix notation into postfix. OR Write down algorithm to evaluate the infix expression. Q-20 Convert the following notation into postfix and prefix y A ^ B * C D + E / F / (G + H) y A + (B * C (D / E ^ F ) * G) * H y A \$ B * C D + E / F / (G + H) y A B / (C * D^ E ) y A*(B+ C /(E/F *G)-D) Q-21 Draw a Linked and vector representation of Sparse matrix of the following matrix

Q-22 Convert following prefix expression into infix expressiony -+ * BC * DE /AC y + / A B - * CDE Q-23 Write down the algorithm to evaluate the postfix expression. OR Write down the algorithm to convert postfix to infix. Q-24 Convert the following postfix expression into infixABD + * E/F G H K /+* -

Q-44 Explain the following terms(1) Tree (2) Binary Tree (3) Vertex of Tree (4) Forest (5) Depth (6) Height (7) Level (8) Degree of an element (9) Degree of tree (10)Leaf Q-46 Explain 2-tree. Q-47 In the following Tree

1 2 5 1 9 12 14 11 3 7

4 8

16 6

17 18

Define and find out followingI. Sibling of node 1 II. The subtree with root 5 III. The height of root 3 IV. The depth of node 16 V. The longest path in tree Q48-explain following terms 1. Strictly binary tree 2. Complete binary tree 3. Almost Complete binary tree Q49-how to represent binary tree in memory? Q50-prove a binary tree with n elements,n >0 has exactly n-1 edges.

Q51- prove a binary tree of height h,h>0 has almost 2h-1 elements in it. Q52- prove that,for any nonempty binary tree,if n0 is number of leaf nodes and n2 is number of nodes with degree 2 then n0=n2+1. Q53-what do you mean by traversing a tree? Q54-write non-recursive algorithm to traverse the tree in preorder. Q55- write non-recursive algorithm to traverse the tree in inorder. Q56- write non-recursive algorithm to traverse the tree in post-order. Q57-construct binary tree if its inorder and post-order traversals are asin-order-c b d a f e post-order-c d b f e a Q58-write a recursive procedure which finds the number NUM of nodes in TREE. Q59- write a recursive procedure which finds the depth of tree. Q60- traverse the following binary tree in preorder and inorder with reason.

G D F

H
Q-61traverse the following binary tree in preorder ,postorder and inorder. A

L Q62- traverse the following binary tree in preorder ,postorder and inorder. Q63- draw binary tree of following algebraic equation. [a+(b-c)*[(d-e)/(f+g-h)] Q67- draw binary tree of following equation. E=(2x+y)(5a-b)

Q68-A binary tree has 9 nodes .The inorder and preorder traversels yields the following sequence. Inorder-E A C K F H D B G Preorder-F A E K C D H G B Q69-For the following expression ((((a*x+b)*x+c)*x+d)*x+e)*x+f Construct the expression tree.find the equivalent postfix notation. Q70-(a)draw all possible binary tree with 3nodes. (b) draw all possible binary tree T where T is a 2 tree with 4external node. Q71-give a binary tree representation of the following forest.

E A
A

K H G L

F C I J D

Q72-what do you mean by threaded binary tree and show memory representation for threaded binary tree. Q73- write a c function to traverse threaded binary tree in inorder. Q74-implement binry tree through c. Q75-what do you mean by searching ?explain. Q76- what do you mean by linear searching ?explain. Q77- what do you mean by binary searching ?explain. Q78-compare linear search and binary search. Q79-implement linear search and binary search. Q80-explain following sorting techniques with suitable example and write down the algorithm or c function and comment on their complexity. 1. Insertion sort 2. Bubble sort 3. Selection sort 4. Quick sort Q81-Sort following data with the help of quick sort. 5,6,1,3,2,9,8,4,7 Q82-write a non recursive algorithm of quick sort and analyze it. Q83-write an algorithm to implement two way merge sort. Q84-what do you mean by heap sort .explain and write analysis of heap sort. Q85-sort following data with help of heap sort 3,6,8,1,4,5,9,7,2 Q86-what do you mean by binary search tree?

Q87-draw binary search tree of following data. 8,6,1,4,3,7,5,9,2 Q88-explain deletion of node in binary search tree. Q89-write the algo. deletion of node in binary search tree. Q90-what is B-tree?explain. Q91-how to insert and delete the element in B-tree? Q92- what is B+ tree?explain Q59-draw a B-tree of order 3 of following data 1,2,9,8,6,5,3,4,10,7 Q93- draw a B-tree of order 5 of following nodes. A,B,C,D,E,F,G,H,J,K,L,M,N,P,R,S,T,U,X Q94-define AVL tree,give the algo. to insert a new node in AVL tree. Q95-the following keys are to be inserted in order show into AVL tree 50,45,80,95,26,43,105,2 Show how tree appears after each operation. Q96- the following keys are to be inserted in order show into AVL tree A,Z,B,Y,C,X,D,U,E Show how tree appears after each operation. Q97-explain following terms1. Graph 2. Connected graph 3. Weighted graph 4. Tree 5. Parallel edges 6. Multiple edges 7. Isolated vertex 8. Neighbours or adjacent vertex 9. Loops 10. Degree 11. Multigraph 12. Incidence 13. Directed graph Q98-how graph can be represented in memory? Q99-for the following diagram,graph 1. Its adjacency matrix representation 2. Its adjacency list representation

## Q100-explain traversing in graph and compare BFS and DFS.

Q101-discuss the algo. to perform BFS traversal of a graph,consider the following graph and list of sequence of node visited in BFS.

Q102-what is spanning tree? Q103-give kruskal algo.find a minimum cost spanning tree,of given graph. Q104- give Prims algo.find a minimum spanning tree. Q105-explain B+tree,write down its application in file organization.