Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd
Upload
157 views

BSC - Computer Science Cs - Semester 3 - 2022 - April - Data Structures and Algorithms I 2019 Pattern

The document is an exam paper for a Data Structures and Algorithms course. It contains 5 questions assessing students' knowledge of key data structure concepts. Question 1 has 10 short answer parts on topics like data objects, linked lists, sorting algorithms and their time complexities. Question 2 has 5 parts requiring definitions or explanations of concepts like Big O notation, arrays, queues and linked lists. Questions 3 and 4 require longer explanations or implementations related to data structures and algorithms. Question 5 asks students to summarize properties of circular queues or write about generalized linked lists. The exam tests a wide range of foundational data structure topics.

Uploaded by

2023-SF028 KALAMKAR BHARAT PRAVINID:122BSC-CS0772
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
157 views

BSC - Computer Science Cs - Semester 3 - 2022 - April - Data Structures and Algorithms I 2019 Pattern

The document is an exam paper for a Data Structures and Algorithms course. It contains 5 questions assessing students' knowledge of key data structure concepts. Question 1 has 10 short answer parts on topics like data objects, linked lists, sorting algorithms and their time complexities. Question 2 has 5 parts requiring definitions or explanations of concepts like Big O notation, arrays, queues and linked lists. Questions 3 and 4 require longer explanations or implementations related to data structures and algorithms. Question 5 asks students to summarize properties of circular queues or write about generalized linked lists. The exam tests a wide range of foundational data structure topics.

Uploaded by

2023-SF028 KALAMKAR BHARAT PRAVINID:122BSC-CS0772
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Total No. of Questions : 5] SEAT No.

:
P5137 [Total No. of Pages : 2
[5823]-301
S.Y. B.Sc. (Computer Science)
CS-231 : DATA STRUCTURES AND ALGORITHMS-I
(2019 Pattern) (Semester - III) (Paper-I)

Time : 2 Hours] [Max. Marks : 35


Instructions to the candidates:
1) All questions are compulsory.
2) Figures to the right indicates full marks.
3) Neat diagrams must be drawn whenever necessary.

Q1) Attempt any 8 of the following. [8×1=8]


a) Define Data object.
b) Define In-place sorting.
c) What is circular linked list?
d) State the principle used in 4-queen problem.
e) Define Queue.
f) What is time complexity?
g) What is best case & worst case time complexity of merge sort algorithm?
h) “Linked list can be accessed randomly” state true/false. Justify.
i) Round-robin algorithm is example of which type of queue?
j) List any two applications of stack.

Q2) Attempt any 4 of the following. [4×2=8]


a) Define Big Oh (O) and Big Omega (Ω) Notations.
b) Define Array. List of an array.
c) Differentiate between singly linked list and doubly linked list.
d) Convert following expression to equivalent postfix and prefix notation.
(A+B)*C–(D–E) ∧ (F+G)
e) What are operations performed on dequeue?

[5823]-301 1 P.T.O.
Q3) Attempt any two of the following: [2×4=8]
a) Define Data structure and explain types of Data structure.
b) Sort the following data using bubble sort method:
30, 40, 10, 50, 25, 35, 15
c) Write a ‘C’ function to create doubly linked list.

Q4) Attempt any two of the following: [2×4=8]


a) Show the stack contents and output while converting following infix
expression to postfix expression. A/B∧C+D*E–A*C
b) What is linear queue? How to implement it? Explain in detail.
c) List the variants of sequential search. Explain any one with an example.

Q5) Attempt any one of the following: [1×3=3]


a) List advantageous & disadvantageous of circular queue.
b) Write a short note on generalized linked list.



[5823]-301 2

You might also like