Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent posts tagged ccmt
1
Selected for M.Tech Computer Science in University of Hyderabad
The function terminates for all powers of $2$ (which is infinite), hence (i) is false and (ii) is TRUE.Let $n = 5. $Now, recursive calls will go like $5 - 14 - 7 - 20 - 1...
Shikha Mallick
3,189
views
Shikha Mallick
posted
May 19, 2018
Preparation Advice
mtech-admission
mtech
gate2018-admissions
admissions
ccmt
gate2018
+
–
2
CCMT 2017
Consider a rooted n node binary tree represented using pointers. The best upper bound on the time required to determine the number of subtrees having exactly $4$ nodes is...
Arjun
5,044
views
Arjun
posted
Apr 30, 2017
From GO Admins
ccmt
gate2017
mtech-admission
announcement
+
–
To see more, click for the
full list of questions
or
popular tags
.
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register