BCS Schiele o» (OOO mss Third Semester B.E. Degree Examination, July/Augus 2021 Data Structures and App! Time: 3 hrs, Say. Marke Fae te iS Note: Answer any FIVE full questions 8 g ~ 1a, Write the drawback of static memory allocation, Explain in detail the dit) rend inet ge dynamic memory allocation 04 5 8 sg b. Write a program to search for key element in an array using binary sean 107 Sh ae Write the difference between structure and anion (5 ta an 5a 2a. Write a program to sort integers in increasing onder using selection sort N16 bak & a Write a function: (i) to find out the length of the string Git string co: Hen, wath 5 using built-in function, UR Stuck g 5 cc. Write a program to seareh foran clement in the sparse mattis (M6 Stark ge, 8 3° a. What is stack? Write a program to implenient push. pop and display eo) tions jist sack g ! using arrays. 10 Stash) a b. Convert the following infis expression to pos! fix expression a G) (AS(B-C*D)AEFF) Gi NSYSZ MeN PQ) 0 Stank €. Write a program to evaluate the postiix expression, 406 Starks 4a. Explain the drawback of ordinary queue. Write @ program ie implore 6 push pes and 4 display operations for circular queue using uray, 08 Ma b, Write a recursive program to find out the Gi!) of two numbers. U5 Shae ©, What is double ended queue? Write a program to implemen’ the with seguuted functions. (07 Vian § a, Write a program to implement queue using singly linked lis 48 Sek b. Write a function to search for key element in a fist using Sine!y Civil 1 (ast Write a funetion to delete a node based on iniormation fichi using doaisl aged bt {ie Hark 6 a. Write a finetion t0 count the mumber of nodes in the List 104 Shon b. Write a function to perform the following using circular doubly Likes ayy avith Souk node. (3) insert_fiont > insert element at front cud (ii) delete_rear— delete clement from rear end 108 Markos ©. Write a finetion to add wo polynomial usiry Linked List WS Mavis Explain the following with suitable exanyplc (i) Binary tree (ii) Binary search tree Gi) Complete binary tree (iv), Skewed tree 8 askYENEPOYA INSTITUTE OF TECHNOLOGY CENTRAL LIBRARY 18CS32 Cosine: tee aying the given ive traversal none GDUBALICE postonicr | GHDIBIEFCA (04 Marks) Waite ~ Fonction to eteate and search for an element in binary search tree, (08 Marks) Welle © programa to insert an element in to binary tree. (08 Marks) Write s Sanction to traverse the tree using He pisorder ii) postarter iii) e-crder tay ersal (06 Marks) I splain Shicaded Binary Tree in detail, (06 Marks) 1 splain she different fanetions fir file operations. (06 Marks) Write no sort the array’ elements using radix sort. Show tracing 0 sort the nay glenents inereasing order tising radix sort. 52, 43, 24, 67, 78, 96, 81,3, 27. (08 Marks) Vite s fiction to sort the array elements in inereasing order using insertio : sort, (06 Marks) Write «program to print the reachable nodes of a graph from the source rede using BFS nethod (06 Marks) Write Ys adjaccney matris and adjaveney. List representation for the given graph in Hie.Gloan Fiv.Q10tb (06 Marks) Fe pin sash (08 Marks) 2or2