MauryaHub PYQ Practice

Programming, Data Structures and Algorithms using Python · Quiz 2 · Sep 2023

Programming, Data Structures and Algorithms using Python · Quiz 2 · Sep 2023

← Course papers · Start practice / exam

Questions and published explanations below are available without starting a test. Some questions may not have a published solution yet.

0 / 17 published solutions

Question 95 NAT · 3.0 marks

Consider a binary search tree consisting of 15 elements. Let m be the maximum height possible for a given binary search tree, and n be the minimum height possible for a given binary search tree. What will be the value of m − n ?

A published solution is not available for this question yet.

Report a correction for Q95

Question 97 MCQ · 3.0 marks

Source diagram or notation
A.
a, b, c, d, e
B.
a, b, c, e, d
C.
a, b, d, c, e
D.
a, b, d, e, c

A published solution is not available for this question yet.

Report a correction for Q97

Question 98 MCQ · 3.0 marks

Let G = (V, E) be an undirected graph having distinct positive edge weights. Let V be partitioned into two non-empty sets X and Y. Let e = (s, t) be the minimum cost edge, with s belonging to X and t belonging to Y. Which of the following statement(s) is/are true? 1. The edge e must belong to each path from s to t. 2. The edge e must belong to the minimum cost spanning tree of G.
A.
Only 1
B.
Only 2
C.
Both 1 and 2
D.
Neither 1 nor 2

A published solution is not available for this question yet.

Report a correction for Q98

Question 99 MCQ · 3.0 marks

Source diagram or notation
A.
[5, 6, 27, 10, 72, 29, 33, 65, 45]
B.
[5, 6, 27, 10, 72, 33, 29, 45, 65]
C.
[5, 6, 27, 72, 10, 33, 29, 45, 65]
D.
[5, 6, 27, 10, 72, 33, 29, 65, 45]

A published solution is not available for this question yet.

Report a correction for Q99

Question 100 MCQ · 3.0 marks

Source diagram or notation
A.Source diagram or notation
B.Source diagram or notation
C.Source diagram or notation
D.Source diagram or notation

A published solution is not available for this question yet.

Report a correction for Q100

Question 101 MCQ · 3.0 marks

Source diagram or notation
A.Source diagram or notation
B.Source diagram or notation
C.Source diagram or notation
D.Source diagram or notation

A published solution is not available for this question yet.

Report a correction for Q101

Question 102 MCQ · 3.0 marks

Source diagram or notation
A.
15 bits
B.
16 bits
C.
17 bits
D.
18 bits

A published solution is not available for this question yet.

Report a correction for Q102

Question 103 MCQ · 3.0 marks

Source diagram or notation
A.
Select jobs with the earliest start times first.
B.
Select jobs with the earliest end times first.
C.
Select jobs with the shortest duration first.
D.
Select jobs with the longest duration first.

A published solution is not available for this question yet.

Report a correction for Q103

Question 104 MCQ · 3.0 marks

Source diagram or notation
A.Source diagram or notation
B.Source diagram or notation
C.Source diagram or notation
D.Source diagram or notation

A published solution is not available for this question yet.

Report a correction for Q104

Question 105 MCQ · 3.0 marks

Source diagram or notation
A.Source diagram or notation
B.Source diagram or notation
C.Source diagram or notation
D.Source diagram or notation

A published solution is not available for this question yet.

Report a correction for Q105

Question 106 NAT · 4.0 marks

Source diagram or notation

A published solution is not available for this question yet.

Report a correction for Q106

Question 107 NAT · 4.0 marks

Source diagram or notation

A published solution is not available for this question yet.

Report a correction for Q107

Question 108 NAT · 3.0 marks

What is the maximum possible height of an AVL tree containing **15** nodes? Consider that an AVL tree with a single node has a height of 1.

A published solution is not available for this question yet.

Report a correction for Q108

Question 109 MSQ · 3.0 marks

Source diagram or notation
A.
Dijkstra's algorithm computes the correct shortest path distance.
B.
Dijkstra's algorithm does not compute the correct shortest path distance.
C.
Bellman-Ford algorithm computes the correct shortest path distance.
D.
Bellman-Ford algorithm does not compute the correct shortest path distance.
E.
Floyd Warshall algorithm computes the correct shortest path distance.

A published solution is not available for this question yet.

Report a correction for Q109

Question 110 MSQ · 3.0 marks

Which of the following statements is/are **true** about min-heap with distinct elements?
A.
The largest element in a min-heap is always at a leaf node.
B.
The largest element in a min-heap is always at the lowest level.
C.
The second-smallest element in a min-heap is always a child of the root node.
D.
Finding the largest element in min-heap takes O(log n) time.

A published solution is not available for this question yet.

Report a correction for Q110

Question 111 MSQ · 3.0 marks

A binary search tree is used to locate the number 43. Which of the following probe sequences of compared elements from the root to 43 is/are not possible?
A.
2, 3, 50, 40, 60, 43
B.
61, 52, 14, 17, 40, 43
C.
10, 65, 31, 48, 37, 43
D.
17, 77, 27, 66, 18, 43

A published solution is not available for this question yet.

Report a correction for Q111

Question 112 MSQ · 3.0 marks

Consider the following statements and choose the correct ones.
A.Source diagram or notation
B.Source diagram or notation
C.Source diagram or notation
D.Source diagram or notation
      **AppDev1** **Section Id :** 64065348506 **Section Number :** 8 **Section type :** Online **Mandatory or Optional :** Mandatory **Number of Questions :** 15 **Number of Questions to be attempted :** 15 **Section Marks :** 50 **Display Number Panel :** Yes **Group All Questions :** No **Enable Mark as Answered Mark for Review and** Yes **Clear Response :** **Maximum Instruction Time :** 0

A published solution is not available for this question yet.

Report a correction for Q112