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 gate_dreams
5
votes
1
MadeEasy Full Length Test 2019: Graph Theory - Vertex Connectivity
The Vertex Connectivity of Graph is : 1 2 3 None
The Vertex Connectivity of Graph is :12 3None
730
views
answered
Jan 16, 2019
Graph Theory
graph-theory
graph-connectivity
made-easy-test-series
+
–
7
votes
2
MadeEasy Full Length Test 2019: Operating System - Semaphore
Let S be a binary semaphore variable, S=0 What will be the value of S when following operations are performed:- 2P, 4V, 5P, 2P, 8V, 3P, 2V ?
Let S be a binary semaphore variable, S=0What will be the value of S when following operations are performed:-2P, 4V, 5P, 2P, 8V, 3P, 2V ?
1.5k
views
answered
Jan 13, 2019
Operating System
operating-system
semaphore
made-easy-test-series
+
–
0
votes
3
Made easy
230
views
answered
Jan 13, 2019
0
votes
4
ACE Material
what does the following declaration specify? int *(*q(char*))[ ]
what does the following declaration specify?int *(*q(char*))[ ]
378
views
answered
Jan 13, 2019
Programming in C
programming-in-c
+
–
0
votes
5
Doubt
can anyone explain in detail why and how is merge sort optimal for linked list?
can anyone explain in detail why and how is merge sort optimal for linked list?
450
views
answered
Oct 18, 2018
DS
linked-list
merge-sort
+
–
0
votes
6
minimum spanning is a spanning tree in which removal of any edges disconnnects the tree. True or false?
minimum spanning is a spanning tree in which removal of any edges disconnnects the tree.True or false?
407
views
answered
Oct 18, 2018
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register