Scribd
Upload
48 views1 page

Cs201 Data Structures (Mid - sp23)

Uploaded by

savitaarthegodspeed
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
48 views1 page

Cs201 Data Structures (Mid - sp23)

Uploaded by

savitaarthegodspeed
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

BIRLA INSTITUTE OF TECHNOLOGY, MESRA, RANCHI

(MID SEMESTER EXAMINATION SP2023)


CLASS: BTECH SEMESTER : VII
BRANCH: IT SESSION : SP2023

SUBJECT: CS201 DATA STRUCTURES


TIME: 02 Hours FULL MARKS: 25

INSTRUCTIONS:
1. The question paper contains 5 questions each of 5 marks and total 25 marks.
2. Attempt all questions.
3. The missing data, if any, may be assumed suitably.
4. Tables/Data handbook/Graph paper etc., if applicable, will be supplied to the candidates
-----------------------------------------------------------------------------------------------------------------------------

CO BL
Q.1(a) Are Data Structures and ADTs same? Explain the concept in brief. [2] CO1 1,2
Q.1(b) “Algorithms and Data Structures go hand-in-hand”. Justify the statement. [3] CO1 2,3

Q.2(a) The notations used in the calculations of the complexities of Algorithms, are [2] CO1 1,2
Asymptotic in nature. Why?
Q.2(b) Give the algorithm for Matrix Transpose and find its Space and Time Complexity using [3] CO1 2,3
Step count.

Q.3(a) Recursive functions uses which data structure for its successful execution? Explain in [2] CO2 2,3
brief.
Q.3(b) Convert the given Infix expression to its equivalent Reverse Polish notation, showing [3] CO2 3,5
the stack content at each stage:
(-(P + Q + R) ^ S) * (T + U)

Q.4(a) Give the trade-off decision for implementation of a Priority Queue. [2] CO2 2
Q.4(b) Give the algorithm for Deletion of an element ‘X’ from a Circular Queue Q, of size N. [3] CO2 3,4
F and R represents the Front and the Rear pointers of Q respectively.

Q.5(a) What are the two most important differences between arrays and linked lists. [2] CO2 2,4
Q.5(b) Give the algorithm for inserting a node at the start of a Singly linked List. Document [3] CO1 4,5
the steps involved and support your answer with suitable figures. ,2

::::::21/02/2023::::::M

You might also like