Scribd
Upload
2 views

FDS May_June_2022

The document is a solved paper from June 2022, focusing on data structures and sorting algorithms. It includes questions on bubble sort, radix sort, internal and external sorting, linked lists, and queue implementations, along with pseudo code examples. Candidates are instructed to answer specific questions and provide diagrams where necessary.

Uploaded by

shelarvinit70
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
2 views

FDS May_June_2022

The document is a solved paper from June 2022, focusing on data structures and sorting algorithms. It includes questions on bubble sort, radix sort, internal and external sorting, linked lists, and queue implementations, along with pseudo code examples. Candidates are instructed to answer specific questions and provide diagrams where necessary.

Uploaded by

shelarvinit70
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
You are on page 1/ 4
JUNE 2022 - SOLVED PAPER 1 ime :25 Hoar] [Max. Marks : 70 ions to the candidates * 1) Answer Q.1 or Q.2, Q3 or Q4, Q.5 or 0.6, 07 or 04. 1) Figures to the right indicate full marks. 3) Neat diagrams must be drawn wherever necessary. sp Make suitable assumption whenever necessary. at a) Wie an alert of bubble sort and sort the following m and shoo the contents of an array afer every Pass. 1,5, 27,6 61, 93,4, 8, 104, 15 jumbers using bubble sort (91 past; 61 5 27 6 61 5 a 7 6 of 9 4 8 104 15 of Data Structures Pass 2: Pass 3: 5 27 ; 61 at 8 939 15 t04 A 7 61 8 4 8 8 45 iy OAS 5 6 7 A 4 i 93 18 tng 5 8 7 4 8 81 93° 15 tay 56. 2 tt 4 8 ry Bi 5 6 27 4 8 81 15 93 494 a7 6 8 81 15 99 i RR 8 81 15 93 4 6 5 27 4 6 81 15 93 19 Tt Fc S-4 Solved Que, Fundamentals of Data Structures fe ' Step 2: Now sort the elements based on second 7 1 ; Second last digit, 0 | 1 2 9 5 tla), 1 { Elements ot | 14 | 22/96 AY | 54.50 | 64,66! 74 — HY We op comparing a we Since the list of elements is of two digits, that is wl get sorted list as ~ oo 4 2 36 41 Bh 5 Gt 6G oy Algorithm : Refer section 3.6.1 Time complexity : The time complexity of radix sort is O(nlogn) OR Q2 a) Explain internal and external sorting by taking suitable example of exch te (Refer section 3.3.1) i b) Write a short note on Fibonacci search with suitable example, (Refer section 3.2.4) ¢ 5 | 3 a) Write pseudo C++ code for addition of two polynomials using singly linked i (Refer section 4.12.2) oi | b) What is dynamic data structure ? Explain the circular linked list with its basic operations, (Refer section 4.9) 1 OR Q4 a) Write 4 pseudo code for the addition of a node after the position ‘Pin singly inked list. (Refer section 4.6) (1 b) Explain the doubly linked list with it's basic i is i tions; list the adoantage: of doubly linked list over singly an linked list. (Refer section 4.8) a Q5 a) Write a pseudo for basi penton ! wi) Circular quene sii) Priority quene and 6.9) (6 (Refer sections 6.3, 6. by Write pseudo C+ code to implement linked queue, (Reter section 6.7) 19) oR Explain array tmplementation Of priority queue with all basic operation. as (Refer section 6 9) (8) maendo C++ code to implement C7 ular queue using array write @ pseu“ » | n 6.5) i (Refer sectio oud

You might also like