Questions by Bikram / GATE Overflow for GATE CSE

0 votes

1 answer

201

Test by Bikram | Mock GATE | Test 4 | Question: 45
Consider the following code snippet: #include <stdio.h> void s1(int*, int); void s2(int*, int); void (*k[2])(int*, int); int main() { int a = 4; int b = 2; k[0] = s1; k[1] = s2; k[0](&a, b); printf("%d %d ", a, ... void s2(int *k, int q) { int tmp = *k; *k = q; q = tmp; } The output of the above program is : 4242 2222 4444 2424

Consider the following code snippet:#include <stdio.h void s1(int*, int); void s2(int*, int); void (*k )(int*, int); int main() { int a = 4; int b = 2; k[0] = s1; k = s2...

430 views

asked May 14, 2017

1 votes

1 answer

202

Test by Bikram | Mock GATE | Test 4 | Question: 44
Which of the following regular expressions describes the same set of strings as $\left ( a^*+b \right )^*$ $\left ( c+d \right )$? $a^{\ast }\left ( c+d \right )^{\ast } + b$ $\left ( a^{\ast }+b \right )c + \left ( a+b \right )d$ ... $a^{\ast }\left ( c+d \right )+ b^{\ast }\left ( c+d \right )$

Which of the following regular expressions describes the same set of strings as $\left ( a^*+b \right )^*$ $\left ( c+d \right )$? $a^{\ast }\left ( c+d \right )^{\ast...

215 views

asked May 14, 2017

5 votes

1 answer

203

Test by Bikram | Mock GATE | Test 4 | Question: 43
Consider the $C$ program given below: #include <stdio.h> main () { printf("This is GO mock exam\n" ); } The total number of tokens generated when this program is passed to lexical analyzer is :______.

Consider the $C$ program given below:#include <stdio.h main () { printf("This is GO mock exam\n" ); }The total number of tokens generated when this program is passed to l...

604 views

asked May 14, 2017

2 votes

1 answer

204

Test by Bikram | Mock GATE | Test 4 | Question: 42
Let $Z$ consist of all the binary strings beginning with a $1$ whose value when converted to decimal is divisible by $7$. Which of the below statements is correct? $B$ can be recognized by a non-deterministic ... a deterministic push-down automaton. $B$ cannot be recognized by any push down automaton- neither deterministic nor non-deterministic.

Let $Z$ consist of all the binary strings beginning with a $1$ whose value when converted to decimal is divisible by $7$.Which of the below statements is correct?$B$ can ...

344 views

asked May 14, 2017

2 votes

1 answer

205

Test by Bikram | Mock GATE | Test 4 | Question: 41
Read the following grammars and their translations: $S\rightarrow xX\;\left \{ print ``0" \right \}$ $X\rightarrow zZ\;\left \{ print ``1" \right \}$ $X\rightarrow y\;\left \{ print ``2" \right \}$ ... for the input string $xzpzpy$ using Bottom-Up Parsing (with the above translations)? $0111012$ $0111-20$ $0211-10$ $011112$

Read the following grammars and their translations:$S\rightarrow xX\;\left \{ print 0" \right \}$$X\rightarrow zZ\;\left \{ print 1" \right \}$$X\rightarrow y\;\left ...

357 views

asked May 14, 2017

5 votes

1 answer

206

Test by Bikram | Mock GATE | Test 4 | Question: 40
Consider the below program : #include <stdio.h> void fun (int[0][3]); int main(void) { int k[3][3]= {{1,2,3}, {4,5,6},{7,8,9}}; fun(k); printf("%d\n", k[2][1]); return 0; } void fun(int p[][3]) { ++p; p[1][1] = 9; } The output of the above program is : ______.

Consider the below program : #include <stdio.h void fun (int[0][3]); int main(void) { int k[3][3]= {{1,2,3}, {4,5,6},{7,8,9}}; fun(k); printf("%d\n", k ); return 0; } vo...

406 views

asked May 14, 2017

3 votes

1 answer

207

Test by Bikram | Mock GATE | Test 4 | Question: 39
A microprogrammed control unit supports $300$ instructions. Each instruction takes $15$ micro operations, $12$ flags are supported and $40$ vertical microprogrammed control signals are used. Then, the size of $6$ control words is ______ bytes.

A microprogrammed control unit supports $300$ instructions. Each instruction takes $15$ micro operations, $12$ flags are supported and $40$ vertical microprogrammed contr...

920 views

asked May 14, 2017

1 votes

1 answer

208

Test by Bikram | Mock GATE | Test 4 | Question: 38
In a height balanced binary search tree, the heights of the left and right descendants of any node differ at most by $1.$ Which of the following statements are TRUE for such kind of tree? Worst case search time is logarithmic in the number of nodes. ... is logarithmic in the number of nodes. II and IV only I, II and IV I and III only I, III and IV

In a height balanced binary search tree, the heights of the left and right descendants of any node differ at most by $1.$ Which of the following statements are TRUE for s...

434 views

asked May 14, 2017

0 votes

1 answer

209

Test by Bikram | Mock GATE | Test 4 | Question: 37
A relation $R = \left \{ \left ( x,y \right ) \mid x,y\in N, x=7-y \right \}$ Here, $R$ is: Symmetric and Reflexive, but not Transitive. Symmetric, Reflexive and Transitive. Only Symmetric, but neither Reflexive nor Transitive. Neither Symmetric, Reflexive nor Transitive.

A relation $R = \left \{ \left ( x,y \right ) \mid x,y\in N, x=7-y \right \}$Here, $R$ is: Symmetric and Reflexive, but not Transitive. Symmetric, Reflexive and Transit...

300 views

asked May 14, 2017

1 votes

1 answer

210

Test by Bikram | Mock GATE | Test 4 | Question: 36
Which of the following statements is/are CORRECT? $S_1$: Max term is a sum term which contains all the variables in either direct or complementary form. $S_2$: Min term is a product term which contains all the variables in either direct or ... $S_3$ is correct only $S_2$ is correct All $S_1$, $S_2$ and $S_3$ are correct

Which of the following statements is/are CORRECT?$S_1$: Max term is a sum term which contains all the variables in either direct or complementary form.$S_2$: Min term is ...

461 views

asked May 14, 2017

2 votes

0 answers

211

Test by Bikram | Mock GATE | Test 4 | Question: 35
Let $DM$ be a single-tape, Deterministic Turing machine with tape alphabet $\left \{ blank,0,1 \right \}$, and let $C_i$ denote the (possibly infinite) computation of $DM$ starting with a blank tape. The input to each problem below is ... $k$ distinct tape squares during the computation $C_i.$ III only I and III only II and III only I, II, and III

Let $DM$ be a single-tape, Deterministic Turing machine with tape alphabet $\left \{ blank,0,1 \right \}$, and let $C_i$ denote the (possibly infinite) computation of $DM...

501 views

asked May 14, 2017

3 votes

2 answers

212

Test by Bikram | Mock GATE | Test 4 | Question: 34
The bandwidth of a $TCP$ connection is $1048560$ $bits/s$. Let $a$ be the value of $RTT$ in milliseconds, after which $TCP$ window scale option is required. Let $b$ be the maximum possible window size (with window scale option). Then, the value of $a$ ... $65535 \times 2^{14}$ $500$ and $65535 \times 2^{16}$ $500$ and $65535 \times 2^{14}$

The bandwidth of a $TCP$ connection is $1048560$ $bits/s$. Let $a$ be the value of $RTT$ in milliseconds, after which $TCP$ window scale option is required. Let $b$ be th...

668 views

asked May 14, 2017

2 votes

3 answers

213

Test by Bikram | Mock GATE | Test 4 | Question: 33
A router receives an $IP$ packet containing $400$ data bytes and forwards that packet in a network where maximum transmission unit is $100$ bytes. If the $\text{IP}$ header is $15$ bytes long, then the number of fragments required is ______.

A router receives an $IP$ packet containing $400$ data bytes and forwards that packet in a network where maximum transmission unit is $100$ bytes. If the $\text{IP}$ head...

440 views

asked May 14, 2017

0 votes

1 answer

214

Test by Bikram | Mock GATE | Test 4 | Question: 32
$A\left [ 0 \right ] \dots A\left [ 4 \right ]$ is an array of mutexes (binary semaphores) and $B\left [ 0 \right ] \dots B\left [ 4 \right ]$ is an array of processes. If each process $B\left [ i \right ]$ ... .... release (A[i]); release (A[(i+1)mod4]); This could result in __________. Thrashing Progress Starvation, but not deadlock. Deadlock

$A\left [ 0 \right ] \dots A\left [ 4 \right ]$ is an array of mutexes (binary semaphores) and $B\left [ 0 \right ] \dots B\left [ 4 \right ]$ is an array of processes.I...

283 views

asked May 14, 2017

1 votes

1 answer

215

Test by Bikram | Mock GATE | Test 4 | Question: 31
An $m-ary$ tree is a tree in which every node has at most $m$ children. In an $m-ary$ tree with $p$ nodes and height $l$ $($starting from $0)$, which of the following is the tightest upper bound for the maximum number of leaves as a function of $l$, $m$, and $p$? $\lg m \times p$ $\lg m \times l \times \lg p$ $l^m$ $m^l$

An $m-ary$ tree is a tree in which every node has at most $m$ children. In an $m-ary$ tree with $p$ nodes and height $l$ $($starting from $0)$, which of the following is ...

388 views

asked May 14, 2017

3 votes

1 answer

216

Test by Bikram | Mock GATE | Test 4 | Question: 30
Consider the following statements: $S_1$: An increase in the number of page frames allotted to a process always increases the page fault rate in $\text{FIFO}$ page replacement policy, regardless of the page reference sequence $S_2$: It is not ... statements is/are CORRECT? Only $S_1$ Only $S_2$ Both $S_1$ and $S_2$ Neither $S_1$ nor $S_2$

Consider the following statements:$S_1$: An increase in the number of page frames allotted to a process always increases the page fault rate in $\text{FIFO}$ page replace...

688 views

asked May 14, 2017

0 votes

2 answers

217

Test by Bikram | Mock GATE | Test 4 | Question: 29
The value of $ f + g $ in the above circuit is: $x{}'y + x{}'z + yz + yz{}'$ $x{}'y + x{}'z + y{}'z'+ y{}'z$ $x{}'y + y{}'z{}' + yz + x{}'z$ $xy + y{}'z{}'+ x{}'z + yz$

The value of $ f + g $ in the above circuit is:$x{}'y + x{}'z + yz + yz{}'$$x{}'y + x{}'z + y{}'z'+ y{}'z$$x{}'y + y{}'z{}' + yz + x{}'z$$xy + y{}'z{}'+ x{}'z + yz$

449 views

asked May 14, 2017

1 votes

1 answer

218

Test by Bikram | Mock GATE | Test 4 | Question: 28
There is an $RISC$ processor which uses pipeline technique. Within the processor, all the arithmetic instructions have the same $CPI$ (cycles per instruction). Which of the following actions would improve the execution time of an arithmetically ... and the data cache without changing the clock cycle time. II only I and III III only I and II

There is an $RISC$ processor which uses pipeline technique. Within the processor, all the arithmetic instructions have the same $CPI$ (cycles per instruction).Which of th...

506 views

asked May 14, 2017

1 votes

1 answer

219

Test by Bikram | Mock GATE | Test 4 | Question: 27
Which among the following statements is NOT correct ? Packets sent on Ethernets are limited in size. Networks connected by Ethernets are limited in length to a few hundred meters. Ethernets use buses with multiple masters. Ethernets use circuit switching to send messages.

Which among the following statements is NOT correct ? Packets sent on Ethernets are limited in size. Networks connected by Ethernets are limited in length to a few hu...

389 views

asked May 14, 2017

4 votes

1 answer

220

Test by Bikram | Mock GATE | Test 4 | Question: 26
Consider the languages $A$ and $B$, each over the alphabet set $\left \{ a,b \right \}$. Here, $B=\{ w \mid w$ contains some $x \in A$ as a sub-string $\}.$ Which of the following is TRUE about $A$ and $B$? If $A$ is regular, ... then $B$ is recursive. If $A$ is context-free, then $B$ is context-free. II only II and III I and III only I, II and III

Consider the languages $A$ and $B$, each over the alphabet set $\left \{ a,b \right \}$.Here, $B=\{ w \mid w$ contains some $x \in A$ as a sub-string $\}.$Which of the f...

711 views

asked May 14, 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