Register
Filter

Questions by Sahil_Lather

0 votes
1 answer
1
Byju's graph theory coloring question
Graph G is obtained by adding vertex s to $K_{3,4}$ and making s adjacent to every vertex of $K_{3,4}$ . The find the minimum number of colours required ot edge-colour is ?
Graph G is obtained by adding vertex s to $K_{3,4}$ and making s adjacent to every vertex of $K_{3,4}$ .The find the minimum number of colours required ot edge-colour is ...
0 votes
0 answers
2
TestBook TestSeries question to find max child possible in B+ Tree
In a B+ Tree index having order 6, which is the maximum number of child pointers it can have. Keys are numbered from 1 to 83. What can be the maximum number of nodes which can be used to store all the keys? A. 17 B. 19 C. 59 D. 57
In a B+ Tree index having order 6, which is the maximum number of child pointers it can have. Keys are numbered from 1 to 83. What can be the maximum number of nodes whic...
0 votes
1 answer
5
TestBook testseries question to find max weight of MST
A complete graph G with 5 nodes has positive weight edges, each node has a distinct weight with an integer value and maximum weight is equal to number of edges in G. What can be the maximum weight of minimum spanning tree for graph G?
A complete graph G with 5 nodes has positive weight edges, each node has a distinct weight with an integer value and maximum weight is equal to number of edges in G.What ...
0 votes
0 answers
6
TestBook TestSeries question to find number of paths in directed graph
Consider the following directed graph and assume the number of paths to reach to itself i.e. N(A) = 1. Number of paths from A to K are __
Consider the following directed graph and assume the number of paths to reach to itself i.e. N(A) = 1.Number of paths from A to K are __
0 votes
0 answers
9
TestBook TestSeries BFS Question to find 4th enqueue element
Consider the following graph. If BFS is implemented on the following graph where the root node is 1 then which of the following set of the nodes are present in the queue after performing 4th enqueue operation? 3, 4, 5 4, 6, 5 3, 4 4, 5, 6
Consider the following graph. If BFS is implemented on the following graph where the root node is 1 then which of the following set of the nodes are present in the queue ...
0 votes
1 answer
11
TestBook testseries linkedList question
What does the following routine do on doubly linked list. M is some middle node address and N is a newly inserted node address. N → lptr = M ; N → rtptr = M → rptr ; N → lptr → rptr = N ; N → rptr → lptr = N ; Inserts a node to Right of M Left of M Right Most Left Most
What does the following routine do on doubly linked list. M is some middle node address and N is a newly inserted node address.N → lptr = M ;N → rtptr = M → rptr ;N...
1 votes
0 answers
12
TestBook graph theory question
If G is a simple planar connected graph with 5 vertices, how many edges in maximum can be there in the given graph?
If G is a simple planar connected graph with 5 vertices, how many edges in maximum can be there in the given graph?
0 votes
0 answers
13
TestBook graph theory questions
Let Gn be the complete bipartite graph K13, 17 then the chromatic number of G̅n is _____ (G̅n is complement of Gn and n = 30) A 13 B 17 C n(n−1)2−13×17 D n(n−1)2−2
Let Gn be the complete bipartite graph K13, 17 then the chromatic number of G̅n is _____ (G̅n is complement of Gn and n = 30)A13B17Cn(n−1)2−13×17Dn(n−1)2−2
1 votes
2 answers
16
Testbook set theory question for abelian group and generators
Given: Statement A: All cyclic groups are an abelian group. Statement B: The order of the cyclic group is the same as the order of its generator. 1 A and B are false 2 A is true, B is false 3 B is true, A is false 4 A and B both are true
Given:Statement A: All cyclic groups are an abelian group.Statement B: The order of the cyclic group is the same as the order of its generator.1A and B are false2A is tru...
0 votes
0 answers
17
TestBook Hasse Diagram question to find GLB
If [P(A); ⊆] is a lattice where A = {x, y} and P(A) is the power set then what is the sum of element in Greatest Lower Bound (GLB) set of given lattice? x + y x y 0
If [P(A); ⊆] is a lattice where A = {x, y} and P(A) is the power set then what is the sum of element in Greatest Lower Bound (GLB) set of given lattice?x + y xy0
0 votes
0 answers
19
RTO in TCP question
A host sends two packets and receives two acknowledgments. The time is shown as hour:minute:seconds. Segment 1 was sent at 0:0:00. Segment 2 was sent at 0:0:07. ACK for segments 1 and 2 received at 0:0:09. Calculate the value of RTO.
A host sends two packets and receives two acknowledgments. The time is shown as hour:minute:seconds.Segment 1 was sent at 0:0:00.Segment 2 was sent at 0:0:07.ACK for segm...
0 votes
1 answer
20
TCP question
Consider the slow start phase for a congestion control in a TCP connection. Initially, the window size is 4 MSS and the threshold is 36 MSS. After which transmission window size reached the threshold limit? 3 4 5 7
Consider the slow start phase for a congestion control in a TCP connection. Initially, the window size is 4 MSS and the threshold is 36 MSS. After which transmission wind...
Page: