OBE REFNO048680 MCA (TWO YEAR) I SEMESTER EXAMINATION 2021-22 COMPUTER APPLICATIONS CS - 108 : Data Structure and Alogrithms Time : 4.30 hours Max. Marks : 70 1. The Question Paper ‘contains 08 questions out of which you are required to answer any 04 questions. The question paper is of 70 marks with each question carrying 17.5 marks. wea 4 ans wet {8 a @ fet a 4 weal ar var 2a 21 wet 70 aot wT @. RA Wee We 175 9 at) 2. The total duration of the examination will be 4,30 hours (Four hours and thirty minutes), which includes the time for downloading the question paper from the Portal, writing the answers by hand and uploading the hand-written answer sheets on the portal. war #1 at wr 430 de or 2 fori wena of cide Yo snore od qa mafafted wet wr aoe vide w auats wen et) 3. For the students with benchmark disability’ as per Persons with Disability Act, the total duration of examination shall be 6 hours (six hours) to complete the examination process, which includes the time for downloading the question paper from the Portal, writing the answers by hand and uploading the hand- written answer sheets on the portal fear orat $ fet wien or wr 6 G2 faite @ Ret gems «el oda @ oreaats wen erofeftra gay at aida we amats wear 21 4. Answers should be hand-written on a plain white Aé size paper using black or biue pen. Each question can be answered in upto 350 words on 3 (Three) plain Ad size paper (only one side is to be used). Wea ar Sere ae abe AA Tg WN We wre Se AS were A ea ar wae | woke we OF Fee 360 Tel aw as we PS AA area A eta ea | weal} ware fy bet Ve wep 8 ys or A oaate oar urn wee! 5. Answers to each question shouid start from a fresh page. All pages are required to be numbered. You should write your Course Name, Semester, Examination Roll Number, Paper Code, Paper title, Date and ‘Time of Examination on the first sheet used for answers. ite me aT oe et yw a yw we 81 we gel wl Geida wen g1 wa wt mE yO Rena a, Bee, wher opentT, mera wie, wend wr efile, Reara ea aa fever BI uestions@ 1. (@) Explain primitive and non-primitive data structures with suitable examples. 7 (b) Distinguish array and linked list with suitable illustrations. 2. (a) What is Binary Search Tree? How BST is different from B Tree? Explain with suitable exemple, (b) Discuss sree traversal with suitable example. 3. How Insertion sort is different from suitable example. 4, Explain Greedy and Dynamic programming approach, Take your own problem and solve the problem using both the approach 5. Find upper, lower and tight bound of running time of quadratic function f(a) = 3n? + 2n+4, 6. Define back tracking and branch and bound. Discuss through an example. 7. (a) Define shortest path problem with illustr ns. (b) Explain spanning tree and minimum spanning tree. Give suitable illustrations. 8. Write brief notes on any two of the following. a. Hashing and Collision Resolutions b. Quick Sort c. Binary Search . Applications of Trees