Save trees use e-Question Paper DOWNLOAD THIS FREE AT Go green www.vturesource.com us [] ECO] Sixth Semester B.E. Degree Examination, Feb./Mar. 2022 Data Structures Using C++ Time: 3 hes, fax ovis: 100 Note: Answer any FIVE full questions, choosing ONE full qe oo rodule. Module. 1a, With example explain the diferent daa (07 ass) b. Define and explain variables, operators and exprossfyused in C++ along with suitable cxamples, (7 Marks) ©. Explain classes and objects with simple program (6tars) or 2 a. Explain fncions and parameters used ing I (06 Mars) Define a consinictor. Also explain the Froverloading in Ch, (08 stark) ©. With example, explain the concept of (@6 aris) {3 & Write the abstract data yg Fexplain the concept of Row-major and be Colur-majer mapping for 3 yeay, (09 saris) 72 Defi ES (ee Maria) he © Explain data objects and Bin crs (0s Maria) on plaigfie ADT linea ist What isthe result ofeach of following operations? (@s Maria) e-3) te) 12, Go maris) Hist and chains (es arts) Modute-3 wi DT stack. Also write C+ program Tor abstract clas stack. or wars) the array representation of stack using suitable example. (e7 Maris) jote-on inked representation of a stack, (oe Maris) 2. or Paver the following infix expression to postfix expression: (A +B) « (C Explain the concept of parenthesis matching with example. ‘With respect to application of stack explsin towers of lanai 10f2 BRANCHES | ALL SEMESTERS | NOTES | QUESTON PAPERS | LAB MANUALS A Vturesource Go Green initiativeSave trees use e-Question Paper DOWNLOAD THIS FREE AT www.viuresource.com Go green fi Write the ADT queue. Also expla representation oF queue Explain linked eepeescntation of queue with diagram, 5 Waite a short note on rilrad ear rearrangement. or 1 &Whatis dictionary? Also mention the operation tobe perform on corsets) 1. Explain the linear ist representation ofa dictionary. (oma) ©) What is hashing? Explain the hash table representation, (rsa) Modu 9 a Whatisa binary tre? Explain the proporics of osataris) 1. Write a short note on array based representation of ontars) ‘&. Mention the common binary te operations oman 10 a. Write the ADT binary re. os mats) 1h. Explain binary search trce operations (8 sak 1¢. Define heap and explain heap sorting (07 star) @ S S + 20f2 BRANCHES | ALL SEMESTERS | NOTES | QUESTON PAPERS | LAB MANUALS A Vturesource Go Green initiative