Data Structures & Algorithms B.Tech in Information Technology 3 Semester/Term 2022
Discussion
Ask a question about this paper, or help someone else with theirs. Answers are emailed to whoever asked.
No questions yet — be the first to ask.
Need a paper or stuck on a question? Ask here — students reply and you get an email.
Ask about a paper-
BS ZOOLOGY first semester Animal diversity ZOOL 101 - university of Punjab 2025
0 replies Reply → -
Literary criticism
1 reply Reply → -
this paper consists of 60 marks but now we have 35 marks paper.
1 reply Reply → -
Can you please tell me more past papers please because my exams are starting from next week
1 reply Reply → -
Did you provide the past papers of the science of society uos?
1 reply Reply →
More Data Structures & Algorithms papers
See all
Data Structures & Algorithms
Uploaded 11 hours ago · by Nargis
Download ↓
Data Structures & Algorithms BS 4 Semester/Term PU — University of the Punjab 2023
Uploaded 21 hours ago · by Nargis
Download ↓
Data Structures & Algorithms BS 3 Semester/Term UOS — University of Sargodha 2025
Uploaded 22 hours ago · by Nargis
Download ↓
Data Structures & Algorithms Msc IT 3 Semester/Term UOS — University of Sargodha 2017
Uploaded 1 day ago · by Muskan
Download ↓
Data Structures & Algorithms 2 Semester/Term 2021
Uploaded 1 day ago · by Muskan
Download ↓
Data Structures & Algorithms BSSE/BSIT UOS — University of Sargodha
Uploaded 3 years ago
Download ↓
Paper text
SVKM'S
D. J. Sanghvi College of Engineering
'rogram: B. Tech in Information
Academic Year: 2022
Duration: 3 hours
Technology
Jate: 21.01.2023
Time: 09:00 am to 12:00 pm
ubject: Data Structures and Algorithms (Semester II1)
Marks: 75
(3) All questions e
Instructions: Candidates should read carefolly the instructions printed on the question paper and
on the cover page of the Answer Book, which is provided for their use.
(1) This question paper contains two pages.
(2) All Questions are Compulsory.
arry equal marks
(4) Answer to each new question is to be started on a fresh page.
(5) Figures in the brackets on the right indicate full marks.
(6) Assume suitable data wherever required, but justify it.
(7) Draw the neat lahelled diagrams, wherever necessary
Question
No.
Max.
Marks
QI (4)
Write an algorithm to merge two sorted linked lists to create a new one. Take any
10
two sample sorted finked lists and trace your algorithm on it
OR
Write an algorithm to invert a node into a sorted doubly linked list. Trace your
algorithm on sample sorted doubly linked list
Weite an algorithan to find the length of a circular linked lis
05
QZ (3)
02(5)
Write down an algorithm, which will take a string "S as input. The string S is
formed using alphabets (a. b.
c) only. Find whether the input string is from the set
L. - (a% 1.n = m + k and n. m, l 2 1). Eg. abbeanabece e L. and abbc.
abcoe a L. Use appropriate data structare and justify it. Trace your algorithm on
sample input given in the example
Consider the following three claims
(n + ky" » On") where k and m are constants
2-002
HE
2-022
Which of these claims are correct? Justify you answer.
OR
There are a unsoeted arrays: Al. As... A Assume that nis odd. Each of Ai. Ap
.... A contains n distect elements. There are no common elemests between any
two strays. Find the worst-case time complexity of conspating the median of the
medians of Ai. Az. — Ar? Justify your answer.
10
05
Q3 (4)
Write down an algorithm for finding the depth of a node X in the binary search
05
