Recent questions tagged tbb-mockgate-1 / GATE Overflow for GATE CSE

1 votes

1 answer

31

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

335 views

Bikram asked Jan 16, 2017

0 votes

1 answer

32

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

414 views

Bikram asked Jan 16, 2017

0 votes

1 answer

33

Test by Bikram | Mock GATE | Test 1 | Question: 32
Let $f\left ( n \right )$m $g\left ( n \right )$ and $h\left ( n \right )$ ... the above is/are incorrect? $(d)$ $only$ $(c)$ $only$ $(b)$ $and$ $(d)$ $only$ $(b)$ $and$ $(c)$ $only$

Let $f\left ( n \right )$m $g\left ( n \right )$ and $h\left ( n \right )$ be functions whose domain is a subset of positive integers such that $f\left ( n \right )= O\l...

Bikram

633 views

Bikram asked Jan 16, 2017

2 votes

1 answer

34

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.1k views

Bikram asked Jan 16, 2017

2 votes

2 answers

35

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

476 views

Bikram asked Jan 16, 2017

1 votes

3 answers

36

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

785 views

Bikram asked Jan 16, 2017

0 votes

1 answer

37

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.3k views

Bikram asked Jan 16, 2017

1 votes

3 answers

38

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

451 views

Bikram asked Jan 16, 2017

0 votes

1 answer

39

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

384 views

Bikram asked Jan 16, 2017

3 votes

3 answers

40

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

2 votes

3 answers

41

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 $7$ million in January $1996$. Using these data the expected number of internet hosts in January $2008$ is _____ billion.

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 $7$ million in Jan...

Bikram

865 views

Bikram asked Jan 16, 2017

3 votes

2 answers

42

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.2k views

Bikram asked Jan 16, 2017

2 votes

2 answers

43

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

719 views

Bikram asked Jan 16, 2017

1 votes

2 answers

44

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

460 views

Bikram asked Jan 16, 2017

0 votes

1 answer

45

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

295 views

Bikram asked Jan 16, 2017

2 votes

2 answers

46

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

614 views

Bikram asked Jan 16, 2017

1 votes

2 answers

47

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

795 views

Bikram asked Jan 16, 2017

8 votes

3 answers

48

Test by Bikram | Mock GATE | Test 1 | Question: 18
Which of the following is not a Boolean algebra under the operation '\'? \: is a divisor, $D_{p}$: divisor of $p$ $\left \{ D18; \ \right \}$ $\left \{ D21; \ \right \}$ $\left \{ D110; \ \right \}$ $\left \{ D91; \ \right \}$

Which of the following is not a Boolean algebra under the operation '\'? \: is a divisor, $D_{p}$: divisor of $p$$\left \{ D18; \ \right \}$$\left \{ D21; \ \right \}$$...

Bikram

1.9k views

Bikram asked Jan 16, 2017

2 votes

1 answer

49

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

561 views

Bikram asked Jan 16, 2017

4 votes

2 answers

50

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

888 views

Bikram asked Jan 16, 2017

0 votes

1 answer

51

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

361 views

Bikram asked Jan 16, 2017

1 votes

1 answer

52

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

539 views

Bikram asked Jan 16, 2017

1 votes

1 answer

53

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

395 views

Bikram asked Jan 16, 2017

5 votes

1 answer

54

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

898 views

Bikram asked Jan 16, 2017

4 votes

2 answers

55

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.4k views

Bikram asked Jan 16, 2017

0 votes

2 answers

56

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

698 views

Bikram asked Jan 16, 2017

8 votes

2 answers

57

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

8 votes

2 answers

58

Test by Bikram | Mock GATE | Test 1 | Question: 8
Consider the schedule given below. $T_1$ and $T_2$ are two transactions operating on two resources $x$ and $y.$ ... The given schedule is A serializable schedule A non-serializable schedule A dead lock situation Both non-serializable and deadlock schedule

Consider the schedule given below. $T_1$ and $T_2$ are two transactions operating on two resources $x$ and $y.$$$\begin{array}{|c|c|c|} \hline \bf{T_1} & \bf{T_2} \\ \hli...

Bikram

1.3k views

Bikram asked Jan 16, 2017

0 votes

1 answer

59

Test by Bikram | Mock GATE | Test 1 | Question: 7
A shift reduced parser carries out the actions specified within braces Immediately after reducing with the corresponding rule of grammar. S --> xxW (print 'a') S --> Y (print'b') W --> Sz ... is the translation of $xxxxyzz$ using the syntax directed translation scheme described by the above rules. bcaca aabcc aabca ccbaa

A shift reduced parser carries out the actions specified within braces Immediately after reducing with the corresponding rule of grammar.S xxW (print 'a') S Y (print'...

Bikram

775 views

Bikram asked Jan 16, 2017

5 votes

3 answers

60

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

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