0% found this document useful (0 votes)
14 views4 pagesData Structures and Algorithms Sem 2 Re-Exam 2021-2022 BJy1kpr96T
This document outlines the examination details for the Data Structures and Algorithms course at SVKM’s NMIMS for the academic year 2021-2022. It includes instructions for candidates, the structure of the exam, and various questions related to data structures, algorithms, and their applications. The exam covers topics such as linked lists, binary search trees, sorting algorithms, and graph traversal techniques.
Uploaded by
Manan DedhiaCopyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
0% found this document useful (0 votes)
14 views4 pagesData Structures and Algorithms Sem 2 Re-Exam 2021-2022 BJy1kpr96T
This document outlines the examination details for the Data Structures and Algorithms course at SVKM’s NMIMS for the academic year 2021-2022. It includes instructions for candidates, the structure of the exam, and various questions related to data structures, algorithms, and their applications. The exam covers topics such as linked lists, binary search trees, sorting algorithms, and graph traversal techniques.
Uploaded by
Manan DedhiaCopyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
/ 4
MPSTM
1BRAR
SVKM’s NMIMS
MUKESH PATEL SCHOOL OF TECHNOLOGY MANAGEMENT & ENGINEERING /
‘SCHOOL OF TECHNOLOGY MANAGEMENT & ENGINEERING
Academic Year: 2021-2022
Programme: B. Tech / MBA Tech (All Streams) Year: I Semester: II
Subject: Data Structures and Algorithms
Marks: 100
Date: 04 July 2022 ‘Time: 11.00 am to 2.00 pm
Durations: 3 (Hrs)
No. of Pages: _626
2
Instructions: Candidates should read carefully the instructions printed on the question paper
and on the cover of the Answer Book, which is provided for their use.
1) Question No. 1 is compulsory.
2) Out of remaining questions, attempt any 4questions.
3) In all 5 questions to be attempted.
4) All questions carry equal marks.
5) Answer to each new question to be started on a fresh page.
6) Figures in brackets on the right hand side indicate full marks.
7) Assume Suitable data if necessary
|
2 Answer briefly: |
a _| Identify the most suitable data structure for the given scenario.
Provide your justification for the same
con | I. An “Undo” mechanism in text editor |
Son Tl. Nested function calling in programming language 6)
BL-2 TIL. To store directories and files in a computer.
IV, Representation of friendships on social networking sites,
V. Keeping a track of emails based on importance.
CO-2 1b.
S0-1 Write a function to delete a last node from a singly linked list. | [5]
BL-2
CO-3. | & _ | Perform depth first search traversal for the given graph, Show alll
eae the steps with suitable data structure. [Assume node A as a root | [5]
ag node]
4/4 CO. 4
Explain difference between linear search and binary search. For
the given values in an array, demonstrate use of binary search to
find an element 88 from an array.
sO-1 1}
BL-3 Index [0 [1 [2 13 [4 ]5 6 |7
Values | 12 [25 [32 [47 [49 | 67 | 88 [93 |
Q
‘The roll numbers of students participating in an event are to be
stored in a singly linked list. The node will store the roll number
of student. Write functions to perform below operations on the
C0-2 linked list.
SO-1 [10]
BL-3 1. Insert a roll number of a student at the particular position given
by the user.
2. Delete a roll number of a last student in a linked list.
Construct a binary search tree using the following data elements
and answer the below questions. The elements are inserted in the
order given.
jco-3 i. Perform pre-order traversal of the constructed tree
eo 2. Re-draw the tree after deletion of 57 (0)
oe 3. Find out height of the tree
45, 39, 57, 11, 33, 79, 31, 9, 90, 55, 66, 80
Q@
cos
0-1 Calculate shortest path from node A to all other nodes: in the | [10]
BL-2 following graph using Dijkstra’s algorithm. Show all the steps.
2h, COTA :
SO-1 Explain Big Oh notation and write an algorithm to sort an array | [10]
| BL-2 using selection sort.
ter
‘Write an algorithm to perform dequeue operation on a circular
queue, Identify and draw a circular Queue position in below
eee scenarios. Assume size of the Queue as 6.
1, Front==Rear
Em 2. Front==0 and Rear=size-1 to]
3. Front==Rear+1
4. Front
