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

2 votes

0 answers

31

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

Bikram

508 views

Bikram asked May 14, 2017

3 votes

2 answers

32

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

Bikram

675 views

Bikram asked May 14, 2017

2 votes

3 answers

33

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

Bikram

446 views

Bikram asked May 14, 2017

0 votes

1 answer

34

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

Bikram

291 views

Bikram asked May 14, 2017

1 votes

1 answer

35

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

Bikram

408 views

Bikram asked May 14, 2017

3 votes

1 answer

36

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

Bikram

691 views

Bikram asked May 14, 2017

0 votes

2 answers

37

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$

Bikram

472 views

Bikram asked May 14, 2017

1 votes

1 answer

38

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

Bikram

519 views

Bikram asked May 14, 2017

1 votes

1 answer

39

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

Bikram

410 views

Bikram asked May 14, 2017

4 votes

1 answer

40

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

Bikram

729 views

Bikram asked May 14, 2017

3 votes

1 answer

41

Test by Bikram | Mock GATE | Test 4 | Question: 25
The Eigen values of a $2 \times 2$ matrix $’A’$ are $1, -2$, and its Eigen vectors $x_1$ and $x_2$ respectively. The Eigen values and Eigen vectors of the matrix $A^{2} - 3A + 4I$ (where $I$ is the identity matrix) will be: $2,14$ and $ x_1,x_2$ $2,14$ and $x_1+x_2 , x_1- x_2$ $2,0$ and $x_1,x_2$ $2,0$ and $x_1+x_2, x_1- x_2$

The Eigen values of a $2 \times 2$ matrix $’A’$ are $1, -2$, and its Eigen vectors $x_1$ and $x_2$ respectively.The Eigen values and Eigen vectors of the matrix $A^{2...

Bikram

781 views

Bikram asked May 14, 2017

2 votes

1 answer

42

Test by Bikram | Mock GATE | Test 4 | Question: 24
An unsorted array has this property that every element in it is at most $d$ distance from its position in the sorted version of the array (where $d$ is a positive integer smaller than the size of the array). Which among the following algorithms is best suited to sort this array? Insertion Sort Quick Sort Heap Sort Merge Sort

An unsorted array has this property that every element in it is at most $d$ distance from its position in the sorted version of the array (where $d$ is a positive integer...

Bikram

630 views

Bikram asked May 14, 2017

0 votes

2 answers

43

Test by Bikram | Mock GATE | Test 4 | Question: 23
The definition of a language $N$ with alphabet set $\left \{ x \right \}$ is given below: $N= \{ x^{mp} \mid p > \: 0, \text{where m is a positive integer constant} \}$ The minimum number of states needed in a $\text{DFA}$ to recognize $N$ is _________. $p+m$ $p+1$ $m+1$ $2^\left ( p+1 \right )$

The definition of a language $N$ with alphabet set $\left \{ x \right \}$ is given below:$N= \{ x^{mp} \mid p \: 0, \text{where m is a positive integer constant} \}$The ...

Bikram

477 views

Bikram asked May 14, 2017

1 votes

1 answer

44

Test by Bikram | Mock GATE | Test 4 | Question: 22
What is the technique that allows one to execute a program which is not entirely in memory called? Demand Paging Auxiliary Memory Secondary Memory Virtual Memory

What is the technique that allows one to execute a program which is not entirely in memory called?Demand PagingAuxiliary MemorySecondary MemoryVirtual Memory

Bikram

452 views

Bikram asked May 14, 2017

1 votes

1 answer

45

Test by Bikram | Mock GATE | Test 4 | Question: 21
$\left ( G, . \right )$ is a group such that $\left ( x,y \right )^{-1} = x^{-1}y^{-1}, \forall \left ( x,y \right ) \in G$. Here, $G$ is a: Monoid Commutative semi group Abelian group Semi group

$\left ( G, . \right )$ is a group such that $\left ( x,y \right )^{-1} = x^{-1}y^{-1}, \forall \left ( x,y \right ) \in G$.Here, $G$ is a: Monoid Commutative semi group ...

Bikram

467 views

Bikram asked May 14, 2017

5 votes

1 answer

46

Test by Bikram | Mock GATE | Test 4 | Question: 20
Consider the $5\times 5$ matrix below : $\begin{bmatrix} 1&0 &0 &0 &1 \\ 0& 1 & 1 & 1 & 0\\ 0& 1 &1 &1 &0 \\ 0& 1 &1 &1 &0 \\ 1 & 0 & 0 & 0 & 1 \end{bmatrix}$ The product of the non-zero eigenvalues of the matrix is _____.

Consider the $5\times 5$ matrix below :$\begin{bmatrix} 1&0 &0 &0 &1 \\ 0& 1 & 1 & 1 & 0\\ 0& 1 &1 &1 &0 \\ 0& 1 &1 &1 &0 \\ 1 & 0 & 0 & 0 & 1 \end{bmatrix}$The product ...

Bikram

848 views

Bikram asked May 14, 2017

0 votes

1 answer

47

Test by Bikram | Mock GATE | Test 4 | Question: 19
An $Euler$ circuit of an undirected graph is a circuit in which each edge of the graph appears exactly once. Which of the following undirected graphs must have an $Euler$ circuit ? A complete graph with $12$ vertices A complete graph with $13$ vertices A tree with $13$ vertices I and II II only III only I and III

An $Euler$ circuit of an undirected graph is a circuit in which each edge of the graph appears exactly once. Which of the following undirected graphs must have an $Euler$...

Bikram

476 views

Bikram asked May 14, 2017

1 votes

1 answer

48

Test by Bikram | Mock GATE | Test 4 | Question: 18
Consider the below code snippet: #include<stdio.h> int main() { int p[15][20][29] = {0}; p[4][2][3] = 6; --------------- return 0; } Which of the following options will print $6$ when added in the missing part of the above code? printf(" ... **((p+4)+2)+3); printf("%d",*(*((p+4)+2)+3)); printf("%d",*(((p+4)+2)+3));

Consider the below code snippet:#include<stdio.h int main() { int p[15][20][29] = {0}; p[4] [3] = 6; - return 0; }Which of the following options will print $6$ when ad...

Bikram

316 views

Bikram asked May 14, 2017

4 votes

1 answer

49

Test by Bikram | Mock GATE | Test 4 | Question: 17
Let the set of all natural numbers be $N$. Which of the following are countable sets? The set of all functions from $N$ to $\{0, 1\}$ The set of all functions from $\{0, 1\}$ to $N$ The largest subset of $N$ I, II, and III I and II only II and III only I and III only

Let the set of all natural numbers be $N$. Which of the following are countable sets? The set of all functions from $N$ to $\{0, 1\}$ The set of all functions from $\{0,...

Bikram

461 views

Bikram asked May 14, 2017

3 votes

1 answer

50

Test by Bikram | Mock GATE | Test 4 | Question: 15
What is the worst case time complexity to calculate the depth of a directed acyclic graph (DAG) with ‘$V$’ vertices and ‘$E$’ edges? $O\left ( V+E \right )$ $O\left ( V \right )$ $O\left ( V^{2} +E \right )$ $O\left ( E\log V \right )$

What is the worst case time complexity to calculate the depth of a directed acyclic graph (DAG) with ‘$V$’ vertices and ‘$E$’ edges?$O\left ( V+E \right )$$O\left...

Bikram

319 views

Bikram asked May 14, 2017

5 votes

1 answer

51

Test by Bikram | Mock GATE | Test 4 | Question: 16
Consider a sorted array of $k+1$ elements, where the elements are first $k$ natural numbers $-\left \{ 1, 2, 3, 4, 5,\dots, k \right \}$ and any one of those $k$ numbers is repeated. The time complexity of best algorithm to find that repeated number is: $O\left ( k \right )$ $O\left ( k\log k \right )$ $O\left ( \log k \right )$ $O(1)$

Consider a sorted array of $k+1$ elements, where the elements are first $k$ natural numbers $-\left \{ 1, 2, 3, 4, 5,\dots, k \right \}$ and any one of those $k$ numbers ...

Bikram

587 views

Bikram asked May 14, 2017

2 votes

1 answer

52

Test by Bikram | Mock GATE | Test 4 | Question: 14
The worst case running time to search for an element in binary search tree with $2^{\log_2 n}$ elements is represented as $\Theta\left(n^{x \log_2 y}\right)$ . The value of $x$ + $y$ is _____.

The worst case running time to search for an element in binary search tree with $2^{\log_2 n}$ elements is represented as $\Theta\left(n^{x \log_2 y}\right)$ .The value o...

Bikram

760 views

Bikram asked May 14, 2017

0 votes

1 answer

53

Test by Bikram | Mock GATE | Test 4 | Question: 13
Consider an initially empty hash table of length $10$. Following set of keys are inserted using open addressing with hash function $h\left ( k \right )=k\mod 10$ and linear probing. $2$, $13$, $24$, $12$, $62$, $73$, $82$, $91$ The number of probes done while searching for element $82$ is __________.

Consider an initially empty hash table of length $10$. Following set of keys are inserted using open addressing with hash function $h\left ( k \right )=k\mod 10$ and line...

Bikram

409 views

Bikram asked May 14, 2017

2 votes

1 answer

54

Test by Bikram | Mock GATE | Test 4 | Question: 12
A machine has $24$ $bit$ instruction format. It has $32$ registers and each of which is $32$ $bits$ long. It needs to support $49$ instructions. Each instruction has two register operands and one immediate operand. If ... operand is signed integer represented in $2${}'$s$ complement form, the minimum value of immediate operand is _________.

A machine has $24$ $bit$ instruction format. It has $32$ registers and each of which is $32$ $bits$ long. It needs to support $49$ instructions. Each instruction has two ...

Bikram

451 views

Bikram asked May 14, 2017

1 votes

2 answers

55

Test by Bikram | Mock GATE | Test 4 | Question: 11
The number $0.085$ represented in $IEEE-754$ single-precision format will be: $0 01111011 01111100001010001111011$ $0 01111011 01011100001010001111011$ $0 01111011 01010100001010000111011$ $0 01111011 01111100001010001111011$

The number $0.085$ represented in $IEEE-754$ single-precision format will be: $0 01111011 01111100001010001111011$ $0 01111011 01011100001010001111011$ $0 01111011 010...

Bikram

592 views

Bikram asked May 14, 2017

4 votes

1 answer

56

Test by Bikram | Mock GATE | Test 4 | Question: 10
Consider the relation $R(X\;Y\;W\;M\;E\;G),$ with $FD$ set $\{XY \rightarrow W, E \rightarrow G, XW \rightarrow Y, YW \rightarrow X, Y \rightarrow M, XM \rightarrow E \}.$ Following are two decompositions ... are lossless-join decompositions. Both $P_1$ and $P_2$ are lossless-join decompositions. $P_1$ is lossless-join decomposition but not $P_2$.

Consider the relation $R(X\;Y\;W\;M\;E\;G),$with $FD$ set $\{XY \rightarrow W, E \rightarrow G, XW \rightarrow Y, YW \rightarrow X, Y \rightarrow M, XM \rightarrow E \}....

Bikram

762 views

Bikram asked May 14, 2017

2 votes

1 answer

57

Test by Bikram | Mock GATE | Test 4 | Question: 9
If $L$ is the set of all strings over $\{ x,y\}$ containing at least one $x$, then which of the following regular expressions does not generate $L$? $(x+y)^* x(y+y)^*$ $y^*x ( x+y)^*$ $( x+y)^* x$ $( x+y)^* xy^*$

If $L$ is the set of all strings over $\{ x,y\}$ containing at least one $x$, then which of the following regular expressions does not generate $L$?$(x+y)^* x(y+y)^*$$y^...

Bikram

404 views

Bikram asked May 14, 2017

2 votes

1 answer

58

Test by Bikram | Mock GATE | Test 4 | Question: 8
Consider an unweighted undirected graph connected with $n$' vertices and $m$' edges. What is the worst case time complexity to check if two particular vertices $x$' and $y$' are present in graph; and, if present, how is the minimum distance between them calculated? ... $O\left ( n \right )$ $O\left ( n\log n \right )$ $O\left ( n+m \right )$

Consider an unweighted undirected graph connected with ‘$n$’ vertices and ‘$m$’ edges.What is the worst case time complexity to check if two particular vertices �...

Bikram

1.2k views

Bikram asked May 14, 2017

2 votes

1 answer

59

Test by Bikram | Mock GATE | Test 4 | Question: 7
Consider the following statements: $S_1$: If a STACK is implemented through a LINKED LIST, $\text{PUSH}$ operation will take $O\left ( 1 \right )$ time and $\text{POP}$ operation will take $O\left ( n \right )$ time. $S_2$: If a QUEUE ... $S_1$ is correct. Only $S_2$ is correct. Neither $S_1$ nor $S_2$ is correct. Both $S_1$ and $S_2$ are correct.

Consider the following statements:$S_1$: If a STACK is implemented through a LINKED LIST, $\text{PUSH}$ operation will take $O\left ( 1 \right )$ time and $\text{POP}$ op...

Bikram

786 views

Bikram asked May 14, 2017

3 votes

1 answer

60

Test by Bikram | Mock GATE | Test 4 | Question: 6
Consider the below $C$ code: #include<stdio.h> int main() { char a[] = "gateoverflow"; char *p = a; printf("%s", p+p[3]-p[1]); } The output will be : gate eoverflow overflow Garbage error

Consider the below $C$ code:#include<stdio.h int main() { char a[] = "gateoverflow"; char *p = a; printf("%s", p+p[3]-p ); }The output will be : gate eoverflow overflo...

Bikram

276 views

Bikram 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