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
Highest voted questions
75
votes
5
answers
141
GATE CSE 2011 | Question: 6, UGCNET-June2013-III: 62
Let the time taken to switch from user mode to kernel mode of execution be $T1$ while time taken to switch between two user processes be $T2$. Which of the following is correct? $T1 > T2$ $T1 = T2$ $T1 < T2$ Nothing can be said about the relation between $T1$ and $T2$
go_editor
asked
in
Operating System
Sep 29, 2014
by
go_editor
25.7k
views
gatecse-2011
operating-system
context-switch
easy
ugcnetcse-june2013-paper3
75
votes
3
answers
142
GATE CSE 1999 | Question: 2.12
Which of the following actions is/are typically not performed by the operating system when switching context from process $A$ to process $B$? Saving current register values and restoring saved register values for process $B$. Changing address translation tables. Swapping out the memory image of process $A$ to the disk. Invalidating the translation look-aside buffer.
Kathleen
asked
in
Operating System
Sep 23, 2014
by
Kathleen
27.5k
views
gate1999
operating-system
context-switch
normal
75
votes
8
answers
143
GATE CSE 2007 | Question: 53
Consider the following two statements: P: Every regular grammar is LL(1) Q: Every regular set has a LR(1) grammar Which of the following is TRUE? Both P and Q are true P is true and Q is false P is false and Q is true Both P and Q are false
Kathleen
asked
in
Compiler Design
Sep 21, 2014
by
Kathleen
35.6k
views
gatecse-2007
compiler-design
grammar
normal
75
votes
5
answers
144
GATE CSE 2007 | Question: 47
Consider the process of inserting an element into a $Max \: Heap$, where the $Max \: Heap$ is represented by an $array$. Suppose we perform a binary search on the path from the new leaf to the root to find the position for the newly inserted element, the number of $comparisons$ performed is: $\Theta(\log_2n)$ $\Theta(\log_2\log_2n)$ $\Theta(n)$ $\Theta(n\log_2n)$
Kathleen
asked
in
DS
Sep 21, 2014
by
Kathleen
19.4k
views
gatecse-2007
data-structures
binary-heap
normal
75
votes
10
answers
145
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
75
votes
11
answers
146
GATE CSE 2009 | Question: 21
An unbalanced dice (with $6$ faces, numbered from $1$ to $6$) is thrown. The probability that the face value is odd is $90\%$ of the probability that the face value is even. The probability of getting any even numbered face is the same. If the ... following options is closest to the probability that the face value exceeds $3$? $0.453$ $0.468$ $0.485$ $0.492$
gatecse
asked
in
Probability
Sep 15, 2014
by
gatecse
16.3k
views
gatecse-2009
probability
normal
conditional-probability
75
votes
15
answers
147
GATE CSE 2005 | Question: 39
Suppose there are $\lceil \log n \rceil$ sorted lists of $\lfloor n /\log n \rfloor$ elements each. The time complexity of producing a sorted list of all these elements is: (Hint:Use a heap data structure) $O(n \log \log n)$ $\Theta(n \log n)$ $\Omega(n \log n)$ $\Omega\left(n^{3/2}\right)$
gatecse
asked
in
Algorithms
Sep 15, 2014
by
gatecse
26.3k
views
gatecse-2005
algorithms
sorting
normal
74
votes
8
answers
148
GATE CSE 2017 Set 1 | Question: 10
Consider the following context-free grammar over the alphabet $\Sigma = \{a,b,c\}$ with $S$ as the start symbol:$S \rightarrow abScT \mid abcT$$T \rightarrow bT \mid b$ ... $\{\left ( ab \right )^{n}\left ( cb^{n} \right )^{m} \mid m,n \geq 1 \}$
Arjun
asked
in
Theory of Computation
Feb 14, 2017
by
Arjun
21.7k
views
gatecse-2017-set1
theory-of-computation
context-free-language
normal
74
votes
10
answers
149
GATE IT 2006 | Question: 85
Consider a database with three relation instances shown below. The primary keys for the Drivers and Cars relation are did and cid respectively and the records are stored in ascending order of these primary keys as given in the tables. No indexing is available in the database. ... key, then $n$ lies in the range: $36 - 40$ $44 - 48$ $60 - 64$ $100 - 104$
Ishrat Jahan
asked
in
Databases
Nov 1, 2014
by
Ishrat Jahan
22.4k
views
gateit-2006
databases
sql
normal
74
votes
6
answers
150
GATE IT 2006 | Question: 51
Which one of the choices given below would be printed when the following program is executed? #include <stdio.h> int a1[] = {6, 7, 8, 18, 34, 67}; int a2[] = {23, 56, 28, 29}; int a3[] = {-12, 27, -31}; int *x[] = {a1, a2, a3}; void print(int *a[]) { printf("%d," ... (x); } $8, -12, 7, 23, 8$ $8, 8, 7, 23, 7$ $-12, -12, 27, -31, 23$ $-12, -12, 27, -31, 56$
Ishrat Jahan
asked
in
Programming in C
Oct 31, 2014
by
Ishrat Jahan
12.8k
views
gateit-2006
programming
programming-in-c
normal
74
votes
7
answers
151
GATE CSE 2012 | Question: 45
Consider an instance of TCP's Additive Increase Multiplicative Decrease (AIMD) algorithm where the window size at the start of the slow start phase is $2$ MSS and the threshold at the start of the first transmission is $8$ MSS. Assume that a timeout occurs during ... Find the congestion window size at the end of the tenth transmission. $8$ MSS $14$ MSS $7$ MSS $12$ MSS
Arjun
asked
in
Computer Networks
Sep 29, 2014
by
Arjun
38.3k
views
gatecse-2012
computer-networks
congestion-control
normal
74
votes
11
answers
152
GATE CSE 2014 Set 1 | Question: 47
A function $f(x)$ is continuous in the interval $[0,2]$. It is known that $f(0) = f(2) = -1$ and $f(1) = 1$. Which one of the following statements must be true? There exists a $y$ in the interval $(0,1)$ such that $f(y) = f(y+1)$ For every $y$ ... the function in the interval $(0,2)$ is $1$ There exists a $y$ in the interval $(0,1)$ such that $f(y)$ = $-f(2-y)$
go_editor
asked
in
Calculus
Sep 28, 2014
by
go_editor
20.9k
views
gatecse-2014-set1
calculus
continuity
normal
73
votes
10
answers
153
GATE CSE 2010 | Question: 53
A hash table of length $10$ uses open addressing with hash function $h(k) = k \: \mod \: 10$, and linear probing. After inserting $6$ ... of the key values using the same hash function and linear probing will result in the hash table shown above? $10$ $20$ $30$ $40$
go_editor
asked
in
DS
Apr 21, 2016
by
go_editor
27.0k
views
data-structures
hashing
normal
gatecse-2010
73
votes
8
answers
154
GATE CSE 2016 Set 1 | Question: 32
The stage delays in a $4$-stage pipeline are $800, 500, 400$ and $300$ picoseconds. The first stage (with delay $800$ picoseconds) is replaced with a functionality equivalent design involving two stages with respective delays $600$ and $350$ picoseconds. The throughput increase of the pipeline is ___________ percent.
Sandeep Singh
asked
in
CO and Architecture
Feb 12, 2016
by
Sandeep Singh
25.6k
views
gatecse-2016-set1
co-and-architecture
pipelining
normal
numerical-answers
73
votes
5
answers
155
GATE CSE 2016 Set 2 | Question: 34
A complete binary min-heap is made by including each integer in $[1, 1023]$ exactly once. The depth of a node in the heap is the length of the path from the root of the heap to that node. Thus, the root is at depth $0$. The maximum depth at which integer $9$ can appear is _________.
Akash Kanase
asked
in
DS
Feb 12, 2016
by
Akash Kanase
25.8k
views
gatecse-2016-set2
data-structures
binary-heap
normal
numerical-answers
73
votes
6
answers
156
GATE IT 2007 | Question: 25
What is the largest integer $m$ such that every simple connected graph with $n$ vertices and $n$ edges contains at least $m$ different spanning trees ? $1$ $2$ $3$ $n$
Ishrat Jahan
asked
in
Graph Theory
Oct 29, 2014
by
Ishrat Jahan
21.5k
views
gateit-2007
graph-theory
graph-connectivity
normal
73
votes
9
answers
157
GATE IT 2008 | Question: 44
When $n = 2^{2k}$ for some $k \geqslant 0$, the recurrence relation $T(n) = √(2) T(n/2) + √n$, $T(1) = 1$ evaluates to : $√(n) (\log n + 1)$ $√(n) \log n$ $√(n) \log √(n)$ $n \log √n$
Ishrat Jahan
asked
in
Algorithms
Oct 28, 2014
by
Ishrat Jahan
17.2k
views
gateit-2008
algorithms
recurrence-relation
normal
73
votes
5
answers
158
GATE CSE 2013 | Question: 20
In a $k$-way set associative cache, the cache is divided into $v$ sets, each of which consists of $k$ lines. The lines of a set are placed in sequence one after another. The lines in set $s$ are sequenced before the lines in set $(s+1)$. The main memory blocks are numbered 0 onwards. The ... $(j \text{ mod } k) * v \text{ to } (j \text{ mod } k) * v + (v-1) $
Arjun
asked
in
CO and Architecture
Sep 23, 2014
by
Arjun
14.1k
views
gatecse-2013
co-and-architecture
cache-memory
normal
73
votes
2
answers
159
GATE CSE 2013 | Question: 42
What is the return value of $f(p,p)$, if the value of $p$ is initialized to $5$ before the call? Note that the first parameter is passed by reference, whereas the second parameter is passed by value. int f (int &x, int c) { c = c - 1; if (c==0) return 1; x = x + 1; return f(x,c) * x; }
gatecse
asked
in
Programming in C
Aug 7, 2014
by
gatecse
21.1k
views
gatecse-2013
compiler-design
normal
marks-to-all
numerical-answers
parameter-passing
runtime-environment
72
votes
7
answers
160
GATE CSE 2017 Set 1 | Question: 02
Consider the first-order logic sentence $F:\forall x(\exists yR(x,y))$. Assuming non-empty logical domains, which of the sentences below are implied by $F$? $\exists y(\exists xR(x,y))$ $\exists y(\forall xR(x,y))$ $\forall y(\exists xR(x,y))$ $¬\exists x(\forall y¬R(x,y))$ IV only I and IV only II only II and III only
khushtak
asked
in
Mathematical Logic
Feb 14, 2017
by
khushtak
17.2k
views
gatecse-2017-set1
mathematical-logic
first-order-logic
Page:
« prev
1
...
3
4
5
6
7
8
9
10
11
12
13
...
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