Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by No_name
1
votes
1
#MST #GREEDY ALGO
Consider the following statements I. Let T be a minimum spanning tree of a graph G.Then for any two vertices u and v the path from u to v in T is the shortest path from u to v in the graph G II.Suppose that average edge weight for a graph G is Aavg. Then ... number of vertices in graph G. which of the above statements are true ? A)Only I B)Only II C)both I and II D)None of these
Consider the following statementsI. Let T be a minimum spanning tree of a graph G.Then for any two vertices u and v the path from u to v in T is the shortest path from u ...
1.4k
views
answered
Jun 19, 2017
Algorithms
algorithms
minimum-spanning-tree
+
–
0
votes
2
[Discrete Maths] Group Theory
If the group has 40 elements and it has two subgroups namely h and k with order 10 and 20 then what can't be order of (h intersection k) a:)10 b:)20 c:)3 d:)1 e:) 4 My answer is both c and b and e. Is it correct?
If the group has 40 elements and it has two subgroups namely h and k with order 10 and 20 then what can't be order of (h intersection k)a:)10b:)20c:)3d:)1e:) 4My answer i...
1.2k
views
answered
Jun 19, 2017
Mathematical Logic
discrete-mathematics
group-theory
+
–
0
votes
3
#GateForum Correspondence Course (Page# 131, Q# 7), #Queue
Which of the following data structure may give overflow error, even though the current number of element in it is less than its size ? (A) Simple Queue (B) Circular Queue (C) Stack (D) None of these
Which of the following data structure may give overflow error, even though the current number of element in it is less than its size ?(A) Simple Queue(B) Circular Queue(C...
3.6k
views
answered
Jun 19, 2017
DS
queue
circular
+
–
0
votes
4
Binary trees
We are given a set of n distinct elements and an unlabelled binary tree with n nodes.how many ways can we populate the tree with the given set so that it becomes a BST 0 1 n! 2nCn / (n+1)
We are given a set of n distinct elements and an unlabelled binary tree with n nodes.how many ways can we populate the tree with the given set so that it becomes a BST01n...
694
views
answered
Jun 19, 2017
0
votes
5
#Number of Elements in Circular Queues and Simple Queues #Doubt
How many elements a simple queue and a circular queue both of size N can accommodates ? ( A ) N and N respectively. ( B ) N-1 and N-1 respectively. ( C ) N and N-1 respectively. ( D ) N-1 and N respectively.
How many elements a simple queue and a circular queue both of size N can accommodates ?( A ) N and N respectively.( B ) N-1 and N-1 respectively.( C ) N and N-1 respec...
3.1k
views
answered
Jun 19, 2017
DS
queue
circular-queue
+
–
3
votes
6
MadeEasy Subject Test: Algorithms - Graph Algorithms
Which of the following statements is true? Adding a constant to every edge weight in a directed graph can change the set of edges that belongs to minimum cost spanning tree. Assume unique weights. Complete graph with 4 vertices, each edges ... ). None of these how is 3rd wrong? If there is no negative cycles dijkstra can work just fine right?
Which of the following statements is true?Adding a constant to every edge weight in a directed graph can change the set of edges that belongs to minimum cost spanning tre...
3.2k
views
answered
Apr 8, 2017
Algorithms
made-easy-test-series
algorithms
graph-algorithms
dijkstras-algorithm
+
–
1
votes
7
Programming and ds
Consider a situation where swap operation is very costly. Which of the following sorting algorithms should be preferred so that the number of swap operations are minimized in general? A Heap Sort B Selection Sort C Insertion Sort D Merge Sort the answer turned out to be B but D should the answer because it does not have any swap operatoin.?
Consider a situation where swap operation is very costly. Which of the following sorting algorithms should be preferred so that the number of swap operations are minimize...
2.7k
views
answered
Apr 7, 2017
Algorithms
sorting
+
–
1
votes
8
Peter Linz Exercise 7.3
#3 : Is the language L= { anbn : n>=1 } U {b} deterministic ? #4 : Is the language L={anbn : n>=1} U {a} deterministic ? #7 Is the following regular language deterministic? L= { anbmck : n=m or m=k } #8 Is the L = {anbm : n ... ended and WR has started. #11- No Idea about it. Please someone verify and tell me is my way of analysis and the analysis is correct or not?
#3 : Is the language L= { anbn : n>=1 } U {b} deterministic ?#4 : Is the language L={anbn : n>=1} U {a} deterministic ?#7 Is the following regular language deterministic?...
3.4k
views
answered
Mar 31, 2017
Theory of Computation
theory-of-computation
deterministic-context-free-grammars
context-free-language
+
–
2
votes
9
MadeEasy Workbook: Computer Networks - Network Flow
An upper layer packet is split into 10 frames each of which has an 80% chance of arriving undamaged.if no error control is done by the data link protocol ,how many times must the message be sent on average to get the entire thing through?
An upper layer packet is split into 10 frames each of which has an 80% chance of arriving undamaged.if no error control is done by the data link protocol ,how many times ...
738
views
answered
Mar 31, 2017
Computer Networks
computer-networks
network-flow
made-easy-booklet
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register