Scribd
Upload
12 views2 pages

MCCSC03

Uploaded by

donotreply
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
12 views2 pages

MCCSC03

Uploaded by

donotreply
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

Total No.

of Pages: 2

NETAJI SUBHAS UNIVERSITY OF TECHNOLOGY


B. Tech. - II Semester
Open Book Exam - July 2020
Course Code: MCCSC03 Course Title: Data Structure
Max. Marks: 25
Time: 2 Hrs (for Writing Answers) + 30 Mins (Download Question Paper, Scan & Upload
Answer Script)

Note:
❖ There are 8 questions. Each question is of equal marks. Student may attempt any 5
question.
❖ Students must answer the questions in the same order as listed in the question
paper.
❖ Students must use A4 size sheets to write the answers and must number each page at
Top Right Corner in a clearly readable form. Each of the A4 size sheet used must be
signed by the student at the Bottom Right in a clearly readable form.
❖ Students must scan all the pages of their answer scripts and duly filled in undertaking
form using a scanning App (like Adobe Scan) to create a PDF file. Students must
upload this PDF file on the Google classroom / on any other platform as suggested by
the Chairperson, CCC.
❖ After uploading their answer script, Students must scan all the pages used for rough
work in a separate PDF file and keep it ready with them so as to submit immediately
to the Chairperson, CCC as and when asked. Students should retain the physically
written answer script pages & rough work pages securely. The students may be
required to submit these to Chairperson, CCC after the university gets opened for
physical presence of the students.
❖ Missing data / information, if any, maybe suitably assumed & mentioned in the
answer.

Q.
Question Marks
No.
Which one is the tree-based sorting algorithm and what type of tree does it
1 5
forms? Illustrate its sorting approach.
One of the applications of stack is used for backup rotation scheme when
2 performing computer data backups. Figure out which one it is and explain. 5
Also, throw some light on how it can be used for the same
Consider the two polynomial equations mentioned below:
F(x) = 5x4+8x2+4x-9 and G(x) = 2x3+3x2-6x+34
Devise an algorithm using header linked list to add the polynomial equations.
3 Keep in mind that the header node of the lists created (for F(x), G(x) and
5
resultant list) should always contain the information of the count of terms in
equation having negative coefficient.
Eg. If the equation if 6x3-5x-7, then the header list will be 2|0|-> 6|3-> -5|1| -
> -7|0-> X

Define the tree data structure used to efficiently store data in sorted form in
4 order to access and search stored elements quickly. Explain its implementation 5
details elaborating the basic insertion and deletion procedure.
Discuss how you would decide between using a binary search tree or a
5 5
Doubly Linked List. Explain it with suitable example
We have many sorting algorithms for array. List out the best and worst cases
6 of any 3 of them and illustrate the complexity of the best one for internal sort 5
which is stable as well.
Graph is what type of data structure? Perform breadth-first and depth-first
search on the undirected graph given below using node 1 as starting node

7 5

Compare the regular linked list to the sorted linked list, discussing
8 issues of inserting, retrieving, and checking for duplicate keys. Give 5
examples.

You might also like