Recent questions in Exam Queries / GATE Overflow for GATE CSE

4 votes

1 answer

1501

Test by Bikram | Mock GATE | Test 1 | Question: 41
A file has $2^{29}$ records each of size 8B. One block of main memory is $128B$. Sparse indexing is done with one index record per memory block and one index record is of $1$ $Byte$. The blocks stored by the ... stored in disk. Blocks occupied by index are searched using binary search technique. Maximum number of blocks need to be read is _____.

A file has $2^{29}$ records each of size 8B. One block of main memory is $128B$. Sparse indexing is done with one index record per memory block and one index record is o...

Bikram

1.4k views

Bikram asked Jan 16, 2017

2 votes

1 answer

1502

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$ $9$ $5$ $7$ $50$ $40$ $45$ $92$ $12$ $37$ $42$ $40$ $45$ $5$ $50$ $7$ ... $12$ $42$ $92$ $5$ $45$ $37$ $7$ $9$ $40$ $50$ $12$ $42$ $92$ $5$ $45$ $7$ $37$ $9$

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 algori...

Bikram

533 views

Bikram asked Jan 16, 2017

1 votes

2 answers

1503

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$

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...

Bikram

765 views

Bikram asked Jan 16, 2017

2 votes

4 answers

1504

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 pipeline is operated with a clock of $10$ $ns$ and providing the speed up factor $8$, then the number of stage in pipeline is _______

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 pipelin...

Bikram

1.3k views

Bikram asked Jan 16, 2017

2 votes

3 answers

1505

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 maximum permissible propagation delay per flip flop stage is: $10 \: nsec$ $100 \: nsec$ $1000 \: nsec$ $100 \: microsec$

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 maximum ...

Bikram

1.0k views

Bikram asked Jan 16, 2017

0 votes

1 answer

1506

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 )$ $E$ $\rightarrow$ TRUE $E$\rightarrow$ FALSE $E$ $\ ... grammar is Ambiguous Non-ambiguous $LL$ $\left ( 1 \right )$ Both$\left ( A \right )$ and $\left ( C \right )$

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...

Bikram

419 views

Bikram asked Jan 16, 2017

1 votes

1 answer

1507

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'$ ; ...

Bikram

343 views

Bikram asked Jan 16, 2017

2 votes

1 answer

1508

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 -> size; H -> Elements [i/2]>X; i/=2) _________________ } ... 2]=H$\rightarrow$ Elements $[i/2]$; $H$\rightarrow$ Elements $[i^2 ]=X;$ $H$\rightarrow$ Elements $[i]=X;$

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 - size; ...

Bikram

1.2k views

Bikram asked Jan 16, 2017

2 votes

2 answers

1509

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$

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+\ove...

Bikram

480 views

Bikram asked Jan 16, 2017

1 votes

3 answers

1510

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 main memory but not in the cache, total $200$ $ns$ are needed to load it ... is found in the given level of the memory hierarchy. $732000$ $ns$ $485750$ $ns$ $500012$ $ns$ $23009$ $ns$

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 main memory b...

Bikram

800 views

Bikram asked Jan 16, 2017

0 votes

1 answer

1511

Test by Bikram | Mock GATE | Test 1 | Question: 29
Let $R$ be a binary relation on the set of all positive integers such that $R = \{ (a, b) \mid a - b \text{ is an odd positive integer} \}$ $R$ is : an anti-symmetric relation a reflexive and symmetric relation an equivalence relation a partial ordering relation

Let $R$ be a binary relation on the set of all positive integers such that $R = \{ (a, b) \mid a - b \text{ is an odd positive integer} \}$$R$ is :an anti-symmetric relat...

Bikram

1.4k views

Bikram asked Jan 16, 2017

1 votes

3 answers

1512

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 recursive If $A$ and $B$ are recursive sets then $A$ intersection $B$ is not always is recursive set. Every recursive set is recursive enumerable and vice-versa $TTT$ $TFT$ $TFF$ $FFT$

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 re...

Bikram

457 views

Bikram asked Jan 16, 2017

0 votes

1 answer

1513

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 pointer RPTR: right pointer T: given tree This above algorithm is used ... in in-order, in a recursive manner Traverse the tree in post-order in a recursive manner Do not Traverse the tree at all

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 pointer RPTR: rig...

Bikram

393 views

Bikram asked Jan 16, 2017

3 votes

3 answers

1514

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 are $40,000$ bytes per track and the amount of space taken up by subblocks ... to the stored in each block in a file. A block is organized to hold an integral number of logical records.

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 are $40,...

Bikram

1.0k views

Bikram asked Jan 16, 2017

3 votes

2 answers

1515

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 serializable schedule that is also conflict serializable. Blind writes appear in all view ... in conflict serializable schedule that is not view serializable. II and III II and IV I only I and II

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 serializable...

Bikram

1.3k views

Bikram asked Jan 16, 2017

1 votes

2 answers

1516

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$

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$

Bikram

470 views

Bikram asked Jan 16, 2017

2 votes

2 answers

1517

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? $S$ is in $3NF$ and also in $BCNF$ $S$ is in $2NF$ not in $3NF$ $S$ is in $3NF$ but not in $BCNF$ $S$ is in $BCNF$ but not in $4NF$

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 followin...

Bikram

741 views

Bikram asked Jan 16, 2017

0 votes

1 answer

1518

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$ $|n >= 1$} $L3 =$ {$a$^$n$ $b$^$n$ $c$^$n$ $|n>=0$ } ... $L3$ are context Free languages $L1, L2$ are but not $L3$, are context free Languages $L2, L3$ are context free but not $L1$ Only $L2$ is context free

Consider the languages given below.$L1 =$ {$a$^$n$ $b$^$m$ $c$^$m$ $d$^$n$ $|n >= 1$ and $m >= 1$}$L2 =$ {$a$^$n$ $b$^$n$ $|n >= 1$}$L3 =$ {$a$^$n$ $b$^$n$ $c$^$n$ $|n>=0...

Bikram

300 views

Bikram asked Jan 16, 2017

2 votes

2 answers

1519

Test by Bikram | Mock GATE | Test 1 | Question: 20
In a $32$ bit machine to execute an instruction the following steps are carried out: Fetch, Decode, Execute and Store, each of which takes one clock period. In a pipelined execution of a four-step task a new instruction is read and ... of pipeline processing system over an equivalent non-pipeline processing system? $3.88$ $1.88$ $3.68$ $2.723$

In a $32$ bit machine to execute an instruction the following steps are carried out: Fetch, Decode, Execute and Store, each of which takes one clock period. In a pipeline...

Bikram

625 views

Bikram asked Jan 16, 2017

1 votes

2 answers

1520

Test by Bikram | Mock GATE | Test 1 | Question: 19
Consider the following $SQ$L query: With max_balance(value) as Select max(balance) from account; The result of executing the above query is: $A$ temporary table is created with the name $max$_$balance$ $A$ temporary view is created with ... view is created with the name $max$_$balance$ $A$ permanent table is created with the name $max$_$balance$

Consider the following $SQ$L query:With max_balance(value) as Select max(balance) from account;The result of executing the above query is:$A$ temporary table is created w...

Bikram

815 views

Bikram asked Jan 16, 2017

tags	tag:apple
author	user:martin
title	title:apple
content	content:apple
exclude	-tag:apple
force match	+apple
views	views:100
score	score:10
answers	answers:2
is accepted	isaccepted:true
is closed	isclosed:true