Recent questions in GATE / GATE Overflow for GATE CSE

1 votes

2 answers

481

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

482

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

483

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

484

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

485

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

2 votes

1 answer

486

Test by Bikram | Mock GATE | Test 1 | Question: 17
Suppose there are five processes in the ready queue as shown below: ... the minimum? Assume lower integer indicates higher priority and all the processes arrive at time zero. FCFS Priority scheduling SJF both FCFS and SJF

Suppose there are five processes in the ready queue as shown below:$$\begin{array}{|c|c|c|} \hline i & T(Pi) & \text{Priority} \\ \hline 0 & 350 & 5 \\ \hline 1 & 125 & ...

Bikram

575 views

Bikram asked Jan 16, 2017

0 votes

1 answer

487

Test by Bikram | Mock GATE | Test 1 | Question: 15
Let $R1, R2, R3$ be reader processes and let $W1$ and $W2$ be writer processes requesting shared data. If $R1$ is selected for access. Which of the statement is/are correct? Mutual exclusion is necessary for $R2$ and $R3$ No mutual exclusion is necessary for $R2$ ... $(iii)$ only $(ii)$ and $(iii)$ only $(iv)$ and $(iii)$ only $(i)$ and $(iv)$ only

Let $R1, R2, R3$ be reader processes and let $W1$ and $W2$ be writer processes requesting shared data. If $R1$ is selected for access. Which of the statement is/are corr...

Bikram

369 views

Bikram asked Jan 16, 2017

4 votes

2 answers

488

Test by Bikram | Mock GATE | Test 1 | Question: 16
Hash a list of $3$ keys into hash table with $20$ locations. What will be the probability of the event $A$ in which hashing the three keys causes a collision? $0.123$ $0.145$ $0.800$ $0.750$

Hash a list of $3$ keys into hash table with $20$ locations. What will be the probability of the event $A$ in which hashing the three keys causes a collision?$0.123$$0.14...

Bikram

896 views

Bikram asked Jan 16, 2017

1 votes

1 answer

489

Test by Bikram | Mock GATE | Test 1 | Question: 14
Match the following $List I$ with $List II$ : $W(x)$: $x$ is a worker $A(x)$: $x$ likes Anand List -I a. No worker like Anand b. Some worker like Anand c. If someone s a worker, he likes Anand List II p. $\sim$\forall x$[ $W(x)$ $\rightarrow$ $\sim$A(x) ]$ ... $]$ $a-r, b-q, c-p$ $a-p, b-q, c-r$ $a-r, b-p, c-q$ $a-q, b-p, c-r$

Match the following $List I$ with $List II$ :$W(x)$: $x$ is a worker$A(x)$: $x$ likes AnandList -Ia. No worker like Anand b. Some worker lik...

Bikram

547 views

Bikram asked Jan 16, 2017

5 votes

1 answer

490

Test by Bikram | Mock GATE | Test 1 | Question: 12
Which of the following should be allowed only in Kernel mode? Changing mapping from virtual to physical address Mask and unmask interrupts Disabling all interrupts Reading processor status register Receive a packet of data from the network Cause a trap $(i)$, $(ii)$ , $(iii)$ ... $(vi)$ $(i)$, $(ii)$, $(iii)$, $(iv)$, $(v)$ and $(vi)$

Which of the following should be allowed only in Kernel mode? Changing mapping from virtual to physical address Mask and unmask interrupts Disabling all interrupts Readin...

Bikram

914 views

Bikram asked Jan 16, 2017

1 votes

1 answer

491

Test by Bikram | Mock GATE | Test 1 | Question: 13
Match the following: List I List II A Backus Naur form 1 Regular expression B Lex 2 $\left ( I \right )$LALR$ C Yacc 3 $LL$\left ( 1 \right )$ D Recursive descent parsing 4 $CFG's$ ... $A-4; \: B-1 \: ; C-2; \: D-3;$ $A-1; \: B-4; \:C-2; \: D-3;$

Match the following:List IList IIABackus Naur form 1Regular expressionBLex2$\left ( I \right )$$LALR$CYacc3$LL$$\left ( 1 \right )$DRecursive descent parsing 4$CFG's$ $...

Bikram

399 views

Bikram asked Jan 16, 2017

4 votes

2 answers

492

Test by Bikram | Mock GATE | Test 1 | Question: 11
Consider following recursive functions: function fib(n : integer); integer begin if (n = 0) or (n = 1) then fib = 1 else fib = fib(n-l) + fib(n-2) end The above function is run on a computer with a stack of $x$ ... we can execute this function for maximum value $n = 10$ without overflowing the stack. Then the size of the stack is ______ $Bytes$.

Consider following recursive functions:function fib(n : integer); integer begin if (n = 0) or (n = 1) then fib = 1 else fib = fib(n-l) + fib(n-2) endThe above function is...

Bikram

1.5k views

Bikram asked Jan 16, 2017

8 votes

2 answers

493

Test by Bikram | Mock GATE | Test 1 | Question: 9
Consider the following program fragment : int foo(int ,int ); int a; int ar[4] = { 1,0, 2,3}; main() { a = 0; foo(ar[a], ar[ar[a]]); printf("%d,%d ,%d,%d ", ar[0] , ar[1] ,ar[2] , ar[3]); } foo(int x, int y) { x= x+1; y ... be printed by the program if parameter passed by call by name? $1, 50, 2, 3$ $3, 50, 2, 3$ $3, 50, 3, 4$ $3, 2, 2, 3$

Consider the following program fragment :int foo(int ,int ); int a; int ar[4] = { 1,0, 2,3}; main() { a = 0; foo(ar[a], ar[ar[a]]); printf("%d,%d ,%d,%d ", ar[0] , ar ,a...

Bikram

1.7k views

Bikram asked Jan 16, 2017

0 votes

2 answers

494

Test by Bikram | Mock GATE | Test 1 | Question: 10
Consider the following floating point format : 1 $<--8--> <--23-->$ S $| $ $E$ $|$ $M$ $|$ S: Sign bit E: Exponent M: Mantissa The value of floating point number in this system is, $V=$ $-I^{s}$x $2^{E-127}$ x $1.F$ Then what is the corresponding decimal value if the floating point stored is: $3F800000$ 0 1 -1 2

Consider the following floating point format : 1 $< 8 < 23 >$ S $| $ $E$ $|$ $M$ $|$S: Sign bitE: ExponentM: MantissaThe value of float...

Bikram

716 views

Bikram asked Jan 16, 2017

2 votes

1 answer

495

Test by Bikram | Mock GATE | Test 1 | Question: 5
Which of the following statements is $FALSE$ regarding a bridge: Bridge is a layer $2$ device Bridge reduces collision domain Bridge is used to connect two or more $LAN$ segments Bridge reduces broadcast domain

Which of the following statements is $FALSE$ regarding a bridge:Bridge is a layer $2$ deviceBridge reduces collision domainBridge is used to connect two or more $LAN$ seg...

Bikram

902 views

Bikram asked Jan 16, 2017

5 votes

3 answers

496

Test by Bikram | Mock GATE | Test 1 | Question: 6
What is the output of the following program? main( ) { int i=4, z=12; if( i=5 || z > 50) printf(“ Gate2017”); else printf(“ Gateoverflow”); } Gate2017 Gateoverflow syntax error Gate2017Gateoverflow

What is the output of the following program?main( ){int i=4, z=12;if( i=5 || z 50)printf(“ Gate2017”);elseprintf(“ Gateoverflow”);}Gate2017Gateoverflowsyntax err...

Bikram

1.0k views

Bikram asked Jan 16, 2017

1 votes

1 answer

497

Test by Bikram | Mock GATE | Test 1 | Question: 4
Which of the following statements is $TRUE$ about $CSMA/CD$: $IEEE$ $802.11$ wireless $LAN$ runs $CSMA/CD$ protocol Ethernet is not based on $CSMA/CD$ protocol $CSMA/CD$ is not suitable for a high propagation There is no contention in a $CSMA/CD$ network

Which of the following statements is $TRUE$ about $CSMA/CD$:$IEEE$ $802.11$ wireless $LAN$ runs $CSMA/CD$ protocolEthernet is not based on $CSMA/CD$ protocol$CSMA/CD$ is ...

Bikram

666 views

Bikram asked Jan 16, 2017

4 votes

2 answers

498

Test by Bikram | Mock GATE | Test 1 | Question: 3
Consider the Hasse diagram $D_1$ and $D_2$ as follows: $D_1:$ The Hasse diagram for the partial ordering $\left \{ \langle a, b \rangle \mid a \mod \: b=0 \right \}$ on the set of positive divisors of $24 \}$ $D_2:$ The Hasse diagram for ... $D_1$ and $D_2$ is/are a total ordering? Only $D_1$ Only $D_2$ Both $D_1$ & $D_2$ None $D_1$ & $D_2$

Consider the Hasse diagram $D_1$ and $D_2$ as follows:$D_1:$ The Hasse diagram for the partial ordering $\left \{ \langle a, b \rangle \mid a \mod \: b=0 \right \}$ on th...

Bikram

714 views

Bikram asked Jan 16, 2017

1 votes

1 answer

499

Test by Bikram | Mock GATE | Test 1 | Question: 2
Find the output of the following program : #include <stdio.h> main () { int a, b; int v=3; int *pv; a = 2 * (v+5); pv = &v; b = 2*(*pv + 5); printf("\n a=%d b=%d " , a,b); } $a = 16$ , $b = 16$ $a = 16$ , $b = 32$ $a = 16$ , $b = 8$ $a = 16$ , $b = 64$

Find the output of the following program :#include <stdio.h main () { int a, b; int v=3; int *pv; a = 2 * (v+5); pv = &v; b = 2*(*pv + 5); printf("\n a=%d b=%d " , a,b); ...

Bikram

317 views

Bikram asked Jan 16, 2017

3 votes

1 answer

500

Test by Bikram | Mock GATE | Test 1 | Question: 1
There are "m" red balls and "n" green balls in a bucket. p balls are drawn from the urn and if found that all of them are green then what is the probability that another ball drawn from those remaining will also be green? Assume p < n p-n/m+n n-p/m+n-p p-m/m+n m-p/m+n-p

There are "m" red balls and "n" green balls in a bucket. p balls are drawn from the urn and if found that all of them are green then what is the probability that another ...

Bikram

462 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