Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged tbb-mockgate-1
0
votes
1
answer
1
Test by Bikram | Mock GATE | Test 1 | Question: 65
Each statement has three segments. Choose the alternative where the third segment in the statement can be logically deduced using BOTH the preceding segments. All physicists are biologists; some biologists are botanists; no botanist is a physicist. Some cats are dogs; ... doesn't have a doctorate. Only $3$ $2$ and $4$ Only $4$ $1$ and $3$
Each statement has three segments. Choose the alternative where the third segment in the statement can be logically deduced using BOTH the preceding segments. All physici...
Bikram
320
views
Bikram
asked
Jan 16, 2017
GATE
tbb-mockgate-1
verbal-reasoning
verbal-aptitude
+
–
7
votes
1
answer
2
Test by Bikram | Mock GATE | Test 1 | Question: 64
A contractor receives a certain sum that he uses to pay wages. His capital, together with the weekly subsidy, would eactly enable him to pay $42$ men for $52$ weeks. If he had $60$ men at the same weekly wages, his capital ... weekly subsidy would exactly suffice for $13$ weeks. The number of men who can be maintained for $26$ weeks is ________.
A contractor receives a certain sum that he uses to pay wages. His capital, together with the weekly subsidy, would eactly enable him to pay $42$ men for $52$ weeks. If h...
Bikram
1.0k
views
Bikram
asked
Jan 16, 2017
GATE
tbb-mockgate-1
numerical-answers
work-time
quantitative-aptitude
+
–
3
votes
2
answers
3
Test by Bikram | Mock GATE | Test 1 | Question: 63
Identify the pair of words which has a relationship similar to “Wheat : Chaff” Wine: Dregs Crop: Corn Laughter: Revelry Cloud: Rain
Identify the pair of words which has a relationship similar to “Wheat : Chaff”Wine: DregsCrop: CornLaughter: RevelryCloud: Rain
Bikram
493
views
Bikram
asked
Jan 16, 2017
GATE
tbb-mockgate-1
word-pairs
verbal-aptitude
+
–
3
votes
2
answers
4
Test by Bikram | Mock GATE | Test 1 | Question: 62
Consider the set of numbers $N= 1,2,3,4,5,6,7,8$. Take every distinct two-element subset of $N$ and write down the number that is smaller. For eg, if you take the subset$\left ( 2,5 \right )$, you will write down $2$. The sum of all the numbers that you write down is ___________.
Consider the set of numbers $N= 1,2,3,4,5,6,7,8$. Take every distinct two-element subset of $N$ and write down the number that is smaller. For eg, if you take the subset$...
Bikram
749
views
Bikram
asked
Jan 16, 2017
GATE
tbb-mockgate-1
numerical-answers
quantitative-aptitude
+
–
1
votes
1
answer
5
Test by Bikram | Mock GATE | Test 1 | Question: 61
The simplest animals are those whose bodies are simplest in structure and which do the things done by all living animals, such as eating, breathing, moving, and feeling, in the most ________ way. Haphazard Bizarre Primitive Advantageous
The simplest animals are those whose bodies are simplest in structure and which do the things done by all living animals, such as eating, breathing, moving, and feeling, ...
Bikram
386
views
Bikram
asked
Jan 16, 2017
GATE
tbb-mockgate-1
most-appropriate-word
verbal-aptitude
+
–
2
votes
2
answers
6
Test by Bikram | Mock GATE | Test 1 | Question: 60
Read the following passage carefully, and answer the question that follows: People who oppose the law that makes it mandatory for two wheeler riders to wear helmets argue that in a democracy, people have the right to take risks as long ... laws is lower than in states with no laws. A great number of people die in road accidents even otherwise.
Read the following passage carefully, and answer the question that follows:People who oppose the law that makes it mandatory for two wheeler riders to wear helmets argue ...
Bikram
971
views
Bikram
asked
Jan 16, 2017
GATE
tbb-mockgate-1
passage-reading
verbal-aptitude
+
–
2
votes
1
answer
7
Test by Bikram | Mock GATE | Test 1 | Question: 59
The question consists of five statements followed by options consisting of three statements put together in a specific order. Choose the option which indicates a valid argument. That is, where the third statement is a conclusion drawn from the ... are tasteless. Some grapes are not tasteless. No grape is tasteless. $CEA$ $BDC$ $CBD$ $EAC$
The question consists of five statements followed by options consisting of three statements put together in a specific order.Choose the option which indicates a valid arg...
Bikram
433
views
Bikram
asked
Jan 16, 2017
GATE
tbb-mockgate-1
statements-follow
verbal-aptitude
verbal-reasoning
+
–
2
votes
2
answers
8
Test by Bikram | Mock GATE | Test 1 | Question: 58
While nurturing parents can compensate for adversity, cold or inconsistent parents may ____________ it. Exacerbate Neutralize Eradicate Ameliorate
While nurturing parents can compensate for adversity, cold or inconsistent parents may ____________ it.ExacerbateNeutralizeEradicateAmeliorate
Bikram
814
views
Bikram
asked
Jan 16, 2017
GATE
tbb-mockgate-1
most-appropriate-word
verbal-aptitude
+
–
2
votes
1
answer
9
Test by Bikram | Mock GATE | Test 1 | Question: 57
Each statement has three segments. Choose the alternative where the third segment in the statement can be logically deduced from BOTH the preceding segments. Only married couples dance together in this club; Pinto danced with Rita; Rita is Pinto's wife. ... soldiers; Shyam possesses a gun; Shyam is not a soldier. Only b Only c a and d a and c
Each statement has three segments. Choose the alternative where the third segment in the statement can be logically deduced from BOTH the preceding segments. Only marrie...
Bikram
665
views
Bikram
asked
Jan 16, 2017
GATE
tbb-mockgate-1
logical-reasoning
analytical-aptitude
+
–
4
votes
2
answers
10
Test by Bikram | Mock GATE | Test 1 | Question: 56
Without stops, a train travels an average of $50$ $km$ an hour. With stops, it travels $40$ $km$ an hour. For how many minutes, on average, does the train stop in an hour? $1/10$ $12$ $1/5$ $20$
Without stops, a train travels an average of $50$ $km$ an hour. With stops, it travels $40$ $km$ an hour. For how many minutes, on average, does the train stop in an hour...
Bikram
819
views
Bikram
asked
Jan 16, 2017
GATE
tbb-mockgate-1
speed-time-distance
quantitative-aptitude
+
–
2
votes
1
answer
11
Test by Bikram | Mock GATE | Test 1 | Question: 55
Consider a disk with a sector size of $512$ bytes, $50$ sectors per track, $2000$ tracks per surface and five double-sided platters (i.e. $10$ surfaces). The disk platters rotate at $5400$ ... on this disk, and no record is allowed to span two blocks. Then, the rotational latency of the disk is ________ seconds.
Consider a disk with a sector size of $512$ bytes, $50$ sectors per track, $2000$ tracks per surface and five double-sided platters (i.e. $10$ surfaces). The disk platter...
Bikram
1.6k
views
Bikram
asked
Jan 16, 2017
GATE
tbb-mockgate-1
numerical-answers
disk
operating-system
+
–
0
votes
1
answer
12
Test by Bikram | Mock GATE | Test 1 | Question: 54
A pipeline system has $4$ stages and each stage takes $10ns$. $30\%$ instructions are branch-instructions and branch-instruction introduce a delay of $3$ stall cycles. The speed-up factor compared to same non-pipelined environment if there are $100000$ instructions to be executed is ___________.
A pipeline system has $4$ stages and each stage takes $10ns$.$30\%$ instructions are branch-instructions and branch-instruction introduce a delay of $3$ stall cycles. The...
Bikram
1.2k
views
Bikram
asked
Jan 16, 2017
GATE
tbb-mockgate-1
numerical-answers
pipelining
co-and-architecture
+
–
3
votes
1
answer
13
Test by Bikram | Mock GATE | Test 1 | Question: 53
A computer uses a memory unit with $512K$ words of $64$ bits each. A binary instruction code is stored in one word of memory. The instruction has four parts: an indirect bit, an operation code, a register code part (to specify one of $256$ registers), and an address part. The number of bits in the operation code are _______.
A computer uses a memory unit with $512K$ words of $64$ bits each. A binary instruction code is stored in one word of memory. The instruction has four parts: an indirect ...
Bikram
925
views
Bikram
asked
Jan 16, 2017
GATE
tbb-mockgate-1
numerical-answers
machine-instruction
co-and-architecture
+
–
3
votes
2
answers
14
Test by Bikram | Mock GATE | Test 1 | Question: 52
Two peer processes $A$ (sender) and $B$ (receiver) use stop-and-wait $ARQ$ to send packets over a single link with capacity $C$. All packets have the same length of $100$ bits. The round-trip time (which is the time ... per second. The average transmission rate (in bits per seconds) with which process $A$ sends data to process $B$ is ________.
Two peer processes $A$ (sender) and $B$ (receiver) use stop-and-wait $ARQ$ to send packets over a single link with capacity $C$. All packets have the same length of $100...
Bikram
995
views
Bikram
asked
Jan 16, 2017
GATE
tbb-mockgate-1
numerical-answers
stop-and-wait
computer-networks
sliding-window
+
–
1
votes
2
answers
15
Test by Bikram | Mock GATE | Test 1 | Question: 51
The access time of cache memory is $10$ $ns$ and main memory is $100$ $ns$. It is estimated that $80 \%$ of memory requests are for read and remaining are for write. The hit ratio for read access only is $0.9$. A write through procedure is used. Pages are always available in cache for write operation. Then, the average access time is ______ $ns$.
The access time of cache memory is $10$ $ns$ and main memory is $100$ $ns$. It is estimated that $80 \%$ of memory requests are for read and remaining are for write. The ...
Bikram
1.5k
views
Bikram
asked
Jan 16, 2017
GATE
tbb-mockgate-1
numerical-answers
cache-memory
co-and-architecture
+
–
4
votes
1
answer
16
Test by Bikram | Mock GATE | Test 1 | Question: 50
Consider the regular languages denoted by the following pairs of regular expressions: $(0 + 1)$*$ = 0$*$ + 1$*$ $ $0(120)$*$12 = 01(201)$*$2$ $(0$*$l $*$)$*$ = (0$*$1)$*$ $ $(01 +0)$*$0 = 0(10 +0)$*$ $ Determine the truth of ... $a-True, b-False, c-False, d-True$ $a-True, b-True, c-False, d-True$ $a-False, b-True, c-False, d-True$
Consider the regular languages denoted by the following pairs of regular expressions:$(0 + 1)$*$ = 0$*$ + 1$*$ $$0(120)$*$12 = 01(201)$*$2$$(0$*$l $*$)$*$ = (0$*$1)$*$ $$...
Bikram
716
views
Bikram
asked
Jan 16, 2017
GATE
tbb-mockgate-1
regular-expression
theory-of-computation
+
–
4
votes
3
answers
17
Test by Bikram | Mock GATE | Test 1 | Question: 49
Consider two machines, machine $A$ and machine $B$. Machine $B$ runs floating-point instructions $n$ times faster than machine $A$. Consider a program that takes $100$ $seconds$ to run on machine $A$, and spends half of its time in ... $A$) then the value of $n$ is _________ (In case of fractional value of $n$ give nearest higher positive integer).
Consider two machines, machine $A$ and machine $B$. Machine $B$ runs floating-point instructions $n$ times faster than machine $A$.Consider a program that takes $100$ $se...
Bikram
1.3k
views
Bikram
asked
Jan 16, 2017
GATE
tbb-mockgate-1
numerical-answers
speedup
co-and-architecture
+
–
1
votes
2
answers
18
Test by Bikram | Mock GATE | Test 1 | Question: 48
State whether the following statements are true or false? $(P\to Q) \rightarrow (Q\to P)$ always holds, for all propositions $P, Q$. $\left ( \left ( P\vee Q \right )\rightarrow Q \right )$ $\rightarrow$ ... true, $b$ is false Both $a$ and $b$ are true $a$ is false, $b$ is true. Both $a$ and $b$ are false.
State whether the following statements are true or false?$(P\to Q) \rightarrow (Q\to P)$ always holds, for all propositions $P, Q$.$\left ( \left ( P\vee Q \right )\right...
Bikram
803
views
Bikram
asked
Jan 16, 2017
GATE
tbb-mockgate-1
discrete-mathematics
mathematical-logic
propositional-logic
+
–
2
votes
1
answer
19
Test by Bikram | Mock GATE | Test 1 | Question: 47
For the given grammar consider the statements: $S' \rightarrow S$ $S \rightarrow aAd \mid bBd \mid aBe \mid bAe$ $A \rightarrow c$ $B \rightarrow c$ Which of the following statement is/are true? S1: The given grammar is LR(l). S2: On merger the grammar will generate reduce reduce conflict. Only S1 Only S2 Both S1 and S2 None of S1 and S2
For the given grammar consider the statements:$S' \rightarrow S$$S \rightarrow aAd \mid bBd \mid aBe \mid bAe$$A \rightarrow c$$B \rightarrow c$Which of the following...
Bikram
718
views
Bikram
asked
Jan 16, 2017
GATE
tbb-mockgate-1
grammar
compiler-design
+
–
1
votes
1
answer
20
Test by Bikram | Mock GATE | Test 1 | Question: 46
Assume there are n transactions $T^{1}$., $T^{2}$., .... ,$T^{n}$. Every transaction Writes a value of variable $X$ and then it is read by its successive transaction, like, $T^{1}$ writes a value of $X$ that is read by $T^{2}$ ... of transaction rollbacks are required to recover the schedule is ? $0$ $\left ( n \right )$ $1$ $\left ( n-1 \right )$
Assume there are n transactions $T^{1}$., $T^{2}$., .... ,$T^{n}$.Every transaction Writes a value of variable $X$ and then it is read by its successive transaction, l...
Bikram
1.3k
views
Bikram
asked
Jan 16, 2017
GATE
tbb-mockgate-1
transaction-and-concurrency
databases
+
–
0
votes
1
answer
21
Test by Bikram | Mock GATE | Test 1 | Question: 45
How many times $fibon$\left ( 3 \right )$ is called during invocation of $fibon$ $\left ( 6 \right )$? $fibon(x) = fibon(x-1) + fibon(x-2)$ $fibon(0) = 1$ $fibon(1) = 1$ 3 4 5 6
How many times $fibon$$\left ( 3 \right )$ is called during invocation of $fibon$ $\left ( 6 \right )$?$fibon(x) = fibon(x-1) + fibon(x-2)$$fibon(0) = 1$$fibon(1) = 1$345...
Bikram
344
views
Bikram
asked
Jan 16, 2017
GATE
tbb-mockgate-1
algorithms
recursion
+
–
2
votes
1
answer
22
Test by Bikram | Mock GATE | Test 1 | Question: 44
Match the pairs about implementation and addressing modes: Group A Group B A. Array I Indirect Addressing B Relocatable code II Indexed Addressing C Array as parameter III Base Register Addressing ... $(A-III), (B-II), (C-I)$ $(A-I), (B-III), (C-II)$
Match the pairs about implementation and addressing modes:Group A Group B A.ArrayI Indirect AddressingB Relocatable codeII Indexed AddressingC Array as parameterIIIBase...
Bikram
450
views
Bikram
asked
Jan 16, 2017
GATE
tbb-mockgate-1
addressing-modes
co-and-architecture
+
–
1
votes
1
answer
23
Test by Bikram | Mock GATE | Test 1 | Question: 42
Find the missing statement in the if loop of $Floyd$ algorithm. Procedure Floyd: (var A: array[1...n,1...n] of real; C: array [1...n,1...n] of real); Var i, j, k: integer; begin M for i:=l to n do for j:=l to n do A[i,j]: =C[i,j] for i:=l to n do A[i,j ]:=0 ; ... $A[i,j]: = A[i, j] + A[k,j]$ $A[i,j]: = A[j,k]+ A[j,i]$ $A[i,j]: =A[i,k] + A[i,j]$
Find the missing statement in the if loop of $Floyd$ algorithm.Procedure Floyd: (var A: array[1...n,1...n] of real; C: array [1...n,1...n] of real); Var i, j, k: integer;...
Bikram
548
views
Bikram
asked
Jan 16, 2017
GATE
tbb-mockgate-1
algorithms
graph-algorithms
shortest-path
+
–
0
votes
1
answer
24
Test by Bikram | Mock GATE | Test 1 | Question: 43
What is the output of the following code snippet? #include<stdio.h> int main ( ) { int x = 2, y = 5; if (x < y) return (x = x+y); else printf (“ GO Mock 1 ”); printf(“ Welcome to GO Mock test ”); } GO Mock 1 Welcome to GO Mock Test No output GO Mock 1Welcome to GO Mock Test
What is the output of the following code snippet?#include<stdio.h int main ( ) { int x = 2, y = 5; if (x < y) return (x = x+y); else printf (“ GO Mock 1 ”); printf(�...
Bikram
971
views
Bikram
asked
Jan 16, 2017
GATE
tbb-mockgate-1
programming
programming-in-c
+
–
4
votes
1
answer
25
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
GATE
tbb-mockgate-1
numerical-answers
indexing
databases
+
–
1
votes
2
answers
26
Test by Bikram | Mock GATE | Test 1 | Question: 40
The head of a moving head disk with $100$ tracks numbered $0$ to $99$ is serving a request at track $x$. if the requests of track $25, 76, 43, 10, 67$ are served using $FIFO$ algorithm, then total head movements are $194$. The track $x$ initially served was at ________.
The head of a moving head disk with $100$ tracks numbered $0$ to $99$ is serving a request at track $x$. if the requests of track $25, 76, 43, 10, 67$ are served using $F...
Bikram
1.7k
views
Bikram
asked
Jan 16, 2017
GATE
tbb-mockgate-1
numerical-answers
disk-scheduling
operating-system
+
–
1
votes
2
answers
27
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
749
views
Bikram
asked
Jan 16, 2017
GATE
tbb-mockgate-1
matrix
eigen-value
linear-algebra
+
–
2
votes
1
answer
28
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
521
views
Bikram
asked
Jan 16, 2017
GATE
tbb-mockgate-1
sorting
radix-sort
algorithms
+
–
2
votes
3
answers
29
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
GATE
tbb-mockgate-1
ripple-counter-operation
digital-counter
digital-logic
+
–
2
votes
4
answers
30
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
GATE
tbb-mockgate-1
numerical-answers
pipelining
co-and-architecture
+
–
Page:
1
2
3
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register