Register
Filter

Recent activity by gate_dreams

1 answer
1
Ace dlp
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. Whjch is correct? a. val(j)=theta(logn) b. Val(j)= theta(√n) c. Val(j) = theta(n) d. Val(j) = theta(nlogn)
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. Whjch is correct?a. val(j)=theta(logn)b. Val(j)= the...
0 answers
2
Made Easy
What are all the conditions for the degree sequence to be graphic?
What are all the conditions for the degree sequence to be graphic?
1 answer
4
MadeEasy Full Length Test 2019: Operating System - Semaphore
Let S be a binary semaphore variable, S=0 What will be the value of S when following operations are performed:- 2P, 4V, 5P, 2P, 8V, 3P, 2V ?
Let S be a binary semaphore variable, S=0What will be the value of S when following operations are performed:-2P, 4V, 5P, 2P, 8V, 3P, 2V ?
1 answer
5
Made easy
1 answer
6
ACE Material
what does the following declaration specify? int *(*q(char*))[ ]
what does the following declaration specify?int *(*q(char*))[ ]
0 answers
7
Self Doubt
Does DMA use interrupts? or not. please, someone ..
Does DMA use interrupts? or not. please, someone ..
1 answer
8
Doubt
can anyone explain in detail why and how is merge sort optimal for linked list?
can anyone explain in detail why and how is merge sort optimal for linked list?
0 answers
9
Linked list
If the head of a Linked List is pointing to $k$ th element, then how will you get the elements before $k$ th element?
If the head of a Linked List is pointing to $k$ th element, then how will you get the elements before $k$ th element?
1 answer
10
minimum spanning is a spanning tree in which removal of any edges disconnnects the tree. True or false?
minimum spanning is a spanning tree in which removal of any edges disconnnects the tree.True or false?
3 answers
11
Find total number of comparisons needed
What is the total number of comparisons needed in the best case to find minimum and maximum of $300 $ elements?
What is the total number of comparisons needed in the best case to find minimum and maximum of $300 $ elements?
0 answers
12
What is s-grammar?