Downloaded From www.rejinpaul.com Reg. No. : | I a Question Paper Code : 91437 B.BJB.Tech. DEGREE EXAMINATION, NOVEMBER/DECEMBER 2014, ‘Third Semester Blectrical and Electronics Engineering @ HE 2204/HN 36/080300003/10133 EE 306 — DATA STRUCTURE) ALGORITHMS (Common to Electronics and Instrumentation Engincering/Insteumedtation and Control Engineering) , Regulation 2608/2010) : (Also common to PTEE 224 —Data Structures and heat ims for B.B, (Part-Time) . Second Semester EEE — Time : Three hours 1. Whatis a circular quei ie ce. 3. Whatis a Pee tree? Give example, a Ge ble sese ipceecon a « ODI aa a binazy tx00 5. St 1e need for indexing. ra, 6. What is a hash function? Give example. sh, \ Whatis 2 directed graph? Give example 8. List the applications of yravh. 9. - For what type of probloms greedy algorithms aro best suited? 10. State how dynamic programming salves complex problems. : (a QO (Grow With Us1. @) © 12° @) (b) 13. (a) w 14, (a) {b) a Downloaded From www.rejinpaul.com PART B — (5 x 16= 80 marke) () What is a linked list? Explain with an example cursor implementation of linked lists. ®) (ii) Explain with an algorithm and diagrammatic illustrations how insertions and deletions can be performed on a doubly linked bist. (8) Or @) Explain with on algorithm and diagrammatic illustrations tg¢ various operations that can be performed on a Stack ADT, i) Explain with an algorithm and diagrammatic dllustratighs the various operations that can be performed on a Queue ADT. 4, _i8) Develop an algorithm for constructing a binary tree. Inetudl go ines for inorder, preorder and postorder travereals. Illustyate the sai with an example. e a6) ae Develop an algorithm for constructing a binarwgeardhetree. Include routines {or insertion and deletion, Illuetrate tho canto with,an oxemple. 8) 7 Develop an algorithm for constructigg ai AVL, tree Tnelude routines for insertion and deletion. Mlusteate the Myung with an example a6) Se with an example. (4) @ Whatisa sine (ii) Explain closed ngoring with an example. qa2y ) Explain lah egbimple breadth first scarch traversal of a graph. am @ (i) Explain sifigle-couree shortest-path problem with anexample- (6) Gi) What ex8 Kuler circuits? Explain with an example, co) gt Or “What is 2 minimum spanning tree? Explain with an example Kruskal’s ~~algorithm for constructing a minimum cost spanning tree. (16) Explain with an example how a greedy approximation algorithm can be ased for a simple seheduling problem (18) Or What is backtracking? Explain the turnpike reconstruction problem with an example. (by z 91487 inpaul.com ‘Grow With Us