The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
Facebook Login
or
Email or Username
Password
Remember
Login
Register

I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
Answers by Tejasvi96
User Tejasvi96
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User Tejasvi96
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
0
votes
1
Kenneth Rosen Edition 6th Exercise 7.1 Question 23 (Page No. 458)
Find a recurrence relation for the number of bit strings of length n that contains a pair of consecutive 0s
answered
Dec 15, 2018
in
Combinatory

78
views
kennethrosen
discretemathematics
#recurrencerelations
+3
votes
2
B+ TREE
answered
Oct 28, 2018
in
Databases

148
views
dbmsbtree
+1
vote
3
self doubt
Suppose that average edge weight for a graph G is Aavg. Then the minimum spanning tree of G will have weight at most (n1) Aavg. Where n is number of vertices in graph G. i think think is false but in a solution mannul it is given as true please check it.
answered
Jun 16, 2018
in
Algorithms

68
views
50,737
questions
57,324
answers
198,410
comments
105,176
users