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
Recent activity by Palash yadav
5
answers
1
GATE CSE 1999 | Question: 1.16
If $n$ is a power of $2$, then the minimum number of multiplications needed to compute $a^n$ is $\log_2 n$ $\sqrt n$ $n-1$ $n$
If $n$ is a power of $2$, then the minimum number of multiplications needed to compute $a^n$ is$\log_2 n$$\sqrt n$$n-1$$n$
9.3k
views
commented
Jul 14, 2021
Algorithms
gate1999
algorithms
time-complexity
normal
+
–
11
answers
2
GATE CSE 2003 | Question: 69
The following are the starting and ending times of activities $A, B, C, D, E, F, G$ and $H$ ... a room only if the room is reserved for the activity for its entire duration. What is the minimum number of rooms required? $3$ $4$ $5$ $6$
The following are the starting and ending times of activities $A, B, C, D, E, F, G$ and $H$ respectively in chronological order: $“a_s \: b_s \: c_s \: a_e \: d_s \: c_...
14.5k
views
commented
Jul 13, 2021
Algorithms
gatecse-2003
algorithms
normal
greedy-algorithm
+
–
7
answers
3
GATE CSE 2002 | Question: 2.12
A weight-balanced tree is a binary tree in which for each node, the number of nodes in the left sub tree is at least half and at most twice the number of nodes in the right sub tree. The maximum possible height (number of nodes on the path from the root to the furthest ... which of the following? $\log_2 n$ $\log_{\frac{4}{3}} n$ $\log_3 n$ $\log_{\frac{3}{2}} n$
A weight-balanced tree is a binary tree in which for each node, the number of nodes in the left sub tree is at least half and at most twice the number of nodes in the rig...
23.7k
views
commented
Jun 5, 2021
DS
gatecse-2002
data-structures
binary-tree
normal
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register