Download Solutions (Google Drive Link)
Birla Institute of Technology & Science, Pilani
Work-Integrated Learning Programmes Division
Second Semester
2015-2016
Comprehensive Examination
(EC-3 Regular)
Course No. : SS ZG519
Course Title : DATA STRUCTURES AND ALGORITHM
DESIGN
Nature of Exam : Open Book
Weightage : 50%
Duration : 3 Hours
Date
of Exam : 09/04/2016 (AN)
No
of pages: 2
No
of questions: 6
Note:
1. Please follow all the Instructions
to Candidates given on the cover page of the answer book.
2. All parts of a question
should be answered consecutively. Each answer should start from a fresh
page.
3. Assumptions made if any,
should be stated clearly at the beginning of your answer.
Q.1.
Let A[1…n]
be an array of n distinct numbers. If i < j and A[i] > A[j], then the pair (i, j) is
called an inversion of A.
(a)
Which array with elements from the set {1,2,…n}
has the most inversions? How many does it have?
(b)
Describe an algorithm that determines the number
of inversions in any permutation on n elements in Q(n
logn) worst case time. [4 + 4 = 8]
Q.2.
A certain Professor Amongus claims that the
order in which a fixed set of elements is inserted into an AVL tree does not
matter - the same tree results every time. Give a example that proves Professor
Amongus wrong.
[8]
Q.3.
Let G be a graph whose vertices are the integers
1 through 8, and let the adjacent vertices of each vertex be given by the table
below:
Vertex
|
Adjacent vertices
|
1
|
2, 3, 4
|
2
|
1, 3, 4
|
3
|
1, 2, 4
|
4
|
1, 2, 3, 6
|
5
|
6, 7, 8
|
6
|
4, 5, 7
|
7
|
5, 6, 8
|
8
|
5, 7
|
Assume that, in
a traversal of G, the adjacent vertices of a given vertex are visited in the
same order as they are listed in the above table.
(a)
Draw G.
(b)
Show how depth-first search works on the graph G
starting from vertex 1. Also identify discovery and back edges. [3 + 5 = 8]
SS ZG519 (EC-3 Regular) Second Semester 2015-2016 Page 2
Q.4.
Does the strategy of choosing items in
increasing order of weight yield an optimal solution for the fractional
knapsack problem? Justify your answer. [8]
Q.5.
Find the minimum cost spanning tree for the
following graph using Kruskal’s algorithm?
Show all the intermediate steps. [8]
Q.6.
Professor Midas drives an automobile from Newark to Reno
along Interstate 80. His car’s gas tank, when full, holds enough gas to travel n miles,
and his map gives the distances between gas stations on his route. The
professor wishes to make as few gas stops as possible along the way. Give an
efficient method by which Professor Midas can determine at which gas stations
he should stop, and prove that your strategy yields an optimal solution. [10]
**********
Awesome...
ReplyDeleteSurvival8: Bits Wilp Software Development For Portable Devices 2017-H2 Handout >>>>> Download Now
Delete>>>>> Download Full
Survival8: Bits Wilp Software Development For Portable Devices 2017-H2 Handout >>>>> Download LINK
>>>>> Download Now
Survival8: Bits Wilp Software Development For Portable Devices 2017-H2 Handout >>>>> Download Full
>>>>> Download LINK Ye
i tried mailing you , but it is not going through. Can you please share the answers to this question paper if you have.
ReplyDeleteThanks
Mail me at ashishjainblogger@gmail.com
DeleteMention the subject(s) for which you want help.
Thanks for putting up the content in such organized manner.Great Help. Thumbs UP !!
ReplyDeleteRecorded lecture links are not working please help
ReplyDeleteIs there a group/whatsapp group for Mtech in computing systems and Infrastructure?
ReplyDeleteVery useful .. Thank you very much
ReplyDeleteAre you Looking for Smart Device Development? QuantaEd Solutions is the Best Smart Device Development Company, We design and develop smart devices that suit the healthcare requirements. For any inquiry call us we will provide all kind of assistance. For more details visit- https://quantaedsolutions.com
ReplyDeleteThis post is so interactive and informative.keep updating more information...
ReplyDeleteSoftware Testing Courses in Mumbai
Software Testing Training in Ahmedabad
Software Testing Courses in Kochi
Software Testing Courses in Trivandrum
Software Testing Courses in Kolkata
Thanks for the blog article.Thanks Again. Keep writing.
ReplyDeletejava online training hyderabad
java online training in india
Thanks for the blog article.Much thanks again. Fantastic.
ReplyDeleteonline training in java
online training on java
AI & ML in Dubai
ReplyDeletehttps://www.nsreem.com/ourservices/ai-ml/
Artificial intelligence is very widespread today. In at least certainly considered one among its various forms has had an impact on all major industries in the world today, NSREEM is #1 AI & ML Service Provider in Dubai
1634348519669-9
Thank you for giving valuable information about software for portable device, we can also develop custom software from pixabulous design.
ReplyDeleteNice Blog!!!
ReplyDeleteServiceNow Training
ServiceNow Online Training in Hyderabad
This article explains in a clear manner. Nice way of explaining. Thanks for sharing. cloud engineering services
ReplyDeleteI really liked your blog post.Much thanks again. Awesome.
ReplyDeletejava online training
java training
Data Science Training In Noida
ReplyDeleteData Science course In Noida
WILP is a set of educational programs designed in such a way that they can be easily integrated into your work life. Earlier, only highly developed nations like the US and Europe were indoctrinating WILPs but now the WILP in India have also gained a lot of popularity.
ReplyDeleteCandidates who wish to take the BITSAT should begin studying as soon as possible. Due to the high level of competition, it is critical to follow the best BITSAT 2022 preparation tips recommended by professionals. This blog post contains BITSAT 2022 study suggestions as well as exam pattern and syllabus information. Continue reading to get answers to all of your questions. To know more information visit @ SSSi Online Tutoring Services.
ReplyDeleteSurvival8: Bits Wilp Software Development For Portable Devices 2017-H2 Handout >>>>> Download Now
ReplyDelete>>>>> Download Full
Survival8: Bits Wilp Software Development For Portable Devices 2017-H2 Handout >>>>> Download LINK
>>>>> Download Now
Survival8: Bits Wilp Software Development For Portable Devices 2017-H2 Handout >>>>> Download Full
>>>>> Download LINK bO
"Thanks for sharing this informative blog on Best Software Development company in chennai,Software Development Company in chennai,
ReplyDeleteBest Software Development company in india,
Top software development company in chennai,
Software Development Company in india"
The BITS Pilani Admission Process is designed to select the brightest minds for its world-class programs. With its independent entrance exam, BITSAT, and direct admission opportunities for board toppers, the institute ensures that only the most deserving candidates secure a place.
ReplyDelete