Scribd
Upload
26 views2 pages

DDS (2021W)

Uploaded by

aaptakai
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
26 views2 pages

DDS (2021W)

Uploaded by

aaptakai
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

lOMoARcPSD|34553825

203105205 3225 Question Paper

B.tech CSE (Parul University)

Scan to open on Studocu

Studocu is not sponsored or endorsed by any college or university


Downloaded by Shruti Sharma (okkshrutii@gmail.com)
lOMoARcPSD|34553825

Seat No: ______________ Enrollment No: ____________________


PARUL UNIVERSITY
FACULTY OF ENGINEERING & TECHNOLOGY
B.Tech. Winter 2021-22 Examination
Semester: 3 Date: 08/10/2021
Subject Code: 03105203/203105205 Time: 02:00pm to 04:30Pm
Subject Name: Data Structure and Algorithms Total Marks: 60
Instructions:
1. All questions are compulsory.
2. Figures to the right indicate full marks.
3. Make suitable assumptions wherever necessary.
4. Start new question on new page.

Q.1 Short Questions. (All are compulsory) (Each of one mark) (15)
1. Define data structure.
2. Define: Height of a tree.
3. Give two applications of graphs.
4. What is the complexity of binary search algorithm?
5. List operations performed on a stack.
6. Write two simple hash functions.
7. What is hash collision?
8. Write ‘C’ structure of Singly linked list.
9. What is Recursion?
10. What is Time complexity of an algorithm?
11. Define Circular linked list.
12. Define 2-3 tree.
13. A graph containing only isolated nodes is called a ___________.
14. What is the reverse polish notation for infix expression a / b *c ?
15. What is common in inorder, preorder and postorder traversal?
Q.2 Answer the following questions. (Attempt any three) (15)
A) Explain AVL trees.
B) Write a pseudo-code for PUSH and POP operations of stack.
C) Differentiate between arrays and linked list.
D) Perform following operations in a circular queue of length 4 and give the Front, Rear and Size of
the queue after each operation.
1) Insert A, B
2) Insert C
3) Delete
4) Insert D
5) Insert E
6) Insert F
7) Delete
Q.3 A) Explain the structure of indexed sequential file. (07)
B) Write Kruskal’s algorithm for minimum spanning tree with an example. (08)
OR
B) Write Prim’s algorithm for minimum spanning tree with an example. (08)
Q.4 A) Explain the trace of selection sort on following data. (07)
26,54,93,17,77,31,44,55,20
OR
A) Explain the trace of bubble sort on following data. (07)
26,54,93,17,77,31,44,55,20
B) Explain Depth First Search and Breadth First Search in graphs with an example. (08)

Page 1 of 1

Downloaded by Shruti Sharma (okkshrutii@gmail.com)

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