Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Filter
Recent
Hot!
Most votes
Most answers
Most views
Previous GATE
Featured
Recent questions in Exam Queries
4
votes
2
answers
1481
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$
Bikram
asked
in
GATE
Jan 16, 2017
by
Bikram
814
views
tbb-mockgate-1
speed-time-distance
quantitative-aptitude
0
votes
1
answer
1482
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 ___________.
Bikram
asked
in
GATE
Jan 16, 2017
by
Bikram
1.3k
views
tbb-mockgate-1
numerical-answers
pipelining
co-and-architecture
2
votes
1
answer
1483
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.
Bikram
asked
in
GATE
Jan 16, 2017
by
Bikram
1.6k
views
tbb-mockgate-1
numerical-answers
disk
operating-system
3
votes
1
answer
1484
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 _______.
Bikram
asked
in
GATE
Jan 16, 2017
by
Bikram
928
views
tbb-mockgate-1
numerical-answers
machine-instruction
co-and-architecture
3
votes
2
answers
1485
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 ________.
Bikram
asked
in
GATE
Jan 16, 2017
by
Bikram
978
views
tbb-mockgate-1
numerical-answers
stop-and-wait
computer-networks
sliding-window
4
votes
1
answer
1486
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$
Bikram
asked
in
GATE
Jan 16, 2017
by
Bikram
710
views
tbb-mockgate-1
regular-expression
theory-of-computation
1
vote
2
answers
1487
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$.
Bikram
asked
in
GATE
Jan 16, 2017
by
Bikram
1.5k
views
tbb-mockgate-1
numerical-answers
cache-memory
co-and-architecture
4
votes
3
answers
1488
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).
Bikram
asked
in
GATE
Jan 16, 2017
by
Bikram
1.4k
views
tbb-mockgate-1
numerical-answers
speedup
co-and-architecture
2
votes
1
answer
1489
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
Bikram
asked
in
GATE
Jan 16, 2017
by
Bikram
717
views
tbb-mockgate-1
grammar
compiler-design
1
vote
2
answers
1490
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.
Bikram
asked
in
GATE
Jan 16, 2017
by
Bikram
805
views
tbb-mockgate-1
discrete-mathematics
mathematical-logic
propositional-logic
1
vote
1
answer
1491
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 )$
Bikram
asked
in
GATE
Jan 16, 2017
by
Bikram
1.3k
views
tbb-mockgate-1
transaction-and-concurrency
databases
0
votes
1
answer
1492
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
Bikram
asked
in
GATE
Jan 16, 2017
by
Bikram
335
views
tbb-mockgate-1
algorithms
recursion
2
votes
1
answer
1493
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)$
Bikram
asked
in
GATE
Jan 16, 2017
by
Bikram
456
views
tbb-mockgate-1
addressing-modes
co-and-architecture
1
vote
1
answer
1494
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]$
Bikram
asked
in
GATE
Jan 16, 2017
by
Bikram
542
views
tbb-mockgate-1
algorithms
graph-algorithms
shortest-path
0
votes
1
answer
1495
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
Bikram
asked
in
GATE
Jan 16, 2017
by
Bikram
993
views
tbb-mockgate-1
programming
programming-in-c
1
vote
2
answers
1496
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 ________.
Bikram
asked
in
GATE
Jan 16, 2017
by
Bikram
1.7k
views
tbb-mockgate-1
numerical-answers
disk-scheduling
operating-system
4
votes
1
answer
1497
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 _____.
Bikram
asked
in
GATE
Jan 16, 2017
by
Bikram
1.4k
views
tbb-mockgate-1
numerical-answers
indexing
databases
2
votes
1
answer
1498
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$
Bikram
asked
in
GATE
Jan 16, 2017
by
Bikram
499
views
tbb-mockgate-1
sorting
radix-sort
algorithms
1
vote
2
answers
1499
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$
Bikram
asked
in
GATE
Jan 16, 2017
by
Bikram
745
views
tbb-mockgate-1
matrix
eigen-value
linear-algebra
2
votes
4
answers
1500
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 _______
Bikram
asked
in
GATE
Jan 16, 2017
by
Bikram
1.2k
views
tbb-mockgate-1
numerical-answers
pipelining
co-and-architecture
Page:
« prev
1
...
70
71
72
73
74
75
76
77
78
79
next »
Subscribe to GATE CSE 2024 Test Series
Subscribe to GO Classes for GATE CSE 2024
Quick search syntax
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
Recent Posts
Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes
Subjects
All categories
General Aptitude
(3.5k)
Engineering Mathematics
(10.4k)
Digital Logic
(3.6k)
Programming and DS
(6.2k)
Algorithms
(4.8k)
Theory of Computation
(6.9k)
Compiler Design
(2.5k)
Operating System
(5.2k)
Databases
(4.8k)
CO and Architecture
(4.0k)
Computer Networks
(4.9k)
Artificial Intelligence
(79)
Machine Learning
(48)
Data Mining and Warehousing
(25)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(684)
Exam Queries
(1.6k)
GATE
(531)
CBSE/UGC NET
(15)
CSIR NET
(2)
TIFR
(273)
CMI
(1)
ISI
(3)
ISRO
(36)
BARC
(7)
IIITH-PGEE
(12)
BITS-HD
(0)
Others
(697)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
244k
comments
80.0k
users
Recent questions in Exam Queries
Recent Blog Comments
category ?
Hi @Arjun sir, I have obtained a score of 591 in ...
download here
Can you please tell about IIT-H mtech CSE self...
Please add your admission queries here:...
Network Sites
GO Mechanical
GO Electrical
GO Electronics
GO Civil
CSE Doubts
Aptitude Overflow