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
2
votes
3
answers
1501
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$
Bikram
asked
in
GATE
Jan 16, 2017
by
Bikram
990
views
tbb-mockgate-1
ripple-counter-operation
digital-counter
digital-logic
0
votes
1
answer
1502
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 )$
Bikram
asked
in
GATE
Jan 16, 2017
by
Bikram
404
views
tbb-mockgate-1
grammar
ambiguous
compiler-design
1
vote
1
answer
1503
Test by Bikram | Mock GATE | Test 1 | Question: 35
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'$ ; $E$'$\rightarrow$ $aE'$ $|$ $bE'$ | $\epsilon$ $ ... ;$ |$\epsilon$ $E$\rightarrow$ $aE' $|$ bE'$; $E'$ $\rightarrow$ $a$ | $b$ $|$ $\epsilon$
Bikram
asked
in
GATE
Jan 16, 2017
by
Bikram
327
views
tbb-mockgate-1
grammar
compiler-design
2
votes
1
answer
1504
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;$
Bikram
asked
in
GATE
Jan 16, 2017
by
Bikram
1.1k
views
tbb-mockgate-1
data-structures
priority-queue
2
votes
2
answers
1505
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$
Bikram
asked
in
GATE
Jan 16, 2017
by
Bikram
466
views
tbb-mockgate-1
boolean-algebra
digital-logic
1
vote
3
answers
1506
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$
Bikram
asked
in
GATE
Jan 16, 2017
by
Bikram
757
views
tbb-mockgate-1
cache-memory
co-and-architecture
0
votes
1
answer
1507
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
Bikram
asked
in
GATE
Jan 16, 2017
by
Bikram
1.3k
views
tbb-mockgate-1
relations
set-theory&algebra
1
vote
3
answers
1508
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$
Bikram
asked
in
GATE
Jan 16, 2017
by
Bikram
450
views
tbb-mockgate-1
recursive-and-recursively-enumerable-languages
theory-of-computation
0
votes
1
answer
1509
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
Bikram
asked
in
GATE
Jan 16, 2017
by
Bikram
376
views
tbb-mockgate-1
data-structures
tree
3
votes
3
answers
1510
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.
Bikram
asked
in
GATE
Jan 16, 2017
by
Bikram
988
views
tbb-mockgate-1
numerical-answers
disk
operating-system
3
votes
2
answers
1511
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
Bikram
asked
in
GATE
Jan 16, 2017
by
Bikram
1.2k
views
tbb-mockgate-1
conflict-serializable
transaction-and-concurrency
serializability
databases
1
vote
2
answers
1512
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$
Bikram
asked
in
GATE
Jan 16, 2017
by
Bikram
453
views
tbb-mockgate-1
boolean-algebra
digital-logic
2
votes
2
answers
1513
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$
Bikram
asked
in
GATE
Jan 16, 2017
by
Bikram
738
views
tbb-mockgate-1
database-normalization
databases
0
votes
1
answer
1514
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
Bikram
asked
in
GATE
Jan 16, 2017
by
Bikram
287
views
tbb-mockgate-1
identify-class-language
theory-of-computation
2
votes
2
answers
1515
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$
Bikram
asked
in
GATE
Jan 16, 2017
by
Bikram
610
views
tbb-mockgate-1
pipelining
co-and-architecture
1
vote
2
answers
1516
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$
Bikram
asked
in
GATE
Jan 16, 2017
by
Bikram
814
views
tbb-mockgate-1
sql
databases
2
votes
1
answer
1517
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
Bikram
asked
in
GATE
Jan 16, 2017
by
Bikram
548
views
tbb-mockgate-1
process-scheduling
operating-system
0
votes
1
answer
1518
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
Bikram
asked
in
GATE
Jan 16, 2017
by
Bikram
344
views
tbb-mockgate-1
process-synchronization
operating-system
4
votes
2
answers
1519
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$
Bikram
asked
in
GATE
Jan 16, 2017
by
Bikram
880
views
tbb-mockgate-1
data-structures
hashing
algorithms
1
vote
1
answer
1520
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$
Bikram
asked
in
GATE
Jan 16, 2017
by
Bikram
541
views
tbb-mockgate-1
discrete-mathematics
mathematical-logic
first-order-logic
Page:
« prev
1
...
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