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 Ankitrana
10
answers
1
GATE CSE 2006 | Question: 15
Consider the following C-program fragment in which $i$, $j$ and $n$ are integer variables. for( i = n, j = 0; i > 0; i /= 2, j +=i ); Let $val(j)$ denote the value stored in the variable $j$ after termination of the for loop. Which one of the following is true? $val(j)=\Theta(\log n)$ $val(j)=\Theta (\sqrt{n})$ $val(j)=\Theta( n)$ $val(j)=\Theta (n\log n)$
Consider the following C-program fragment in which $i$, $j$ and $n$ are integer variables. for( i = n, j = 0; i 0; i /= 2, j +=i );Let $val(j)$ denote the value stored i...
19.5k
views
answered
Sep 6, 2016
Algorithms
gatecse-2006
algorithms
normal
time-complexity
+
–
1
answer
2
Discrete maths
Can we have Cayley table even for monoid?
Can we have Cayley table even for monoid?
319
views
answered
Sep 6, 2016
2
answers
3
UGC NET CSE | December 2010 | Part 2 | Question: 13
Which one of the following will set the value of $y$ to $5$ if $x$ has the value $3$, but not otherwise ? If $(x = 3) y = 5$ If $x = = 3 (y = 5)$ If $(x = = 3); y = 5$ If $(x = = 3) y = 5$
Which one of the following will set the value of $y$ to $5$ if $x$ has the value $3$, but not otherwise ?If $(x = 3) y = 5$ If $x = = 3 (y = 5)$If $(x = = 3); y = 5$ If $...
1.8k
views
answered
Sep 6, 2016
Programming and DS
ugcnetcse-dec2010-paper2
programming-in-c
+
–
4
answers
4
what will be the time complexity for the below question ?
Let an array A[1,....n] has n elements, and every element of an array is less than or equal to n. An element is said to be "majority element" if it is occurred in more than n/2 positions of an array. what is the time complexity to check whether the majority element exist or not?
Let an array A[1,....n] has n elements, and every element of an array is less than or equal to n. An element is said to be "majority element" if it is occurred in more th...
767
views
asked
Mar 23, 2016
Algorithms
algorithms
time-complexity
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register