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 Devesh_Kumar
0
votes
1
GATE CSE 1998 | Question: 2.11
A complete $n$-ary tree is one in which every node has $0$ or $n$ sons. If $x$ is the number of internal nodes of a complete $n$-ary tree, the number of leaves in it is given by $x(n-1) +1$ $xn-1$ $xn +1$ $x(n+1)$
A complete $n$-ary tree is one in which every node has $0$ or $n$ sons. If $x$ is the number of internal nodes of a complete $n$-ary tree, the number of leaves in it is g...
14.7k
views
answered
Dec 10, 2019
DS
gate1998
data-structures
tree
normal
+
–
2
votes
2
GATE2011 AG: GA-6
The sum of $n$ terms of the series $4+44+444+ \dots \dots $ is $\frac{4}{81}\left[10^{n+1}-9n-1\right]$ $\frac{4}{81}\left[10^{n-1}-9n-1\right]$ $\frac{4}{81}\left[10^{n+1}-9n-10\right]$ $\frac{4}{81}\left[10^{n}-9n-10\right]$
The sum of $n$ terms of the series $4+44+444+ \dots \dots $ is$\frac{4}{81}\left[10^{n+1}-9n-1\right]$$\frac{4}{81}\left[10^{n-1}-9n-1\right]$$\frac{4}{81}\left[10^{n+1}-...
2.5k
views
answered
Oct 30, 2019
Quantitative Aptitude
general-aptitude
quantitative-aptitude
gate2011-ag
arithmetic-series
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register