Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
vineet.ildm
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by vineet.ildm
0
votes
1
GARPH THEORY
Q.A tree has n2 vertices of degree 2,n3 vertices of degree 3.....and nk vertices of degree k.How many vertices of degree 1 does it have ? a)n2+2n4+3n5+.......+(k-2)nk+1 b)n2+2n3+3n4+.......+(k-1)nk c)n3+2n4+3n5+.......+(k-2)nk+2 d)None of the above
Q.A tree has n2 vertices of degree 2,n3 vertices of degree 3.....and nk vertices of degree k.How many vertices of degree 1 does it have ?a)n2+2n4+3n5+.......+(k-2)nk+1b)n...
2.2k
views
answered
Nov 20, 2017
Graph Theory
graph-theory
+
–
64
votes
2
GATE CSE 2006 | Question: 52
The median of $n$ elements can be found in $O(n)$ time. Which one of the following is correct about the complexity of quick sort, in which median is selected as pivot? $\Theta (n)$ $\Theta (n \log n)$ $\Theta (n^{2})$ $\Theta (n^{3})$
The median of $n$ elements can be found in $O(n)$ time. Which one of the following is correct about the complexity of quick sort, in which median is selected as pivot?$\T...
53.3k
views
answered
Aug 4, 2017
Algorithms
gatecse-2006
algorithms
sorting
easy
+
–
4
votes
3
general doubt
Which multiple access methods are in gate 2017 syllabus?? CDMA-CA,CDMA-CD, polling, time division, ALOHA. Are there any left apart from these?? There are so many given in Tanenbaum.
Which multiple access methods are in gate 2017 syllabus??CDMA-CA,CDMA-CD, polling, time division, ALOHA.Are there any left apart from these?? There are so many given in T...
1.1k
views
answered
Nov 19, 2016
Computer Networks
syllabus
gate2017
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register