Register

DRDO CSE 2022 Paper 1 | Question: 33 (b)

• retagged by
308 views

1 Answer

0 votes
0 votes
We can see the graph can be divided into 4 vertical layers with 3 nodes in each layer. In each layer there is exactly one edge to the next layer and no way to go back or stay in the same layer. Hence starting from s, each layer will give us 4 nodes before we discover t.
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

363
views
0 answers
1 votes
admin asked Dec 15, 2022
363 views
DRDO CSE 2022 Paper 1 | Question: 33 (a)
Consider the following graph.How many nodes (apart from $s$) does the Breadth First Search algorithm discover before discovering $t$ when starting from $s$.
User Avatar
407
views
0 answers
1 votes
admin asked Dec 15, 2022
407 views
DRDO CSE 2022 Paper 1 | Question: 32 (a)
Let us suppose we are given an integer $N$ in binary representation. Let us consider the following algorithm to check if $N$ is a prime.For every $i$ ... answer the following.Explain why iterating till $\lceil\sqrt{N}\rceil$ is sufficient.
User Avatar
248
views
0 answers
1 votes
admin asked Dec 15, 2022
248 views
DRDO CSE 2022 Paper 1 | Question: 32 (b)
Let us suppose we are given an integer $\text{N}$ in binary representation. Let us consider the following algorithm to check if $\text{N}$ is a prime.For every ... ? (Assume hypothetically that division can be done in $\text{O}(1)$ time).
User Avatar
525
views
1 answers
1 votes
admin asked Jan 26, 2023
525 views
DRDO CSE 2022 Paper 1 | Question: 5 (b)
Consider rolling of a dice experiment. Let $\text{A}$ be the event of getting an even number and $\mathrm{B}$ be the event of getting a prime number. Write the sets representing the following events.$\mathrm{A}$ and $\mathrm{B}$
User Avatar
Link Copied!