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
91
votes
9
answers
61
GATE CSE 2017 Set 1 | Question: 51
Consider a $2$-way set associative cache with $256$ blocks and uses $\text{LRU}$ replacement. Initially the cache is empty. Conflict misses are those misses which occur due to the contention of multiple blocks for the same cache set. Compulsory ... $10$ times. The number of conflict misses experienced by the cache is _________ .
Arjun
asked
in
CO and Architecture
Feb 14, 2017
by
Arjun
38.5k
views
gatecse-2017-set1
co-and-architecture
cache-memory
conflict-misses
normal
numerical-answers
91
votes
9
answers
62
GATE CSE 2016 Set 1 | Question: 28
A function $f: \Bbb{N^+} \rightarrow \Bbb{N^+}$ , defined on the set of positive integers $\Bbb{N^+}$, satisfies the following properties: $f(n)=f(n/2)$ if $n$ is even $f(n)=f(n+5)$ if $n$ is odd Let $R=\{ i \mid \exists{j} : f(j)=i \}$ be the set of distinct values that $f$ takes. The maximum possible size of $R$ is ___________.
Sandeep Singh
asked
in
Set Theory & Algebra
Feb 12, 2016
by
Sandeep Singh
21.5k
views
gatecse-2016-set1
set-theory&algebra
functions
normal
numerical-answers
91
votes
5
answers
63
GATE CSE 2014 Set 2 | Question: 35
Let $\langle M \rangle$ be the encoding of a Turing machine as a string over $\Sigma=\left\{0,1\right\}$ ... $L$ is: decidable and recursively enumerable undecidable but recursively enumerable undecidable and not recursively enumerable decidable but not recursively enumerable
go_editor
asked
in
Theory of Computation
Sep 28, 2014
by
go_editor
27.7k
views
gatecse-2014-set2
theory-of-computation
turing-machine
normal
91
votes
7
answers
64
GATE CSE 2006 | Question: 40
Consider numbers represented in 4-bit Gray code. Let $ h_{3}h_{2}h_{1}h_{0}$ be the Gray code representation of a number $n$ and let $ g_{3}g_{2}g_{1}g_{0}$ be the Gray code of $ (n+1)(modulo 16)$ ... $ g_{3}(h_{3}h_{2}h_{1}h_{0})=\sum (0,1,6,7,10,11,12,13) $
Rucha Shelke
asked
in
Digital Logic
Sep 26, 2014
by
Rucha Shelke
20.4k
views
gatecse-2006
digital-logic
number-representation
binary-codes
normal
90
votes
12
answers
65
GATE CSE 2006 | Question: 48
Let $T$ be a depth first search tree in an undirected graph $G$. Vertices $u$ and $ν$ are leaves of this tree $T$. The degrees of both $u$ and $ν$ in $G$ are at least $2$ ... exist a cycle in $G$ containing $u$ and $ν$ There must exist a cycle in $G$ containing $u$ and all its neighbours in $G$
Rucha Shelke
asked
in
Algorithms
Sep 26, 2014
by
Rucha Shelke
21.0k
views
gatecse-2006
algorithms
graph-algorithms
normal
90
votes
11
answers
66
GATE CSE 2014 Set 1 | Question: 12
Consider a rooted n node binary tree represented using pointers. The best upper bound on the time required to determine the number of subtrees having exactly $4$ nodes is $O(n^a\log^bn)$. Then the value of $a+10b$ is __________.
go_editor
asked
in
DS
Sep 26, 2014
by
go_editor
24.3k
views
gatecse-2014-set1
data-structures
binary-tree
numerical-answers
normal
90
votes
1
answer
67
GATE CSE 2009 | Question: 45
Let $R$ and $S$ be relational schemes such that $R=\{a,b,c\}$ and $S=\{c\}.$ Now consider the following queries on the database: $\pi_{R-S}(r) - \pi_{R-S} \left (\pi_{R-S} (r) \times s - \pi_{R-S,S}(r)\right )$ ... a,R.b From R,S Where R.c = S.c Which of the above queries are equivalent? $1$ and $2$ $1$ and $3$ $2$ and $4$ $3$ and $4$
Kathleen
asked
in
Databases
Sep 22, 2014
by
Kathleen
24.6k
views
gatecse-2009
databases
relational-calculus
difficult
89
votes
6
answers
68
GATE CSE 2006 | Question: 72
The $2^n$ vertices of a graph $G$ corresponds to all subsets of a set of size $n$, for $n \geq 6$. Two vertices of $G$ are adjacent if and only if the corresponding sets intersect in exactly two elements. The maximum degree of a vertex in $G$ is: $\binom{\frac{n}{2}}{2}.2^{\frac{n}{2}}$ $2^{n-2}$ $2^{n-3}\times 3$ $2^{n-1}$
go_editor
asked
in
Graph Theory
Apr 24, 2016
by
go_editor
17.7k
views
gatecse-2006
graph-theory
normal
degree-of-graph
89
votes
16
answers
69
GATE CSE 2014 Set 1 | Question: 39
The minimum number of comparisons required to find the minimum and the maximum of $100$ numbers is ________
go_editor
asked
in
Algorithms
Sep 28, 2014
by
go_editor
53.9k
views
gatecse-2014-set1
algorithms
numerical-answers
normal
maximum-minimum
89
votes
5
answers
70
GATE CSE 1998 | Question: 2.17, UGCNET-Dec2012-III: 43
Consider $n$ processes sharing the CPU in a round-robin fashion. Assuming that each process switch takes $s$ seconds, what must be the quantum size $q$ such that the overhead resulting from process switching is minimized but at the same time each process is guaranteed to get ... $q \leq \frac{t-ns}{n+1}$ $q \geq \frac{t-ns}{n+1}$
Kathleen
asked
in
Operating System
Sep 25, 2014
by
Kathleen
21.8k
views
gate1998
operating-system
process-scheduling
normal
ugcnetcse-dec2012-paper3
89
votes
12
answers
71
GATE CSE 2003 | Question: 64
Let S be a stack of size $n \geq1$. Starting with the empty stack, suppose we push the first n natural numbers in sequence, and then perform $n$ pop operations. Assume that Push and Pop operations take $X$ seconds each, and $Y$ seconds elapse between the end of one such ... S. The average stack-life of an element of this stack is $n(X+Y)$ $3Y+2X$ $n(X+Y)-X$ $Y+2X$
Kathleen
asked
in
DS
Sep 17, 2014
by
Kathleen
30.8k
views
gatecse-2003
data-structures
stack
normal
88
votes
5
answers
72
GATE CSE 2015 Set 2 | Question: 55
Which one of the following well-formed formulae is a tautology? $\forall x \, \exists y \, R(x,y) \, \leftrightarrow \, \exists y \, \forall x \, R(x, y)$ ... $\forall x \, \forall y \, P(x,y) \, \rightarrow \, \forall x \, \forall y \, P(y, x)$
go_editor
asked
in
Mathematical Logic
Feb 13, 2015
by
go_editor
20.9k
views
gatecse-2015-set2
mathematical-logic
normal
first-order-logic
88
votes
8
answers
73
GATE CSE 2006 | Question: 49
An implementation of a queue $Q$, using two stacks $S1$ and $S2$, is given below: void insert (Q, x) { push (S1, x); } void delete (Q) { if (stack-empty(S2)) then if (stack-empty(S1)) then { print( Q is empty ); return; } else while (!(stack-empty(S1))){ x=pop ... and $2m\leq y\leq 2n $ $ 2m\leq x<2n $ and $2m\leq y\leq n+m $ $ 2m\leq x<2n $ and $2m\leq y\leq 2n $
Rucha Shelke
asked
in
DS
Sep 26, 2014
by
Rucha Shelke
32.7k
views
gatecse-2006
data-structures
queue
stack
normal
87
votes
7
answers
74
GATE CSE 2009 | Question: 58
Frames of $1000\text{ bits}$ are sent over a $10^6$ bps duplex link between two hosts. The propagation time is $25ms$. Frames are to be transmitted into this link to maximally pack them in transit (within the link). Let $I$ be ... before starting transmission of the next frame? (Identify the closest choice ignoring the frame processing time) $16ms$ $18ms$ $20ms$ $22ms$
go_editor
asked
in
Computer Networks
Apr 23, 2016
by
go_editor
30.0k
views
gatecse-2009
computer-networks
sliding-window
normal
87
votes
7
answers
75
GATE CSE 2004 | Question: 23, ISRO2007-32
Identify the correct translation into logical notation of the following assertion. Some boys in the class are taller than all the girls Note: $\text{taller} (x, y)$ is true if $x$ is taller than $y$ ... $(\exists x) (\text{boy}(x) \land (\forall y) (\text{girl}(y) \rightarrow \text{taller}(x, y)))$
Kathleen
asked
in
Mathematical Logic
Sep 18, 2014
by
Kathleen
110k
views
gatecse-2004
mathematical-logic
easy
isro2007
first-order-logic
86
votes
4
answers
76
GATE CSE 2017 Set 1 | Question: 39
Let $A$ and $B$ be finite alphabets and let $\#$ be a symbol outside both $A$ and $B$. Let $f$ be a total function from $A^{*}$ to $B^{*}$. We say $f$ is computable if there exists a Turing machine $M$ which given an ... $L_{f}$ is recursive, but not conversely. If $f$ is computable then $L_{f}$ is recursively enumerable, but not conversely.
Arjun
asked
in
Theory of Computation
Feb 14, 2017
by
Arjun
18.4k
views
gatecse-2017-set1
theory-of-computation
decidability
difficult
86
votes
7
answers
77
GATE CSE 2017 Set 1 | Question: 13
Consider the following C code: #include<stdio.h> int *assignval (int *x, int val) { *x = val; return x; } void main () { int *x = malloc(sizeof(int)); if (NULL == x) return; x = assignval (x,0); ... and not as shown. compiles successfully but execution may result in dangling pointer. compiles successfully but execution may result in memory leak.
Arjun
asked
in
Programming in C
Feb 14, 2017
by
Arjun
35.2k
views
gatecse-2017-set1
programming-in-c
programming
pointers
86
votes
8
answers
78
GATE CSE 2014 Set 2 | Question: 38
Suppose $P, Q, R, S, T$ are sorted sequences having lengths $20, 24, 30, 35, 50$ respectively. They are to be merged into a single sequence by merging together two sequences at a time. The number of comparisons that will be needed in the worst case by the optimal algorithm for doing this is ____.
go_editor
asked
in
Algorithms
Sep 28, 2014
by
go_editor
24.8k
views
gatecse-2014-set2
algorithms
sorting
normal
numerical-answers
86
votes
7
answers
79
GATE CSE 2009 | Question: 47
While opening a $TCP$ connection, the initial sequence number is to be derived using a time-of-day (ToD) clock that keeps running even when the host is down. The low order $32$ bits of the counter of the ToD clock is to be used for the initial sequence numbers ... sequence numbers used for packets of a connection can increase? $0.015$/s $0.064$/s $0.135$/s $0.327$/s
Kathleen
asked
in
Computer Networks
Sep 22, 2014
by
Kathleen
25.3k
views
gatecse-2009
computer-networks
tcp
difficult
ambiguous
86
votes
8
answers
80
GATE CSE 2004 | Question: 79
How many graphs on $n$ labeled vertices exist which have at least $\frac{(n^2 - 3n)}{ 2}$ edges ? $^{\left(\frac{n^2-n}{2}\right)}C_{\left(\frac{n^2-3n} {2}\right)}$ $^{{\large\sum\limits_{k=0}^{\left (\frac{n^2-3n}{2} \right )}}.\left(n^2-n\right)}C_k$ $^{\left(\frac{n^2-n}{2}\right)}C_n$ $^{{\large\sum\limits_{k=0}^n}.\left(\frac{n^2-n}{2}\right)}C_k$
Kathleen
asked
in
Graph Theory
Sep 18, 2014
by
Kathleen
14.3k
views
gatecse-2004
graph-theory
combinatory
normal
counting
Page:
« prev
1
2
3
4
5
6
7
8
9
...
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