Register
Filter

Recent activity by shree

5 answers
3
GATE CSE 2005 | Question: 37
Suppose $T(n) =2T (\frac{n}{2}) + n$, $T(0) = T(1) =1$ Which one of the following is FALSE? $T(n)=O(n^2)$ $T(n)=\Theta(n \log n)$ $T(n)=\Omega(n^2)$ $T(n)=O(n \log n)$
Suppose $T(n) =2T (\frac{n}{2}) + n$, $T(0) = T(1) =1$Which one of the following is FALSE?$T(n)=O(n^2)$$T(n)=\Theta(n \log n)$$T(n)=\Omega(n^2)$$T(n)=O(n \log n)$
4 answers
4
GATE CSE 1998 | Question: 1.18
Which of the following devices should get higher priority in assigning interrupts? Hard disk Printer Keyboard Floppy disk
Which of the following devices should get higher priority in assigning interrupts?Hard diskPrinterKeyboardFloppy disk
4 answers
5
Which of the following are equal things when there is only one CPU in a system.
Which of the following are equal things when there is only one CPU in a system. A) Multiprogramming and Multitasking B) Multiprocessing and Multiprogramming C) Multitasking and Multiprocessing D) None of these
Which of the following are equal things when there is only one CPU in a system.A) Multiprogramming and MultitaskingB) Multiprocessing and MultiprogrammingC) Multitasking ...
1 answer
6
Transactions
To check whether a given schedule is serializable or not , do we need to check only for conflict serializability or both conflict serializability and view serializability ..?
To check whether a given schedule is serializable or not , do we need to check only for conflict serializability or both conflict serializability and view serializabil...
4 answers
7
GATE CSE 2004 | Question: 39
Two matrices $M_1$ and $M_2$ are to be stored in arrays $A$ and $B$ ... column-major order best if both are in row-major order best if both are in column-major order independent of the storage scheme
Two matrices $M_1$ and $M_2$ are to be stored in arrays $A$ and $B$ respectively. Each array can be stored either in row-major or column-major order in contiguous memory ...
10 answers
8
GATE CSE 2003 | Question: 16
Which of the following suffices to convert an arbitrary CFG to an LL(1) grammar? Removing left recursion alone Factoring the grammar alone Removing left recursion and factoring the grammar None of the above
Which of the following suffices to convert an arbitrary CFG to an LL(1) grammar?Removing left recursion aloneFactoring the grammar aloneRemoving left recursion and factor...
4 answers
13
GATE CSE 2004 | Question: 20
Which of the following addressing modes are suitable for program relocation at run time? Absolute addressing Based addressing Relative addressing Indirect addressing I and IV I and II II and III I, II and IV
Which of the following addressing modes are suitable for program relocation at run time?Absolute addressingBased addressingRelative addressingIndirect addressingI and IVI...
5 answers
15
GATE CSE 2007 | Question: 8, ISRO2011-31
How many $3$-to-$8$ line decoders with an enable input are needed to construct a $6$-to-$64$ line decoder without using any other logic gates? $7$ $8$ $9$ $10$
How many $3$-to-$8$ line decoders with an enable input are needed to construct a $6$-to-$64$ line decoder without using any other logic gates?$7$$8$$9$$10$
8 answers
16
how many process created?
Consider the following Pseudo code main() { int t1=0,t2=0,t3=0; t1=fork(); t2=fork(); if(t1!=0) { t3=fork(); printf("0"); } } Find the total number of processes that will be created by the above program execution.
Consider the following Pseudo codemain() { int t1=0,t2=0,t3=0; t1=fork(); t2=fork(); if(t1!=0) { t3=fork(); printf("0"); } }Find the total number of processes that will b...
1 answer
17
A relational table employee.
A relational table Employee (ENo, EName, Dept) has $88$ number of tuples. What will be the result of following SQL statement? SELECT COUNT (ENo) FROM Employee WHERE ENo NOT IN (NULL); $88$ $44$ $0$ $87$
A relational table Employee (ENo, EName, Dept) has $88$ number of tuples. What will be the result of following SQL statement?SELECT COUNT (ENo) FROM Employee WHERE ENo NO...
1 answer
18
consider the following code
6 answers
22
GATE CSE 2010 | Question: 45
The following program consists of $3$ concurrent processes and $3$ binary semaphores. The semaphores are initialized as $S0=1, S1=0$ and $S2=0.$ ... $P0$ print '$0$'? At least twice Exactly twice Exactly thrice Exactly once
The following program consists of $3$ concurrent processes and $3$ binary semaphores. The semaphores are initialized as $S0=1, S1=0$ and $S2=0.$$$\begin{array}{|l|l|}\hli...
4 answers
23
No of surjective functions
The number of surjective (onto) functions defined from $A$ to $B$ where |A| = 5, |B| = 4, is _______
The number of surjective (onto) functions defined from $A$ to $B$ where |A| = 5, |B| = 4, is _______
6 answers
28
GATE CSE 2002 | Question: 2.17
The binary relation $S= \phi \text{(empty set)}$ on a set $A = \left \{ 1,2,3 \right \}$ is Neither reflexive nor symmetric Symmetric and reflexive Transitive and reflexive Transitive and symmetric
The binary relation $S= \phi \text{(empty set)}$ on a set $A = \left \{ 1,2,3 \right \}$ is Neither reflexive nor symmetricSymmetric and reflexiveTransitive and reflexive...
2 answers
29
plz explain why b is correct?