F/2023/7154 Total Pages : 4 Third Semester Computer Science and Engincering/Information Technology Scheme OCBC 2019 DATASTRUCTUREAND ALGORITHM. Time : Three Hours Maximum Marks: 70 Note: i) All 7 Questions are Compulsory. Internal choices has been given in each LO (Learning Outcome) wt 7 wer iar gi siden ened eke LO (ait arse) 4 fy my a ii) Incase of any doubt or dispute, the English version question should be treated as final. fore At seo & ee steven fare By fRrfey AF aloft sre a wet @ sift aT AAT Q.| LO | Questions Marks| 1. a) What-do you mean by data types? What | 5 are different kind of data types? Ser cay Sony a BA 8? fafr WOR & Set Tey BA-HT B 8? b) Write ptocess of declaring and initializing | 5 pointers. Uiged at alfa ort w UNE aM ST sifgeer ferftet OR/SteraT a) What is structure? Write process of | 5 accessing structure elements. ERR TI 8? GRR & saul a RT wer Bt siibar fered b), What is dynamic memory allocation/| 5 deallocation? sreriftien Aa vetteiers /PSyeieers ge 2 F/2023/7154 PTO. © scanned with OKEN Scannera Questions ‘Write algorithm for linear search technique. fie wh Saas certs ). Write algorithm to insert an item in stack. aa Aw angen ah Free 7S fe erie fret onset 4) Distinguish between linear search and binary search algorithm with example. fie wt od grt ae Cee A ser ‘afte sie sae 'b) Write the process of conversion infix into postfix by using stack. pitas a cheeRias & ace Bt fhe aeem a aT a ATE a). Define following terms for tree ’) Degree ofanode Degree ofa tree i) Sitings js) Temminalnode ) Forest fa Ra Pe af a oats APA ) Ae A Rt 26 eh ai) Frater iy) effet ate yy oe, b) Whatis Binary tee and Coniplete binary tree? wert @ dé orcte ater fat ad 82 OR/sar ‘F/2023/7184 Contd. id AVL tee arent wd &h cE AVL gh ah eer) Whatare different tree traversal techniques? 2 grevler & fatha costs ata—zh 87 by a) ») ‘Write an algorithm to delete an item from the linked list. fers free & Gee angen ah Rate art fer eater Write advantages of linked lst overarays, A goer A fas ve B ar aH 87 OR/serat Distinguish between one dimensional and ‘multidimensional array. wes Rein oe ager BR ee eee Write an algorithm to search an item in the array. RF ge anger ah aed ane feed Cotte ‘feta a) » What is stack? Write an algorithm to insert anitemin stack em war 82 Rew A ew gen at sr | eh fe ere PR Write the proeess to convert infix notation into postfix notation by using stack. gatiaat ata a cheefine ater a eam wy ch ade aca AY bo Pe ORserat ‘What do you mean by queue? Write an | algorithm to insert an item in circular queve a omy aan ee 82 ara aya oo | argent Bh gE ae As AR eH Gem fea F/2023/7184 @ scanned with OKEN Scanner[4] Nu Marks| Q | LO | Questions b) Whatare different application ofqueue and| 5 circular queue. . md fees ae oer Pfr eee & 6. a) Write difference between tree and binary| 5 tree, Ow Tet A A sie acre. ») Explaintree traversal techniques withexample.| 5 St genta Oofiaa ah scien aes wre OR/sterat What is Graph? Give application of graph. 5 anh Far 8? oem St eer wuahfitar 22 b) Write Kruskal’s algorithm forshortestpath.| 5 sick oer & fe BET WemiRert fa 7. a) Write difference between cyclic or acyclic] 5 graph and directed or undirected graph. rere a Teresita ans eg srRes a SERRE aT H okey RifReh Write difference between depth first search = pee first: ee in detail, Ore Wd i deere a Ramage sie BIS OR/sterat What is complexity and its different types? | 5 SER war 82 8 techniques?| 5 a) b a) b) Riel et What are different sortin, Explain any two, Wife seh’s gat a : . WaT eat en F/2023/7154 © scanned with OKEN Scanner