1. « Wiritenotes onthe following (any three): (2) Two-way (©). Selection sort, (©). Sparsearay withexample (@)Lincarsearch N 21216) BC. Time. Note: 180124 Ax IIL Sem. 18012 C. A. Examination, Data Structure Using ; (BCA302) (New Cours) Three Hons] Avtemps questions fromall: How single dimensional uray computer memory? ‘What isprierity queue? be represented in@ Givetheuse ofheaernadein linked lis. Ditferenite between linear search and binary Seareh technique. Brieflyexplaincompletebinary tee wth example. Section: (Short Answer Questions) Answer any two questions out ofthe Following three (questions. Hach question caries 7% mavks. Short answer’ srequired not exceeding 200 words, 7¥4*2~15 What is postfix. expression form of any infix ‘expression’? Write an_ algorithm to, convert inf ‘expressionintopostfixexpression, ‘Waite a program in C language to seach a given ‘element ininked fist. ‘Explinthevarioustypesofhash functions with example, 10. (Detailed Answer Ques Answer any ree questions out fill following five ‘questions, Each question cares Answeris ‘required in detail I345 ‘What dp you mean by traversal fil lary tee ? Give the socursive algorithm for vari pes of binary tree traversal with suitableexam with queue peraminCet0 ements, ply ‘hogiven programon the follow 5,10, 100, 5, -6, 1, Expl ein deta12, Whats binary saarch tree? The ftlowing Ist of letters are inserted into an empty binary search treet IJRDGTEMHPAFQ (2) Find the frat tee, (b) Find the Postorder traversal ofT 13, Write an algorithm for heap sort and imple- ‘ment the algorthm to sortthe following num= bers: 42, 32, 52, 22, 77, 66, 88 0014 N (Printed Pages 4) (201217) Roll No. BCA. - 1 18012 B.C.A, Examination, Dec.- 2017 Data Structure Using C and C++ (Bea-s02) (Kew Courts) Ti {Maxionum Marks: 75 Tiree Hours} Note : Attempt questions from all sections as per Instructions. ‘Section-A (Very Short Answer Questions) "Note : Atterptallthe five questions. Each question ‘aries 3 marke. Vary short answer's requted not exceeding 75 words. 3x5=15 1. Howa two-dimensional aray fs represented In memory? Pro.‘Section-C 2. Discuss the significance of priority queues, NS ee 3. How the end-of-list condition wit be tested spe ertore| ina crevartined ist? rte: Ase any non ist ‘4. _ Differentiate between preorder. and post or- alone ge ‘er tree traversal. caries 15 marks. Answer What is the concept of merge sorting? etal Section-8 ‘5, iscuss the ftlowing with xe (Short Answer Questions) (a) Lower triangular matrix Note : Answer any two questions out of the fol- (b)_ Upper triangular matrix ‘owing three questions, Each question car- val mate i eee co eee Rot exceeding 200 words. 7¥2x2=15 ce ee sous application 6. White a program in C to insert an item of ety ions Information as the first node in the linked plain pris inf 2 fis OIG © trance ot examptes jorithm to de 7. What is B-tree? How do you construct the 411. Write an algortt om Betree? Explain with example, fromm a two-way linked list- 8. What do you mean by linear search? Dis- rithm by taking an example ‘uss the complexity of linear search, sso1z2 90129co a 12. Write program to prin given singly linked list in any Rol No. the reverse order, | BCA TITSem. | 13, Whiteshor nots on the flow 18012 () Prony Quoaee ©) Hashing Techniques. i B.C. A, Examination, Dec, 2018 Data Structure Using C and C++ (case) Time Tiree Hows} {asian Marks 75 | Notes Attempt questions om all Sections as per inaction, Sections, ( t (Very Short Answer Questions) ‘Anew allie ve questions. Fach question caries ‘Sark, Very shor answerierequied, 345-15 1 WhatareavLtees? 1012-4 om18012 ® ‘What da you understand by Data Sucre? What isan aay ? Explain, Givethe application of tack Deine circular ist and chai, Section-B (Short Answer Questions) ‘Answer any two questions out ofthe Following tree ‘questions, Fach question carries 7¥4 mats. Short answer segue, Modes ‘Wee the procedare to dolte an element rom an ray ‘Write a recursive funtion to count the number of leaves ina binary tee 6 5. Write'a fonction to oversea sack using push snd op operation, Section-C (Detaled Answer Questions) Answer any thee quistions ou ofthe Following five ‘questions. Each question caries 15 mack. Answer is require in det 1534s 9% (@)_ How todletean cement oma linked queue? Wisite procedure ©) Find the ime complexity of Bubble Sort Algorithm, 10.) Whatis Binary search tre? ©) WhatisaBtree? ML. @) Write a function to evaluate a postfix expression, Show status of slack for cach Scanned token ithe postfix expression is: ABC* DEFS”. G+ (©) Differentite between stacks and queues, 18012 5%A Printed Pages : 3 (21119) ROU NO see B.C.A.-IESem. 18012 B.C.A. Examination, November-2019 DATA STRUCTURE USING C AND C+ (BCA.302) Time : Three Hours} (Maximum Marks : 75 Note: Attempt questions from all sections as per instructions. Section-A (Very Short Answer Questions) Note : Attempt all the five questions, Each question ‘atrics3 marks. Very short answer is required not exceeding 75 words. 5x3=15 1. Write the limitations of arrays, 2. Define stacks and queves with an example, 3. Whatis the advantage ofa header node in a linked list ? 4. How abinary tree is traversed in C language? 18012 PTO.@ 'S. What is the basic concept of insertion sorting ? Section B (Short Answer Questions) Note: Answer any ve questions out of the following ‘tyce questions Each question carries 7¥smarks. ‘Short answer i required not exceeding 200 words 2aTH1S ‘What do youmean by sparse matrix? Explain how a sparse matrix is represented in memory. ‘7. Whatis D-queue ? Explain the insertion and deletion ‘operations with the help of suliable example 8 Weite analgorithmto delete lest node fom a linked list Seetlon-C (Detailed Answer Questions) (Note: Attempt any three questions out of the following five questions. Each question cases 15 marks. “Answeris required in detail ax1s45 8012 10, u. 2 ® ‘Writ algorithm and its C syntax to insert an element atthe K* position into the linear aray. ‘Write an algorithm fo evaluate postfix expression and also implement the algorithm tothe following ‘expression : BLABAI, 2.445 ‘Write algorithm to perform insertion and deletion ‘operations on binary trees and explain them with an example, ‘ Deseribe hashing and various hashing techniquesin, etal Explain the following: (Priority Queves i) Heap Sor (Gil) Applications of Binary Search Tree 18012