Register
Filter

Recent activity by sukesh_reddy

9 answers
1
Kenneth Rosen Edition 6 Question 45 (Page No. 346)
How many bit strings of length eight contain either three consecutive 0s or four consecutive 1s?
How many bit strings of length eight contain either three consecutive 0s or four consecutive 1s?
6 answers
2
GATE CSE 1987 | Question: 1-V
The most relevant addressing mode to write position-independent codes is: Direct mode Indirect mode Relative mode Indexed mode
The most relevant addressing mode to write position-independent codes is:Direct modeIndirect modeRelative modeIndexed mode
4 answers
7
GATE CSE 2000 | Question: 1.8
Comparing the time T1 taken for a single instruction on a pipelined CPU with time T2 taken on a non-pipelined but identical CPU, we can say that T1 ≤ T2 T1 ≥ T2 T1 < T2 T1 and T2 plus the time taken for one instruction fetch cycle
Comparing the time T1 taken for a single instruction on a pipelined CPU with time T2 taken on a non-pipelined but identical CPU, we can say thatT1 ≤ T2T1 ≥ T2T1 < T2T...
6 answers
11
GATE CSE 2008 | Question: 82
Consider the following $\text{ER}$ diagram The minimum number of tables needed to represent $M$, $N$, $P$, $R1$, $R2$ is $2$ $3$ $4$ $5$
Consider the following $\text{ER}$ diagramThe minimum number of tables needed to represent $M$, $N$, $P$, $R1$, $R2$ is$2$$3$$4$$5$
1 answer
13
decidability
a context-free grammar is ambiguous is undecidable But for a given context-free language if we can make more than one parse tree then it means that it is ambiguous..So how it is undecidable??
a context-free grammar is ambiguous is undecidableBut for a given context-free language if we can make more than one parse tree then it means that it is ambiguous..So how...
5 answers
16
GATE CSE 2008 | Question: 70
Consider a file of $16384$ records. Each record is $32\;\text{bytes}$ long and its key field is of size $6\;\text{bytes}$ ... -level blocks in the multi-level index are respectively $8$ and $0$ $128$ and $6$ $256$ and $4$ $512$ and $5$
Consider a file of $16384$ records. Each record is $32\;\text{bytes}$ long and its key field is of size $6\;\text{bytes}$. The file is ordered on a non-key field, and the...
8 answers
17
GATE CSE 2014 Set 2 | Question: 21
The maximum number of superkeys for the relation schema $R(E,F,G,H)$ with $E$ as the key is _____.
The maximum number of superkeys for the relation schema $R(E,F,G,H)$ with $E$ as the key is _____.
4 answers
19
GATE CSE 2016 Set 2 | Question: 03
The minimum number of colours that is sufficient to vertex-colour any planar graph is ________.
The minimum number of colours that is sufficient to vertex-colour any planar graph is ________.
1 answer
21
GATE CSE 1987 | Question: 1-III
The above circuit produces the output sequence: $1111\quad 1111\quad0000\quad0000$ $1111 \quad 0000\quad1111\quad0000$ $1111 \quad 0001\quad0011\quad0101$ $1010\quad1010\quad1010\quad1010$
The above circuit produces the output sequence:$1111\quad 1111\quad0000\quad0000$$1111 \quad 0000\quad1111\quad0000$$1111 \quad 0001\quad0011\quad0101$$1010\quad1010\quad...