z http://esjmuonline,com Time : Three Hours) BCA-302(N) B.C. A. (Third Semester) EXAMINATION, Dec., 2016 (New Course) Paper Second DATA STRUCTURE USING € AND C++ [ Macimums Morks: 75 [Note tempt questions from al Sections as directed “The candidates are required to answer only in serial order. If there are many pars of a question, ‘answer them in continuation, Section —A (Short Answer Type Questions) [Note :Atlempt all questions from this Section. Each ‘question carries 3 marks (A) Explain the differcat operations related to data (B) What are sparse matsices? (©) Write program o find whether the given matrix is lower lef matrix or not. (©) Convert the following infix expresion to postfix: sr/G peur ‘http:!/esimuonline.com tls crud © © o http://esjmuonline,com i Bca-20216) What is D-queue ? Expl its strate Write an algorithm to insert and delete x node from doubly linked list, Define toe. How tre ean be stored in memony ? (HD) Whats B-tree 7 How can we insert an elemeat in 0 Bare? How doed the merge som work ? Explain ‘Sectios (Loog Answer Type Questions) Note: Attempt any two questions. Each question caries 2@ » 2) © ow 2 marks. hp/esimuontine com How two-dimensional arrays are represented in memory 7 Also obtais the ferrula for calculating the address of any clement stored in aray, incase of cotumn major order. . Write 8 CiC+ program 10 find tocations of sub-sring in a given string. What is polish notation and reverse polish notation ? Explain with examples. Write an algorithm to convert tix expression imo postfix following ‘expression inte postfix frm using stack ErQta-(eiveMeots form. Convert the Why are circular queves better than. simple queve ? Write an algorithm to insert and delete an Item from the circular queue ‘http:!/esimuontine.comMomus o 3 @ o |ittp:(/esimuonline.com_ a ‘BCA-202(N) What do. you understand by prieity queue 7 Write w function in CIC language t9 insert an ‘element ina poriory queve Write a Cr+ fanetion for inserting and deleting ‘node fon a doubly Frked list. How can we represent polynomial in linked list ? Write an algorithm to add two polynomials. represented by linked ists. Section—C (Long Answer Type Questions) [Note sAttempt any neo questions, Each question cates 2 @ ® aw 12 ark. Define Binary tree. Explain the linear sequent representation of binary tree. Write advantages tnd disadvantages of sequential representation of Write the funtion in C:C+* to insert and delete a in binary search tee, CConstroct binary tee forthe following data: order: FEACDGHBI i) Postorder: EFCDHIBGA ‘Show thatthe B tree that results when inserting RLY.FX, Av M.C, D, ETM, Vek, W, G Gin that order) branching factor of = 3. Only draw the tees jst before and ater each spl rode in an ex ‘hmp:i/esimuontine.com Momus 0 2 @ |ittp:(/esimuonline.com_ m4 Bca-s02iNy Write an algorithm to convert a forest binary tee Dose the tree represeat a heap or not? Explain (©) What is ashing? Howto derminethe aon tf the clement an nny sing ha non? Eipuin stig. (©) Crate Heap forthe it of eee ade Values 7 7 | 2 2 3 a ‘ 100 s ou ‘ ” 7 ! aI . 10 of “ 10 a BCA-302N) ' 2900 ‘hmtp:'/esimuontine.com: yuomuufs sy