Register
Filter

Recent activity by G.K.T

0 answers
2
Made Easy mock test 1 Q:16 (2017-18)
Which of the following is true for the predicate logic P ? ~ $\forall z[P(z) \rightarrow ($~$Q(z)\rightarrow P(z)) ]$ a.) P is satisfiable b.) P is Tautology c.) P is Contradiction d.) None of these
Which of the following is true for the predicate logic P ?~ $\forall z[P(z) \rightarrow ($~$Q(z)\rightarrow P(z)) ]$a.) P is satisfiableb.) P is Tautologyc.) P is Contrad...
0 answers
3
Made easy mock 1 Q:30 (2017-18)
The number of ways can 10 balls be chosen from an urn containing 10 identical green balls, 5 identical yellow balls and 3 identical blue balls are __________. PS : I am interested in approach to solve the problem , not the ans
The number of ways can 10 balls be chosen from an urn containing 10 identical green balls, 5 identical yellow balls and 3 identical blue balls are __________. PS : I am i...
1 answer
5
MADE EASY Basic Full Length 3
Consider a page size of 1 KB and that each page table entry takes 4 B. If every page table fits into a single page and 3 level paging are used then size of virtual memory is ________(in bits).
Consider a page size of 1 KB and that each page table entry takes 4 B. If every page table fits into a single page and 3 level paging are used then size of virtual memory...
2 answers
6
ISRO-DEC2017-28
The number of structurally different possible binary trees with $4$ nodes is $14$ $12$ $336$ $168$
The number of structurally different possible binary trees with $4$ nodes is $14$$12$$336$$168$
4 answers
8
GATE CSE 2015 Set 2 | Question: 17
Consider a complete binary tree where the left and right subtrees of the root are max-heaps. The lower bound for the number of operations to convert the tree to a heap is $\Omega(\log n)$ $\Omega(n)$ $\Omega(n \log n)$ $\Omega(n^2)$
Consider a complete binary tree where the left and right subtrees of the root are max-heaps. The lower bound for the number of operations to convert the tree to a heap is...
2 answers
10
ISRO2016-51
For the real time operating system, which of the following is the most suitable scheduling scheme? Round robin First come first serve Pre-emptive Random scheduling
For the real time operating system, which of the following is the most suitable scheduling scheme?Round robinFirst come first servePre-emptiveRandom scheduling
1 answer
13
Average
A train travels 8 km in the first quarter of an hour, 6 km in the second quarter and 40 km in the third quarter. Find the average speed of train per hour over the entire journey. <a>. 72 km/h <b>. 18 km/h <c>. 77.33 km/h <d>. 78.5 km/h
A train travels 8 km in the first quarter of an hour, 6 km in the second quarter and 40 km in the third quarter. Find the average speed of train per hour over the entire ...
1 answer
16
combinatoric
No of ways to distribute 6 different gifts to 2 student from total 4 student ? my approach ... distinct to distinct ... am getting 378 , given ans is 384 ... they permuted ..is this correct ...?
No of ways to distribute 6 different gifts to 2 student from total 4 student ? my approach ... distinct to distinct ... am getting 378 , given ans is 384 ... they permute...
4 answers
18
Test Series
How come here deadlock is not possible?! It says each process needs a minimum of one instance to complete. So maximum could be anything greater than one and deadlock may happen in the worst case, right?
How come here deadlock is not possible?! It says each process needs a minimum of one instance to complete. So maximum could be anything greater than one and deadlock may...
0 answers
19
Shortest Path
First Statement is true. But I don't know about second?
First Statement is true. But I don't know about second?
1 answer
20
Computer networks
There are 10 stations in a LAN always having constant load, ready to transmit. During any particular contention slot, each station transmits with a probability 0.1. If the average frame takes 122ms to transmit, what is the channel efficiency, if the round trip time is 51.2 micro seconds?
There are 10 stations in a LAN always having constant load, ready to transmit. During any particular contention slot, each station transmits with a probability 0.1. If th...
0 answers
22
csma/cd
1 answer
24
self doubt
how should we prepare for general aptitude section of gate and when is the best time for its prep during rivision and how much time should we allot to it ?? please advice
how should we prepare for general aptitude section of gate and when is the best time for its prep during rivision and how much time should we allot to it ?? please advice...
1 answer
25
Algo doubt
What will be the time complexity? voidfun() { int i, j; for (i=1; i<=n; i++) for (j=1; j<=log(i); j++) printf("hello"); }
What will be the time complexity?voidfun(){int i, j;for (i=1; i<=n; i++)for (j=1; j<=log(i); j++)printf("hello");}
1 answer
26
sql query
6 answers
27
Simplified CFG
Consider the following grammar $S\rightarrow Aa\mid B $ $B\rightarrow a\mid BC$ $C \rightarrow a\mid \in$ the no of productions in simplified cfg is
Consider the following grammar$S\rightarrow Aa\mid B $$B\rightarrow a\mid BC$$C \rightarrow a\mid \in$the no of productions in simplified cfg is
1 answer
29
Data Dependency
Do we have to see the WAW and WAR dependency in adjacent instructions or the full set of instructions ?
Do we have to see the WAW and WAR dependency in adjacent instructions or the full set of instructions ?