Data Structures & Algorithm Past Paper (July 2024) PDF
Document Details
Uploaded by Deleted User
AISSMS Institute of Information Technology
2024
AISSMS
Tags
Related
- Data Structures & Algorithms Lecture Notes 1 PDF
- Data Structures - Ellis Horowitz, Sartaj Sahni - Fundamentals - PDF
- Data Structures and Algorithms Study Guide (Sorsogon State University)
- CS301 Data Structures Past Paper PDF 2010
- Introduction to Java Programming and Data Structures (2019) by Y. Daniel Liang - PDF
- Data Structures and Algorithms with Python and C++ PDF
Summary
This is a past paper for a Data Structures and Algorithms course, likely for a computer science undergraduate program at the AISSMS INSTITUTE OF INFORMATION TECHNOLOGY. The paper covers topics including binary search, quick sort, linked lists, stacks, and deques, and is for the July 2024 exam.
Full Transcript
Enrolment No.: Total No. of Questions: 4] [Total No. of Printed Pages: 2 BTECH_CO_SEM3 / CO Third Semester COPCC303 / Data Structures & Algorithm (July 2024 R, 2023 Pattern)...
Enrolment No.: Total No. of Questions: 4] [Total No. of Printed Pages: 2 BTECH_CO_SEM3 / CO Third Semester COPCC303 / Data Structures & Algorithm (July 2024 R, 2023 Pattern) Time: 2.30 Hrs Maximum Marks: 60 Instructions: - (i) Neat diagram must be drawn wherever necessary. (ii) Figure to the right indicates full marks. (iii) Assume suitable data wherever necessary. (iv) Use of electronic pocket calculator is allowed (non-programmable). Q1. Solve any two : A) Write a pseudo C++ code for binary search (Iterative) and find out its time complexity. B) Write a C++ code for quick sort and specify its time complexity in worst, best and average case. C) Sort the following numbers step by step using selection sort 70,30,20,50,60,10,40 also comment on best, worst and average time complexity of selection sort. Q2. Solve any two : A) Write a C++ code to find the middle element of a singly linked list in one pass? B) Write a C++ code to find out the 1’s complement using appropriate type of the linked list and specify its time complexity. C) Write a C++ code to insert a node at any position in a doubly circular linked list and write down the time complexity of the insertion operation. Q3. Solve any two : (Page 1 of 2) A) Convert following infix expression into postfix expression using Stack.Show step by step solution. ( ( a / ( b – c + d ) ) * ( e – a ) * c) B) Give pseudo c++ code to implement following operations on linked stack : i) push ii) pop iii) display C) What is recursion ? Explain use of stack for recursion. Give difference between recursion and iteration. Q4. Solve any two : A) Write pseudo c++ code to implement following operations on deque: i) insert_front ii) insert_rear iii) delete_rear iv) display B) Define following terms with example: i) Input restricted deque ii) Output restricted deque iii) Priority queue C) Write c++ code to Generate binary numbers between 1 to `n` using a queue ***** (Page 2 of 2)