PURBANCHAL UNIVERSITY ( ‘ 2016 Bachelor in Information Technology (B.1.T.)/Third Semester/ Final Time: 03:00 hrs. Full Marks: 80 /Pass Marks: 32 BIT273CO: Data Structure & Algorithm (New Course) Candidates are required to give their answers in their own words as far Qs practicable. Figure in the margin indicate full marks. Group A Answer TWO questions. 2x12=24 1. What is stack? Write an algorithm to evaluate a postfix | — expression with example. j 2 What is tree? Explain Huffman algorithm with a suitable example. | 3. Explain Disjkastra's algorithm with example. \ Group B Answer SEVEN questions. 7x8=56 Discuss different types of graph. Explain Graph Traversal method with example. Explain Radix Sort with example. = a What is linked list? Differentiate between single linked list and double linked list. What is recursion? Write algorithm to move n disks in tower of Hanoi problem. _ What is hashing? Discuss different collision resolution technique in brief. Trace insertion sort to sort following data in ascending order: 20 -10 40 30 -20 90 25 jat is searching? Compare sequential search with binary h. Jain Kruskal's algorithm to find minimum spanning tree. ite short notes on any TWO: Big O notation (b) ADT (0) Priority Queue #r— PURBANCHAL UNIVERSITY sn 2015 Bachelor in Information Technology (B.LT.)/Third Semester / Final Time: 03:00 hrs. Full Marks: 80 /Pass Marks: 32 BIT273CO: Data Structure & Algorithm (New Course) Candidates are required to give their answers in their own words as far as practicable. ® Figure in the margin indicate full marks. Answer TWO questions. 2x12=24 1. Explain stack and queue with example. Explain push and Pop Operation of stack with diagram. 2. What is binary tree? Explain different tree traversal method with an example. _ 3. What is graph? Explain Different kinds of graph. Discuss graph traversal method with example Group B Answer SEVEN questions. 7x8=56 Difference between recursion and iteration. Write down recursive algorithm to find factorial of a given number. wv =2+6 What is circular queue? Explain the advantage of Citeular queue over linear queue with diagram. 2+6 Write down the algorithm to convert expression in infix to prefix, 3~ What is doubly circular linked list? Write an algorithm to insert a node in middle of this linked list. 8 What is sorting? Explain quick sort with relevant example. 2+6 Discuss Huffman algorithm with its application< 8 Explain kruskal's algorithm with its application, ~ 8 “What is hash collision? Explain different collision resolution 2+6 ta short notes on any TWO: 2n4=8 ie {b) Priority Queue enniques|| PURBANCHAL UNIVERSITY F 2015 Bachelor in Information Technology (B.1-T.)/Third Semester/ Chance Time: 03:00 hrs. Full Marks: 80 /Pass Marks: 32 BIT273CO: Data Structure & Algorithm (New Course) Candidates are required to give their answers in their own words as far 'S practicable. Figure in the margin indicate full marks. Group A Answer TWO questions. 2x12=24 1a) What is a doubly linked list? How does it differ from a singly linked list? 2+2 (b} Write an algorithm to delete the first node of a singly linked list Write an algorithm for deletion of the first node of the singly linked list. 3+5 2(a) What is merge sort? Explain it with the help of an example. 2+4 (b) Write an algorithm of merge sort. S (a) What is a spanning tree? Explain Kruskal's algorithm with @ example. (b) Explain breadth first search of graph traversal with the help of a suitable example. 6 Group B answer SEVEN questions. 7x8=56 aa What is a stack? Write algorithm for performing PUSH and POP operations in the stack, 24244 a What is a queue? Describe briefly any two type of queue, 3+ Bs ‘yranslate the following infix expression into its equivalent postfix & expression: 8 (A- 8B) * ((C+D)/E) Contd. ...ae (2) What is recursion? How does it differ from iteration ging recursion giving an example of calculation of factorial!’ —-2+2+4 What is binary tree? Write an algorithm of inorder traversal of a binary tree. Also show the postorder traversal of the binary tree given below: 24244 q a. © # iF What is searching? Explain sequential search with an exam; Define hashing. What is a hash function? Explain with the hel of a suitable example. oe Write short notes on any TWO; (a)fAbstract datatype ‘ (b)}Evaluation of postfix expression. (c)#Collision resolution techniques for designing a good _ function ; (Qe AVL trees.PURBANCHAL UNIVERSITY 2G6i42 (NEW) helor in Information Technology (B.1.1.}/Third Semester/ Final t | Time: 03:00 hrs Pull Marks: 80 /Pass Marks: 32 | | BIT273CO: Data Structure & Algorithm /New Course) j r answers in their own words as far Candidates are required to give the as practicable. Figure in ihe margin indicate full marks. Group A Answer TWO questions. _ 2x12=24 C (By Wa What is a stack? Write down the algorithm for push and pop gperation on stack. i expression into postfix to convert an infix an. algorit? rithm tor the Use th) express pression A + (B *¢ ‘ aa ae ain AVL balanced tree with example. S (b)_Baplain different tree traversal method with example 3. What is graph? Describe different types of graphs? Use Kruskal’s algorithm in the following graph to find the minimum spanning 2+2+8 ic tree: Conta. ...4,7 Define the terms time and space analysis. Explain the ¢ symptotic notations Big 0 and Theta ara e. difference 57 Explain queue with its application. What is 7 ee a PF between linear queue and circular queue? Se Ce Write an algorithm to: as (i) Insert node as the last node of the singly linked list. (ii) Delete the first node of the singly linked list. V ° Differentiate between iteration and recursion. Write the recursive algorithm te find the nth term of Fibonacci sequence att ‘ie algorithm of binary search, Ex * What are the 24244 10. What is hashing? What is coilision miethe o resolve the collision? E: 11. Explain different graph traversal methods with example @ 12. Write short notes on (any TWO): 444 (a) Priority queue (b) ADT {c) Spanning Tree BPURBANCHAL UNIVERSITY Peal 2013 vor in Information Technology (B.LT.)/Third Semester/ Final | “OU les Full Marks: 80 See Marks: 32 | 3CO: Data Structure & Algorithm (N x | ed to give their answers in their own words as sider ite margin mdicate full marks : Group A i ey TWO questions, 2x12=24 jinels sort? Explain it with the help of an example 244 t un af merge sort 6 sinwly inked list? How does it from a singly circular each : 243 in aivorstiin to delete the last node of a singly linked list. 7 uch traversal in Graph? Give the sequence ng depth first search a+4 raph oe 6 O-O el as (b) Describe ditferent tvpes of graphs briefly Group B Answer EIGHT questions. P,.Q,$,7,0,2 sx7=56 %. Discuss about theta and big omega-asymptotic notations. Why do we need to determine asymptotic notations of algorithm? 3+2+2 Is» stack? Write algorithn for performing Peep and update erations in the stack 2243 hat is a queue? Write algorithm for performing enqueue and jequeene apertions in the queue, . 24243 ‘ What ts recursion? Write a program in C or C++ to solve the Funous recursive problem of the tower oftHanoi. 2Q+5 Contd, ...a oD Se > Explain Infix, Prefix and Postfix poksh notations with éxay ? se What is hashing? Describe briefly any two collision res techniques. 10, What is binary search? Trace binary search algorithm for * of data: 4,5,20,21,48,90 for the search value 2 11, What is a binary tree? Show the inorder traversal of the eae tree given below: 0 Ss 12. What cS AVL tree: and why? A o Le Ss 13. Write short notes on any TWO: {a} Abstract data type (b) Sequential search (c) Spanning tree (d) Time analysis of algorithm (PURRANCHAL UNIVERSITY 2012 | | Bachelor in Information Technology (B.1.T.}/Third Semester/Final | Time: 03:00 hrs. Full Marks: 80 /Pass Marks; 32 | BIT218CS: Data Structure & Algorithm | Candidates are required to give their answers in their own words as far acticable Figure in the margin indicate full marks i Group Answer TWO questions. 2412-24 1. Discuss Dijkstra’s shortest path problem with example. 12 2. Whet is minimum weighted path length? Explain Hufimen minim n weig length Algorithm with example 39 3. What is different o Graphs? Explain method with ex: Group B: Answer SEVEN questions. plain different operating or stack 5. Differentiate between linear queue and circular queue. Why circular queue is more useful than linear one? o What is doubly linked list? Write an algorithm to insert a node in the middle of the doubly linked list. 26 7. _ Differentiate between recusion and interation. Discuss Fibonacci sequence with example ata 8. Define Binary tree and discuss different Binary tree traversal method with example. 2+6 What is sortir plain bubbie sort with e: B mple 10. Discuss hashing with example and explain one collision resolution technique 4ae4 11. Evaluate the following arithmetic expression written in postfix notation Pm 7; 2,8) 4, *, 105.9, )[— Contd. ...a Quick SOF rat {b) Sequential search {c} Abstract data type