Gages) Reg. No. Code No. : 20329 E Sub. Code : AMCS 41 BSe. (CBES) DEGRI NOVI 5 ENAMINATION, MBER 2023, Fourth Semester c npuier Scionee ~ Core DATA STRUCTURES (For those who joined in July 2020 only) ‘Time : Three hours Maximum : 75 marks PART A (10x 1= 10 marke) Answer ALL questions. Choose the eorreet answer : 1, Aisa finite set of instructions. (@) Profile (Algorithm: © Code (@ Data Structure Queues are known as lists. (a) FIFO (®) LIFO © TOP @ BOTTOM 8. The items are stored in a memory locations by means of pointer is called —————— (@) Tree (b) Stack (©) Linked list @ Graph 9. ‘The number of nodes in a full binary tree of depth four is @ 15 @ 16 ou @ 2 10 A is a collection of redords, each record having one or more fields. (@) File ©) Tree © Data Item @ Structure PART B — (5 x 5= 25 marks) ‘Answer ALL questions, choosing either (a) or (b). Each answer should not exceed 250 words. 11. (@) Define: (Data Structure Gi) Algorithm. or (@) What are different types of asymptotic notation? Give example, Page3 Code No. : 20329 E 12 13, M4, ro Deletion in queue take place at one end cated () Start () Front (©) Rear. «a Mid. A node in a doubly: linked list was at least —— fields. (3 2 wa wo The number of sub trees of a node is called its Degree (0) Forest (©) Lovel (@ Terminal Ais n set of domains (@) Profile (0) Algorithm © Code (Data Structure a ain ofdored Hist in which all insertions and deletions are made at one end called top. (a) Queue (b) Trees (©) Graphs (@) Stack Page 2 Code No. : 20829 E (a) What is a queue? Explain the various operations performed on a queue Or (b) Elaborate the applications of stack (@) What are the advantages and disadvantages of representation a binary tree? or (b) Describe the transforming » forest into a binary search tree. {@) Write down the graph abstract data type or (©) Mention the purpose of depth Bist search, (@) Write a note on external sorts or (&) Which data structure is used in hash tables? Explain, Page 4 Code No, : 20329 5 pro]18, Answer (@) What is a stact PART C—Gx8 10 marke) LL questions, choosing either (a) oF (b) Each answer should not exceed 600 words, (@) Draw and explain the Abstract Data Type model Or () Discuss the representation of ‘multidimensional arrays. What are the oper: manipulate a stack? Or (©) Write down the evaluating postfix expressions with example, (a) What is a binary search tree? Deseribe the insertion operation in binary search tree Or (®) Explain the algorithm for postorder traversal ofa binary tree Page § Code No. : 20329 E 19. 20, @ w @) o Outline the minimum cost spanning trees Using prin’ alyorithan, Or Evaluate the single sour path algorithm, all destination Write an algorithm for quick sort and explain it, Or Mlustrate the concent of recursive merge sort with example. Page 6 Code No. : 20329 E