This page contains the reliably extracted subset, not the complete original paper.
Questions and published explanations below are available without starting a test. Some questions may not have a published solution yet.
0 / 26 published solutions
Question 227 NAT · 3.0 marks
Consider a **Block nested loop join** for the two relations, **instructor** and **department**.
Assuming the worst-case memory availability and **instructor** as the outer relation, the provided
details are as follows:
• Total number of block transfers: 30500
• Total number of seeks required: 2000
• Number of block in the outer relation: 500
What is the number of blocks in the inner relations?
A published solution is not available for this question yet.
Which of the following vertex sequence is the correct **BFS traversal** on the graph started from
node **7**? Assume that when a node has multiple neighbours, BFS would visit the numerically
smaller valued node first.
A.B.C.D.
A published solution is not available for this question yet.
Which of the following statements is **true** about Dijkstra's algorithm to find the shortest path?
I. The shortest path returned by Dijkstra's algorithm always passes through the least number of
vertices.
II. To decide which node to visit next, Dijkstra's algorithm selects the node with maximum known
distance.
A.
Only I is correct
B.
Only II is Correct
C.
Both I and II are correct
D.
Both I and II are incorrect
A published solution is not available for this question yet.
Which of the following is/are always **true** about the **Bellman-Ford** algorithm?
I. It can not detect negative weight cycles in graph.
II. It works correctly if the graph has negative edge weights but does not have negative weight
cycles.
III. It finds the shortest paths from a single source vertex to all other vertices in the graph.
A.
Only statement I and II are correct
B.
Only statement I and III are correct
C.
Only statement II and III are correct
D.
All statements are correct
E.
All statements are incorrect
A published solution is not available for this question yet.
Let Z be an NP-complete problem and X and Y be two other problems not known to be in NP. X is
polynomial time reducible to Z and Z is polynomial-time reducible to Y. Which one of the following
statements is true?
A.
Y is NP-complete
B.
Y is NP-hard
C.
X is NP-complete
D.
X is NP-hard
A published solution is not available for this question yet.
A baker is preparing an elaborate cake M. The recipe includes preparing several other
components, each of which has its dependencies. The order in which these components must be
prepared is given below:
1. Component X is used to make components P and Q.
2. Component Y is added to prepare components R and S.
3. Component T is prepared by mixing components Q and R.
4. Component Y is made by blending X.
5. Component U is made by mixing P and T.
6. Component V is made by adding sugar to component S.
7. The cake M is assembled by layering components U and V together.
The baker has enough assistants to prepare multiple components simultaneously, allowing the
cake M to be completed in the minimum number of steps, considering all dependencies. Each step
represents a time unit during which one or more components can be prepared in parallel. The
component(s) prepared in the 3rd step is/are ___.
A.
Q
B.
T
C.
R
D.
U
E.
S
A published solution is not available for this question yet.
Based on the above data, answer the given subquestions.
A.B.C.D.
**AppDev1**
**Section Id :** 64065364122
**Section Number :** 9
**Section type :** Online
**Mandatory or Optional :** Mandatory
**Number of Questions :** 32
**Number of Questions to be attempted :** 32
**Section Marks :** 100
**Display Number Panel :** Yes
**Section Negative Marks :** 0
**Group All Questions :** No
**Enable Mark as Answered Mark for Review and**
No
**Clear Response :**
**Maximum Instruction Time :** 0
A published solution is not available for this question yet.