Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Shradha
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Questions by Shradha
1
votes
3
answers
1
Test series: gatebook mock 2
Consider the collection of all un directed graphs with 10 nodes and 6 edges. Let M and m, respectively, be the maximum and minimum number of connected components in any graph in the collection. If a graph has no self loops and there is at most one edge between any pair of nodes, which of ... = 10, m = 1 (C) M = 7, m = 4 (D) M = 6, m = 4 Shouldn't the answer be D?
Consider the collection of all un directed graphs with 10 nodes and 6 edges. Let M and m, respectively, be the maximum and minimum number of connected components in any g...
1.9k
views
asked
Feb 8, 2017
Graph Theory
gatebook-mt2
+
–
2
votes
4
answers
2
Directed acyclic graph
In questions like, when asked to find the edges or nodes in the DAG of following expression, a=a+b*c-(a+b)+(b*c) do we also consider "=" as a node and its related edges?
In questions like, when asked to find the edges or nodes in the DAG of following expression,a=a+b*c-(a+b)+(b*c)do we also consider "=" as a node and its related edges?
2.5k
views
asked
Jan 9, 2017
Compiler Design
compiler-design
code-optimization
directed-acyclic-graph
+
–
1
votes
2
answers
3
Travelling Salesman Problem
A)250 B)300 C)550 D)375
A)250 B)300 C)550 D)375
4.9k
views
asked
Jan 5, 2017
Algorithms
graph-algorithms
test-series
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register