MauryaHub PYQ Practice

Programming, Data Structures and Algorithms using Python · End Term · Sep 2023 · AN

Programming, Data Structures and Algorithms using Python · End Term · Sep 2023 AN

← 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 / 25 published solutions

Question 23 MCQ · 4.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 Q23

Question 24 MCQ · 4.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 Q24

Question 25 MCQ · 4.0 marks

Source diagram or notation
A.
4
B.
6
C.
9
D.
10

A published solution is not available for this question yet.

Report a correction for Q25

Question 26 MCQ · 4.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 Q26

Question 27 MCQ · 4.0 marks

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

A published solution is not available for this question yet.

Report a correction for Q27

Question 28 MCQ · 4.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 Q28

Question 29 MCQ · 4.0 marks

Source diagram or notation
A.
1, 4, 3, 6, 5, 2
B.
1, 4, 5, 6, 3, 2
C.
1, 4, 6, 5, 3, 2
D.
1, 4, 6, 3, 5, 2

A published solution is not available for this question yet.

Report a correction for Q29

Question 30 MCQ · 4.0 marks

Source diagram or notation
A.
This strategy will not solve the problem correctly.
B.
This strategy will only work if the graph is acyclic.
C.
This strategy will solve the problem correctly and is as efficient as Dijkstra’s algorithm.
D.
This strategy will solve the problem correctly, but is not as efficient as Dijkstra’s algorithm.

A published solution is not available for this question yet.

Report a correction for Q30

Question 31 MCQ · 4.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 Q31

Question 32 MCQ · 4.0 marks

Source diagram or notation
A.
[40, 20, 5, 15, 23, 10, 3, 2]
B.
[40, 23, 10, 15, 20, 2, 3, 5]
C.
[40, 23, 20, 15, 10, 2, 3, 5]
D.
[40, 23, 10, 20, 15, 2, 3, 5]

A published solution is not available for this question yet.

Report a correction for Q32

Question 33 MCQ · 4.0 marks

Source diagram or notation
A.Source diagram or notation
19
B.
15
C.
16
D.
21

A published solution is not available for this question yet.

Report a correction for Q33

Question 34 MCQ · 4.0 marks

Source diagram or notation
A.
4
B.
5
C.
6
D.
7

A published solution is not available for this question yet.

Report a correction for Q34

Question 35 MCQ · 4.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 Q35

Question 36 MCQ · 4.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 Q36

Question 37 MCQ · 4.0 marks

Which of the following combination of input text T and pattern P will exhibit the worst case running time behavior for **Boyer-Moore skipping heuristic**?
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 Q37

Question 38 MCQ · 4.0 marks

Source diagram or notation
A.
2x + y <= 50
B.
x + 2y <= 50
C.
x >= 0 , y >= 0
D.
x + 2y <= 40

A published solution is not available for this question yet.

Report a correction for Q38

Question 39 MCQ · 4.0 marks

Source diagram or notation
A.
It can be modelled as a network flow problem, where the source node is connected to every teacher node in G with capacity of n, and every subject node in G is connected to the sink node with capacity of 2n.
B.
It can be modelled as a network flow problem, where the source node is connected to every teacher node in G, and every subject node in G is connected to the sink node. All edges in the network flow graph have equal capacity.
C.
It can be modelled as a network flow problem, where the source node is connected to every teacher node in G with capacity of 2, and every subject node in G is connected to the sink node with capacity of 1.
D.
It can be modelled as a network flow problem, where the source node is connected to every teacher node in G with capacity of 1, and every subject node in G is connected to the sink node with capacity of 2.

A published solution is not available for this question yet.

Report a correction for Q39

Question 40 MSQ · 4.0 marks

Source diagram or notation
A.
E - F - C - D - B - A
B.
F - E - A - C - D - B
C.
F - E - A - D - C - B
D.
E - F - C - D - A - B
E.
F - C - D - A - E - B

A published solution is not available for this question yet.

Report a correction for Q40

Question 41 MSQ · 4.0 marks

Which of the following is/are **true** about the **Floyd-Warshall algorithm**?
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 Q41

Question 42 MSQ · 4.0 marks

Which of the following is/are **true** about **AVL Tree**? Assume that the height of the empty tree is 0.
A.Source diagram or notation
B.Source diagram or notation
C.Source diagram or notation
D.Source diagram or notation
E.Source diagram or notation

A published solution is not available for this question yet.

Report a correction for Q42

Question 43 NAT · 4.0 marks

Consider a simple undirected connected graph G with **65** edges with the least number of vertices possible. What will be the number of vertices in graph G?

A published solution is not available for this question yet.

Report a correction for Q43

Question 44 NAT · 4.0 marks

In a binary tree T of **25** nodes, if the number of nodes with two children is **6**, then the number of nodes with one child is ___ .

A published solution is not available for this question yet.

Report a correction for Q44

Question 45 NAT · 4.0 marks

The **pre-order traversal** of a binary search tree is: **4, 1, 3, 2, 7, 5, 6, 8** What would be the sum of elements stored in the leaf nodes of a binary search tree?

A published solution is not available for this question yet.

Report a correction for Q45

Question 46 NAT · 4.0 marks

Source diagram or notation

A published solution is not available for this question yet.

Report a correction for Q46

Question 47 NAT · 4.0 marks

Source diagram or notation

A published solution is not available for this question yet.

Report a correction for Q47