Register
Filter

Questions by Bikram

1.8k
views
2 answers
1 votes
Test by Bikram | Mock GATE | Test 1 | Question: 40
The head of a moving head disk with $100$ tracks numbered $0$ to $99$ is serving a request at track $x$ ... , then total head movements are $194$. The track $x$ initially served was at ________.
799
views
2 answers
1 votes
Test by Bikram | Mock GATE | Test 1 | Question: 39
Consider the following matrix:$\left [ A \right ]=$ $\begin{bmatrix} 1.5&0 &1 \\ -0.5 & 0.5& -0.5\\ -0.5& 0 & 0 \end{bmatrix}$The eigen values of the above matrix are:$-0.5, 0.5, 1.5$0.5, 0.5, 1$1.75, -1, 0.5$-0.5, 0.5, -1$
551
views
1 answers
2 votes
Test by Bikram | Mock GATE | Test 1 | Question: 38
A radix sort is to be used to sort the file of non-negative integers shown below into ascending order. What would the order of the numbers be after one pass of the algorithm?$12$ $37$ $42$ ... $42$ $92$ $5$ $45$ $7$ $37$ $9$
1.1k
views
3 answers
2 votes
Test by Bikram | Mock GATE | Test 1 | Question: 37
A pulse train with a frequency of $1$ $MHz$ is counted using a modulo $1024$ ripple counter built with $J-K$ flip flops. For proper operation of the counter, the ... $100 \: nsec$1000 \: nsec$100 \: microsec$
1.3k
views
4 answers
2 votes
Test by Bikram | Mock GATE | Test 1 | Question: 36
A pipeline system is affected by branch instruction. The penalty for the branch instruction is $3$ stall cycle, if $33\%$ of instruction is branch instruction and ... the speed up factor $8$, then the number of stage in pipeline is _______
354
views
1 answers
1 votes
Test by Bikram | Mock GATE | Test 1 | Question: 35
What will be the resulting grammar after removal of left-recursion from the following grammar?$E$ $\rightarrow$ $Ea $|$ Eb $|$ a $|$ b$E$\rightarrow$ $aE'$|$ bE'$ ; $E$ ... $aE' $|$ bE'$; $E'$ $\rightarrow$ $a$ | $b$ $|$ $\epsilon$
431
views
1 answers
0 votes
Test by Bikram | Mock GATE | Test 1 | Question: 34
Consider the following grammar for Boolean expression:$E$ $\rightarrow$ $E$ OR $E$E$ $\rightarrow$ $E$ AND$E$E$ $\rightarrow$ NOT $E$E$ $\rightarrow$ $\left ( E \right ) ... $\left ( A \right )$ and $\left ( C \right )$
676
views
1 answers
0 votes
Test by Bikram | Mock GATE | Test 1 | Question: 32
Let $f\left ( n \right )$m $g\left ( n \right )$ and $h\left ( n \right )$ ... only$(c)$ $only$(b)$ $and$ $(d)$ $only$(b)$ $and$ $(c)$ $only$
1.2k
views
1 answers
2 votes
Test by Bikram | Mock GATE | Test 1 | Question: 32
Fill in the blanks in the procedure:void Prod (Element Type X, Priority Queue H) { int i; if (IsFull(H)) { Error ("Priority queue is full"); return; } for (i=++H - ... 2]$;$H$\rightarrow$ Elements $[i^2 ]=X;$H$\rightarrow$ Elements $[i]=X;$
495
views
2 answers
2 votes
Test by Bikram | Mock GATE | Test 1 | Question: 31
The value of following Boolean expression:$a\left ( a+b+c \right )$\left ( \overline a+b+\overline c \right )$\left ( a+b+\overline c \right )$\left ( \overline a+\overline bc\right )$a(a+b)$\overline a$( \overline a+b)$0$
842
views
3 answers
1 votes
Test by Bikram | Mock GATE | Test 1 | Question: 30
A computer has a cache, main memory, and a disk used for virtual memory. If a referenced word is in the cache, $10$ $ns$ are required to access it. If it is ... $ $ns$485750$ $ns$500012$ $ns$23009$ $ns$
1.4k
views
1 answers
0 votes
Test by Bikram | Mock GATE | Test 1 | Question: 29
Let $R$ ... relation a reflexive and symmetric relation an equivalence relation a partial ordering relation
488
views
3 answers
1 votes
Test by Bikram | Mock GATE | Test 1 | Question: 28
Find True $\left ( T \right )$ or False $\left ( F \right )$of the following statements :If $A$ is recursive then complement of $A$ is also recursiveIf $A$ and $B$ are recursive ... vice-versa $TTT$ $TFT$ $TFF$ $FFT$
411
views
1 answers
0 votes
Test by Bikram | Mock GATE | Test 1 | Question: 27
Consider the following algorithm:ORDER (T) begin if (T!=NULL) then begin ORDER (LPTR(T)) PRINT (DATA(T)) ORDER (RPTR(T)) end return end where LPTR: left ... the tree in post-order in a recursive manner Do not Traverse the tree at all
1.1k
views
3 answers
3 votes
Test by Bikram | Mock GATE | Test 1 | Question: 26
Suppose we have a block-addressable disk drive. With such block organized disk non data overhead of subblocks and, interblock gaps have to be accounted for.There ... file. A block is organized to hold an integral number of logical records.
1.3k
views
2 answers
3 votes
Test by Bikram | Mock GATE | Test 1 | Question: 25
Which of the following is true? Blind writes appear in any view serializable schedule that is not conflict serializable. Blind writes appear in some view ... schedule that is not view serializable.II and IIIII and IVI onlyI and II
915
views
3 answers
2 votes
Test by Bikram | Mock GATE | Test 1 | Question: 24
The internet host is roughly doubling in size every $18$ $months$. Although no one really knows for sure, one estimate put the number of hosts on it at ... these data the expected number of internet hosts in January $2008$ is _____ billion.
768
views
2 answers
2 votes
Test by Bikram | Mock GATE | Test 1 | Question: 23
Consider the relational schema S= {A,B,C,D} and the following functional dependencies on S:$A$\rightarrow BCD$B$\rightarrow C$CD$\rightarrow A$Which of the following is true?$ ... $ but not in $BCNF$S$ is in $BCNF$ but not in $4NF$
490
views
2 answers
1 votes
Test by Bikram | Mock GATE | Test 1 | Question: 22
For the Boolean equation $AB +$ $\sim AC$= 1$, $AC +B = 0$, the value of $A$, $B$ and $C$ will be:$0$, $0$,$1$1$,$1$,$0$0$,$1$,$0$1$,$0$,$0$
313
views
1 answers
0 votes
Test by Bikram | Mock GATE | Test 1 | Question: 21
Consider the languages given below.$L1 =$ {$a$^$n$ $b$^$m$ $c$^$m$ $d$^$n$ $|n >= 1$ and $m >= 1$}$L2 =$ {$a$^$n$ $b$^$n$ ... not $L3$, are context free Languages $L2, L3$ are context free but not $L1$ Only $L2$ is context free
Page: