Register
Filter

Answers by sh!va

1 votes
205
Ace Page# 09, Q# 04
What does the double arrow in options 2 & 4 mean ?
What does the double arrow in options 2 & 4 mean ?
1 votes
206
arihant gate tutor 2016
which one is correst #round robin scheduling is essentially the preemptive version of 1) FIFO 2) shortest job first 3) shortest remaining time first 4) longest time first
which one is correst #round robin scheduling is essentially the preemptive version of 1) FIFO 2) shortest job first 3) shortest remaining time first 4) longest time first...
3 votes
207
# c programming
consider the declaration: char first(int(*)(char,float)); int second(char,float); Which of the following function invocation is valid and how? a) first(*second); b) first(&second); c) first(second);
consider the declaration:char first(int(*)(char,float));int second(char,float);Which of the following function invocation is valid and how?a) first(*second);b) first(&sec...
1 votes
209
Cache
Wide cache is available so in my program which data structure I can use? 1.Array 2.Linked list
Wide cache is available so in my program which data structure I can use? 1.Array2.Linked list
1 votes
210
number of strings upto length 3 on alphabet set =(a,b,c,d) are.??
Elaborate by showing all strings..
Elaborate by showing all strings..
3 votes
211
conditional probability
A box contains 10 mangoes out of which 4 are rotten .Two mangoes are taken out together. If one of them is found to be good ,then find the probability other is also good
A box contains 10 mangoes out of which 4 are rotten .Two mangoes are taken out together. If one of them is found to be good ,then find the probability other is also good...
1 votes
215
What is the time complexity of following code (4 level nested loop)?
for(i=1;i<=n;i++) for(j=1;j<=i;j++) for(k=1;k<=j;k++) for(l=1;l<=k;l++) printf("gate");
for(i=1;i<=n;i++) for(j=1;j<=i;j++) for(k=1;k<=j;k++) for(l=1;l<=k;l++) printf("gate");
5 votes
216
Complexity2
An array of size n. Find the time complexity to insert a new value before an element e in the array? a)O(n) b)O(log n) c)O(1)
An array of size n. Find the time complexity to insert a new value before an element e in the array?a)O(n)b)O(log n)c)O(1)
1 votes
217
UGC NET CSE | December 2014 | Part 3 | Question: 33
We can show that the clique problem is $NP$-hard by proving that CLIQUE $\leq$ P 3-CNF_SAT CLIQUE $\leq$ P VERTEX_COVER CLIQUE $\leq$ P SUBSET_SUM None of the above
We can show that the clique problem is $NP$-hard by proving thatCLIQUE $\leq$ P 3-CNF_SATCLIQUE $\leq$ P VERTEX_COVERCLIQUE $\leq$ P SUBSET_SUMNone of the above
2 votes
219
UGC NET CSE | Junet 2015 | Part 3 | Question: 52
Dining Philosopher's problem is a Producer - consumer problem Classical IPC problem Starvation problem Synchronization primitive
Dining Philosopher's problem is aProducer - consumer problemClassical IPC problemStarvation problemSynchronization primitive
0 votes
221
c program
#include<stdio.h> #include<stdio.h> void main() { int in; while ((in = getchar())) { putchar(in); } } explain o/p and what is in=getchar line
#include<stdio.h>#include<stdio.h>void main(){int in; while ((in = getchar())) {putchar(in);}} explain o/p and what is in=getchar line
4 votes
222
UGC NET CSE | Junet 2015 | Part 3 | Question: 42
Modulo design is used to maximize cohesion and minimize coupling. Which of the following is the key to implement this rule? Inheritance Polymorphism Encapsulation Abstraction
Modulo design is used to maximize cohesion and minimize coupling. Which of the following is the key to implement this rule?InheritancePolymorphismEncapsulationAbstractio...
2 votes
226
UGC NET CSE | Junet 2015 | Part 3 | Question: 36
The number of nodes in height h in any n-element heap is $h$ $z^h$ ceil $\biggl(\frac{n}{z^h} \biggr)$ ceil $\biggl(\frac{n}{z^{h+1}} \biggr)$
The number of nodes in height h in any n-element heap is$h$$z^h$ceil $\biggl(\frac{n}{z^h} \biggr)$ceil $\biggl(\frac{n}{z^{h+1}} \biggr)$
Page: