0% found this document useful (0 votes)
161 views5 pages

DSA - Quiz (Additional) (Page 3 of 4)

This document contains a 13-question quiz on data structures and algorithms topics. Questions ask about binary search trees, traversal orders, algorithm strategies, and shortest paths. Students are to select the best answer among multiple choices for each question. The quiz covers fundamental DSA concepts like trees, graphs, sorting, and algorithms.
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
0% found this document useful (0 votes)
161 views5 pages

DSA - Quiz (Additional) (Page 3 of 4)

This document contains a 13-question quiz on data structures and algorithms topics. Questions ask about binary search trees, traversal orders, algorithm strategies, and shortest paths. Students are to select the best answer among multiple choices for each question. The quiz covers fundamental DSA concepts like trees, graphs, sorting, and algorithms.
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/ 5

11/14/2020 DSA - Quiz (Additional) (page 3 of 4)

Dashboard / My courses / CSE2003_F20 / Dr. Rishikeshan C A -DSA- G1 Slot- Theory / DSA - Quiz (Additional)

Question 9
The inorder predecessor of a node i in a binary search tree is the node that appears just before i in an inorder
Not yet
answered
traversal that places the elements of the tree in increasing order. If a node in a binary search tree has two children,
then its inorder predecessor has
Marked out of
1.00

a. Two children

b. No right child

c.
No child

d. No left child

e. None of these

https://lms.vit.ac.in/mod/quiz/attempt.php?attempt=72665&cmid=15410&page=2 1/5
11/14/2020 DSA - Quiz (Additional) (page 3 of 4)

Question 10  In order to get the information stored in a binary search tree in the descending order, one should recursively
Not yet traverse it in the following order.
answered

Marked out of
a.
1.00  right subtree, left subtree, root

b. root, right subtree, left subtree

c. None of these

d. root, left subtree, right subtree

e.  right subtree, root, left subtree

https://lms.vit.ac.in/mod/quiz/attempt.php?attempt=72665&cmid=15410&page=2 2/5
11/14/2020 DSA - Quiz (Additional) (page 3 of 4)

Question 11
Match the following problem and their respective strategy to solve them
Not yet
answered 1.    Longest common subsequence a.    Divide and Conquer
Marked out of
2.    Matrix multiplication b.    Greedy Algorithm
1.00
3.    Interval scheduling c.     Dynamic Programming

4.    Gale-Shapley matching problemd.    None of these

a. 1-a,2-c,3-b,4-d

b. 1-c,2-a,3-b,4-d

c. 1-a,2-c,3-d,4-b

d. 1-c,2-a,3-d,4-b

https://lms.vit.ac.in/mod/quiz/attempt.php?attempt=72665&cmid=15410&page=2 3/5
11/14/2020 DSA - Quiz (Additional) (page 3 of 4)

Question 12
Samarth is planning to go to his hometown in New Delhi from Chennai. The journey starts from VIT, Chennai and ends at
Not yet
answered
Connaught Place (CP), New Delhi. This journey has several possible routes as shown in the Table below. The distances, in
hundreds of kilometers, mentioned in the table is just an indicative for each possibility.
Marked out of
1.00 From cityTo City Distance   From To Distance
city City

VIT B 5   C E 9

VIT C 7   D E 8

B C 4   D F 6

B D 6   E F 3

B E 9   E CP 4

C D 6   F CP 8

 
                Which route should Samarth take from VIT to CP?

a. VIT-C-E-CP

b. VIT-B-E-CP

c. VIT-B-D-E-CP

d. VIT-B-C-E-CP

https://lms.vit.ac.in/mod/quiz/attempt.php?attempt=72665&cmid=15410&page=2 4/5
11/14/2020 DSA - Quiz (Additional) (page 3 of 4)

Question 13
Not yet
answered

Marked out of
1.00

Find the DFS traversal.

a. ABCDEFG

b. ABDFCGE

c. ABDCFGE

d. ABDCFEG

◄ DSA Quiz Jump to... Digital Assignment - 1 ►

https://lms.vit.ac.in/mod/quiz/attempt.php?attempt=72665&cmid=15410&page=2 5/5

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