Scribd
Upload
2 views2 pages

Data Structures

This document is an examination question paper for the F.Y.B.Sc(CS) Data Structures course, covering various topics such as multi arrays, linked lists, algorithms, and sorting techniques. It consists of multiple sections with questions requiring explanations, programming tasks, and short notes on specific concepts. The paper emphasizes the importance of understanding data structures and their applications in programming.

Uploaded by

adarshgupta.pvt
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
2 views2 pages

Data Structures

This document is an examination question paper for the F.Y.B.Sc(CS) Data Structures course, covering various topics such as multi arrays, linked lists, algorithms, and sorting techniques. It consists of multiple sections with questions requiring explanations, programming tasks, and short notes on specific concepts. The paper emphasizes the importance of understanding data structures and their applications in programming.

Uploaded by

adarshgupta.pvt
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/ 2

F.Y.B.

Sc(CS) (Sem-II) April-2023

Data Structures Q.P. Code:00000239

[Time:2.30 Hrs] [ Marks:75 ]


Please check whether you have got the right question paper.
N.B: 1. All question are compulsory.
2. Figures to the right indicate full marks.
3. Students answering in the regional language should refer in case of
doubt to the main text of the paper in English.

Q. 1 Answer the Following. (Any 4) (20 Marks)


a. How to implement Multi Arrays ADT in data structure.
b. What is python set? Demonstrate union, intersection and addition
operations
on set with example.
c. Define Algorithm. List and explain different cases of Algorithm analysis.
d. Write a short note on Big O notation.
e. How to use List for maintaining sorted list .
f. What is ADT? Explain the types of operation on ADT.

Q. 2 Answer the Following. (Any 4) (20 Marks)

a. What is linked list? Explain types of linked lists


b. Write a program to implement stack using python list with required
functionality.
c. What is doubly linked list? Define function to append node in doubly
linked list.
d. How stack can be used to check parenthesis balancing?
e. Write short note on singly link list.
f. Explain the concept of priority queue

Q. 3 Answer the Following. (Any 4) (20 Marks)


a. Define recursive function? List and explain its different properties.
b. Explain Hashing linear probing.
c. List and explain properties of Binary tree.
d. Explain the procedure of merge sort.
e. Sort the given set of numbers using quick sorting technique:
1, 14, 5, 8, 9, 65, 2, 21
f. Write a python code to find factorial of a number using recursive
function.

Q. 4 Attempt the following (Any THREE) (Each of 5Marks) (15)

a. What is recursion? State its properties.


Q.P. Code:00000239

b. With example explain clustering in hashing.


c. Explain Hashing linear probing.
d. List and explain properties of Binary tree.
e. Discuss the steps in quick sort.
f. With respect to tree structure define following terms:
Root , path , depth , width, height

Q. 4 Answer the Following. (Any 3) (15 Marks)


a. Differentiate between linear and binary search with example.
b. Write an algorithm to convert infix into postfix.
c. What is binary search tree? With example explain insertion of node in
this tree.
d. Write a python code to find execution time required to check whether a
number is Armstrong number or not.
e. Write short note on Doubly link list.
f. Write a note on recursive call tree working with runtime stack .

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy