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
Most answered questions
56
votes
10
answers
161
GATE CSE 2007 | Question: 69
The distance between two stations $M$ and $N$ is $L$ kilometers. All frames are $K$ bits long. The propagation delay per kilometer is $t$ seconds. Let $R$ bits/second be the channel capacity. Assuming that the processing delay is negligible, the $\text{minimum}$ number ... $\lceil \log_2 \frac{2LtR +K}{K} \rceil$ $\lceil \log_2 \frac{2LtR +2K}{2K} \rceil$
Kathleen
asked
in
Computer Networks
Sep 21, 2014
by
Kathleen
18.1k
views
gatecse-2007
computer-networks
sliding-window
normal
57
votes
10
answers
162
GATE CSE 2007 | Question: 58
Two processes, $P1$ and $P2$, need to access a critical section of code. Consider the following synchronization construct used by the processes: /* P1 */ while (true) { wants1 = true; while (wants2 == true); /* Critical ... waiting. It requires that processes enter the critical section in strict alteration. It does not prevent deadlocks, but ensures mutual exclusion.
Kathleen
asked
in
Operating System
Sep 21, 2014
by
Kathleen
27.5k
views
gatecse-2007
operating-system
process-synchronization
normal
79
votes
10
answers
163
GATE CSE 2003 | Question: 23
In a min-heap with $n$ elements with the smallest element at the root, the $7^{th}$ smallest element can be found in time $\Theta (n \log n)$ $\Theta (n)$ $\Theta(\log n)$ $\Theta(1)$
Disha
asked
in
DS
Sep 19, 2014
by
Disha
31.9k
views
gatecse-2003
data-structures
binary-heap
52
votes
10
answers
164
GATE CSE 2004 | Question: 68
A hard disk with a transfer rate of $10$ Mbytes/second is constantly transferring data to memory using DMA. The processor runs at $600$ MHz, and takes $300$ and $900$ ... percentage of processor time consumed for the transfer operation? $5.0 \%$ $1.0\%$ $0.5\%$ $0.1\%$
Kathleen
asked
in
CO and Architecture
Sep 18, 2014
by
Kathleen
27.0k
views
gatecse-2004
dma
normal
co-and-architecture
35
votes
10
answers
165
GATE CSE 2006 | Question: 15
Consider the following C-program fragment in which $i$, $j$ and $n$ are integer variables. for( i = n, j = 0; i > 0; i /= 2, j +=i ); Let $val(j)$ denote the value stored in the variable $j$ after termination of the for loop. Which one of the following is true? $val(j)=\Theta(\log n)$ $val(j)=\Theta (\sqrt{n})$ $val(j)=\Theta( n)$ $val(j)=\Theta (n\log n)$
Rucha Shelke
asked
in
Algorithms
Sep 17, 2014
by
Rucha Shelke
19.3k
views
gatecse-2006
algorithms
normal
time-complexity
40
votes
10
answers
166
GATE CSE 2003 | Question: 38
Consider the set \(\{a, b, c\}\) with binary operators \(+\) and \(*\) defined as follows: ... $(x, y)$ that satisfy the equations) is $0$ $1$ $2$ $3$
Kathleen
asked
in
Set Theory & Algebra
Sep 17, 2014
by
Kathleen
7.0k
views
gatecse-2003
set-theory&algebra
normal
binary-operation
75
votes
10
answers
167
GATE CSE 2003 | Question: 18
In a bottom-up evaluation of a syntax directed definition, inherited attributes can always be evaluated be evaluated only if the definition is L-attributed be evaluated only if the definition has synthesized attributes never be evaluated
Kathleen
asked
in
Compiler Design
Sep 16, 2014
by
Kathleen
36.6k
views
gatecse-2003
compiler-design
syntax-directed-translation
normal
67
votes
10
answers
168
GATE CSE 2003 | Question: 16
Which of the following suffices to convert an arbitrary CFG to an LL(1) grammar? Removing left recursion alone Factoring the grammar alone Removing left recursion and factoring the grammar None of the above
Kathleen
asked
in
Compiler Design
Sep 16, 2014
by
Kathleen
27.1k
views
gatecse-2003
compiler-design
parsing
easy
42
votes
10
answers
169
GATE CSE 2003 | Question: 3
Let $P(E)$ denote the probability of the event $E$. Given $P(A) = 1$, $P(B) =\dfrac{1}{2}$, the values of $P(A\mid B)$ and $P(B\mid A)$ respectively are $\left(\dfrac{1}{4}\right),\left(\dfrac{1}{2}\right)$ $\left(\dfrac{1}{2}\right),\left(\dfrac{1}{4}\right)$ $\left(\dfrac{1}{2}\right),{1}$ ${1},\left(\dfrac{1}{2}\right)$
Kathleen
asked
in
Probability
Sep 16, 2014
by
Kathleen
11.7k
views
gatecse-2003
probability
easy
conditional-probability
62
votes
10
answers
170
GATE CSE 2002 | Question: 1.8
"If $X$ then $Y$ unless $Z$" is represented by which of the following formulas in propositional logic? ("$\neg$" is negation, "$\land$" is conjunction, and "$\rightarrow$" is implication) $(X\land \neg Z) \rightarrow Y$ $(X \land Y) \rightarrow \neg Z$ $X \rightarrow(Y\land \neg Z)$ $(X \rightarrow Y)\land \neg Z$
Kathleen
asked
in
Mathematical Logic
Sep 15, 2014
by
Kathleen
14.7k
views
gatecse-2002
mathematical-logic
normal
propositional-logic
42
votes
10
answers
171
GATE CSE 2001 | Question: 1.10, UGCNET-Dec2012-III: 36
Suppose a processor does not have any stack pointer registers, which of the following statements is true? It cannot have subroutine call instruction It cannot have nested subroutines call Interrupts are not possible All subroutine calls and interrupts are possible
Kathleen
asked
in
CO and Architecture
Sep 14, 2014
by
Kathleen
18.0k
views
gatecse-2001
co-and-architecture
normal
ugcnetcse-dec2012-paper3
runtime-environment
79
votes
10
answers
172
GATE CSE 2000 | Question: 2.17
Consider the following functions $f(n) = 3n^{\sqrt{n}}$ $g(n) = 2^{\sqrt{n}{\log_{2}n}}$ $h(n) = n!$ Which of the following is true? $h(n)$ is $O(f(n))$ $h(n)$ is $O(g(n))$ $g(n)$ is not $O(f(n))$ $f(n)$ is $O(g(n))$
Kathleen
asked
in
Algorithms
Sep 14, 2014
by
Kathleen
22.8k
views
gatecse-2000
algorithms
asymptotic-notation
normal
37
votes
10
answers
173
GATE CSE 1992 | Question: 01,ix
Complexity of Kruskal’s algorithm for finding the minimum spanning tree of an undirected graph containing $n$ vertices and $m$ edges if the edges are sorted is _______
Kathleen
asked
in
Algorithms
Sep 12, 2014
by
Kathleen
17.5k
views
gate1992
spanning-tree
algorithms
time-complexity
easy
fill-in-the-blanks
42
votes
10
answers
174
GATE CSE 2008 | Question: 78
Let $x_n$ denote the number of binary strings of length $n$ that contain no consecutive $0$s. Which of the following recurrences does $x_n$ satisfy? $x_n = 2x_{n-1}$ $x_n = x_{\lfloor n/2 \rfloor} + 1$ $x_n = x_{\lfloor n/2 \rfloor} + n$ $x_n = x_{n-1} + x_{n-2}$
Kathleen
asked
in
Algorithms
Sep 12, 2014
by
Kathleen
8.5k
views
gatecse-2008
algorithms
recurrence-relation
normal
44
votes
10
answers
175
GATE CSE 2012 | Question: 10
The protocol data unit (PDU) for the application layer in the Internet stack is: Segment Datagram Message Frame
gatecse
asked
in
Computer Networks
Aug 5, 2014
by
gatecse
27.9k
views
gatecse-2012
computer-networks
application-layer-protocols
easy
27
votes
9
answers
176
GATE CSE 2021 Set 2 | Question: 15
Choose the correct choice(s) regarding the following proportional logic assertion $S$: $S: (( P \wedge Q) \rightarrow R) \rightarrow (( P \wedge Q) \rightarrow (Q \rightarrow R))$ $S$ is neither a tautology nor a contradiction $S$ is a tautology $S$ is a contradiction The antecedent of $S$ is logically equivalent to the consequent of $S$
Arjun
asked
in
Mathematical Logic
Feb 18, 2021
by
Arjun
8.7k
views
gatecse-2021-set2
multiple-selects
mathematical-logic
propositional-logic
1-mark
17
votes
9
answers
177
GATE CSE 2021 Set 1 | GA Question: 9
Given below are two statements $1$ and $2$, and two conclusions $\text{I}$ and $\text{II}$ $\text{Statement 1:}$ All bacteria are microorganisms. $\text{Statement 2:}$ All pathogens are microorganisms. $\text{Conclusion I:}$ Some pathogens are ... Either conclusion $\text{I}$ or $\text{II}$ is correct Neither conclusion $\text{I}$ nor $\text{II}$ is correct
Arjun
asked
in
Analytical Aptitude
Feb 18, 2021
by
Arjun
14.4k
views
gatecse-2021-set1
analytical-aptitude
logical-reasoning
statements-follow
2-marks
36
votes
9
answers
178
GATE CSE 2020 | Question: 16
What is the worst case time complexity of inserting $n$ elements into an empty linked list, if the linked list needs to be maintained in sorted order? $\Theta(n)$ $\Theta(n \log n)$ $\Theta ( n)^{2}$ $\Theta(1)$
Arjun
asked
in
DS
Feb 12, 2020
by
Arjun
26.4k
views
gatecse-2020
linked-list
1-mark
37
votes
9
answers
179
GATE CSE 2019 | Question: 10
Let $G$ be an arbitrary group. Consider the following relations on $G$: $R_1: \forall a , b \in G, \: a R_1 b \text{ if and only if } \exists g \in G \text{ such that } a = g^{-1}bg$ ... $R_1$ and $R_2$ $R_1$ only $R_2$ only Neither $R_1$ nor $R_2$
Arjun
asked
in
Set Theory & Algebra
Feb 7, 2019
by
Arjun
17.3k
views
gatecse-2019
engineering-mathematics
discrete-mathematics
set-theory&algebra
group-theory
1-mark
35
votes
9
answers
180
GATE CSE 2019 | Question: 22
Two numbers are chosen independently and uniformly at random from the set $\{1,2,\ldots,13\}.$ The probability (rounded off to $3$ decimal places) that their $4\text{-bit}$ (unsigned) binary representations have the same most significant bit is ___________.
Arjun
asked
in
Digital Logic
Feb 7, 2019
by
Arjun
19.9k
views
gatecse-2019
numerical-answers
digital-logic
number-representation
probability
1-mark
Page:
« prev
1
...
4
5
6
7
8
9
10
11
12
13
14
...
2806
...
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)
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 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