Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
ST
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by ST
7
votes
1
GATE CSE 2014 Set 1 | Question: 12
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 $O(n^a\log^bn)$. Then the value of $a+10b$ is __________.
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...
24.3k
views
answered
Nov 10, 2016
DS
gatecse-2014-set1
data-structures
binary-tree
numerical-answers
normal
+
–
14
votes
2
process sync
const int n = 5; int count = 0; void test(){ for i = 1 to n count += 2; } main() { Par begin test(); test(); test(); Par end } What can be the maximum and minimum value of count after completion of the program?
const int n = 5; int count = 0; void test(){ for i = 1 to n count += 2; } main() { Par begin test(); test(); test(); Par end }What can be the maximum and minimum value of...
2.8k
views
answered
Oct 21, 2016
Operating System
process-synchronization
operating-system
+
–
1
votes
3
ISI2014-PCB-A-1b
Let $x, y$ be two non-negative integers $< 2^{32}$. By $x \wedge y$ we mean the integer represented by the bitwise logical $AND$ of the 32- bit binary representations of $x$ and $y$. For example, if $x = 13$ and $y = 6$, then $x \wedge y$ ... the pseudo-code for the input $x = 13$? What will be the output of the pseudo-code for an arbitrary non-negative integer $x < 2^{32}$?
Let $x, y$ be two non-negative integers $< 2^{32}$. By $x \wedge y$ we mean the integer represented by the bitwise logical $AND$ of the 32- bit binary representations of ...
475
views
answered
Sep 21, 2016
Algorithms
descriptive
isi2014
algorithms
identify-function
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register