Register

TestBook TestSeries question to find number of paths in directed graph

• retagged by
233 views

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
1 answer
1
Sahil_Lather asked Jan 28, 2023
420 views
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 ...
User Avatar
0 votes
0 votes
0 answers
2
Sahil_Lather asked Jan 29, 2023
509 views
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...
User Avatar
1 votes
1 votes
1 answer
4
neha singh asked Mar 17, 2017
2,086 views
A directed acyclic graph represents one form of intermediate repsentation .
A directed acyclic graph represents one form of intermediate representation.The number of non-terminal nodes in DAG of a=(b+c)*(b+c) a)2 b)3 c)4 d)5
A directed acyclic graph represents one form of intermediate representation.The number of non-terminal nodes in DAG of a=(b+c)*(b+c)a)2b)3c)4d)5
User Avatar
Link Copied!