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
113
votes
20
answers
21
GATE CSE 2016 Set 1 | Question: 8
We want to design a synchronous counter that counts the sequence $0-1-0-2-0-3$ and then repeats. The minimum number of $\text{J-K}$ flip-flops required to implement this counter is _____________.
Sandeep Singh
asked
in
Digital Logic
Feb 12, 2016
by
Sandeep Singh
51.8k
views
gatecse-2016-set1
digital-logic
digital-counter
flip-flop
normal
numerical-answers
113
votes
8
answers
22
GATE CSE 2013 | Question: 30
The number of elements that can be sorted in $\Theta(\log n)$ time using heap sort is $\Theta(1)$ $\Theta(\sqrt{\log} n)$ $\Theta(\frac{\log n}{\log \log n})$ $\Theta(\log n)$
Arjun
asked
in
Algorithms
Sep 24, 2014
by
Arjun
28.0k
views
gatecse-2013
algorithms
sorting
normal
heap-sort
113
votes
6
answers
23
GATE CSE 2003 | Question: 33
Consider the following formula and its two interpretations \(I_1\) and \(I_2\). \(\alpha: (\forall x)\left[P_x \Leftrightarrow (\forall y)\left[Q_{xy} \Leftrightarrow \neg Q_{yy} \right]\right] \Rightarrow (\forall x)\left[\neg P_x\right]\) \(I_1\) : Domain: ... I_1\) does not Neither \(I_1\) nor \(I_2\) satisfies \(\alpha\) Both \(I_1\) and \(I_2\) satisfies \(\alpha\)
Kathleen
asked
in
Mathematical Logic
Sep 16, 2014
by
Kathleen
15.7k
views
gatecse-2003
mathematical-logic
difficult
first-order-logic
112
votes
7
answers
24
GATE CSE 2016 Set 1 | Question: 50
Consider the following proposed solution for the critical section problem. There are $n$ processes : $P_0....P_{n-1}$. In the code, function $\text{pmax}$ ... in the critical section at any time The bounded wait condition is satisfied The progress condition is satisfied It cannot cause a deadlock
Sandeep Singh
asked
in
Operating System
Feb 12, 2016
by
Sandeep Singh
47.5k
views
gatecse-2016-set1
operating-system
process-synchronization
difficult
ambiguous
111
votes
9
answers
25
GATE CSE 2012 | Question: 38
Let $G$ be a complete undirected graph on $6$ vertices. If vertices of $G$ are labeled, then the number of distinct cycles of length $4$ in $G$ is equal to $15$ $30$ $90$ $360$
gatecse
asked
in
Graph Theory
Sep 12, 2014
by
gatecse
34.8k
views
gatecse-2012
graph-theory
normal
marks-to-all
counting
110
votes
6
answers
26
GATE CSE 2015 Set 1 | Question: 35
What is the output of the following C code? Assume that the address of $x$ is $2000$ (in decimal) and an integer requires four bytes of memory. int main () { unsigned int x [4] [3] = {{1, 2, 3}, {4, 5, 6}, {7, 8, 9}, {10, 11, 12}}; printf ("%u, %u, %u", x + 3, *(x + 3), *(x + 2) + 3); } $2036, 2036, 2036$ $2012, 4, 2204$ $2036, 10, 10$ $2012, 4, 6$
makhdoom ghaya
asked
in
Programming in C
Feb 13, 2015
by
makhdoom ghaya
27.9k
views
gatecse-2015-set1
programming
programming-in-c
array
normal
108
votes
7
answers
27
GATE CSE 2016 Set 2 | Question: 44
Consider the following languages. $L_{1} = \left\{\left\langle M \right\rangle \mid M \text{ takes at least 2016 steps on some input} \right\}$ ... not recursive $L_{1}, L_{2}$ are recursive and $L_{3}$ is not recursive $L_{1}, L_{2}, L_{3}$ are recursive
Akash Kanase
asked
in
Theory of Computation
Feb 12, 2016
by
Akash Kanase
33.5k
views
gatecse-2016-set2
theory-of-computation
recursive-and-recursively-enumerable-languages
106
votes
11
answers
28
GATE CSE 2015 Set 3 | Question: 36
Two hosts are connected via a packet switch with $10^7$ bits per second links. Each link has a propagation delay of $20$ microseconds. The switch begins forwarding a packet $35$ microseconds after it receives the same. If $10000$ bits of ... between the transmission of the first bit of data and the reception of the last bit of the data in microseconds is ______.
go_editor
asked
in
Computer Networks
Feb 15, 2015
by
go_editor
32.8k
views
gatecse-2015-set3
computer-networks
normal
numerical-answers
network-switching
106
votes
7
answers
29
GATE CSE 2013 | Question: 52
A computer uses $46\text{-bit}$ virtual address, $32\text{-bit}$ physical address, and a three-level paged page table organization. The page table base register stores the base address of the first-level table $\text{(T1)}$ ... is $64$ bytes. What is the size of a page in $\textsf{KB}$ in this computer? $2$ $4$ $8$ $16$
kanikool
asked
in
Operating System
Sep 10, 2014
by
kanikool
37.3k
views
gatecse-2013
operating-system
virtual-memory
normal
106
votes
8
answers
30
GATE CSE 2003 | Question: 66
The cube root of a natural number $n$ is defined as the largest natural number $m$ such that $(m^3 \leq n)$ . The complexity of computing the cube root of $n$ ($n$ is represented by binary notation) is $O(n)$ but not $O(n^{0.5})$ $O(n^{0.5})$ ... constant $m>0$ $O( (\log \log n)^k )$ for some constant $k > 0.5$, but not $O( (\log \log n)^{0.5} )$
Nishant T-rex
asked
in
Algorithms
Sep 2, 2014
by
Nishant T-rex
24.1k
views
gatecse-2003
algorithms
time-complexity
normal
105
votes
14
answers
31
GATE CSE 2015 Set 1 | Question: 46
Consider a uniprocessor system executing three tasks $T_{1}, T_{2}$ and $T_{3}$ each of which is composed of an infinite sequence of jobs (or instances) which arrive periodically at intervals of $3, 7$ and $20$ ... $T_{3}$ completes its execution at the end of_____________________milliseconds.
makhdoom ghaya
asked
in
Operating System
Feb 13, 2015
by
makhdoom ghaya
37.8k
views
gatecse-2015-set1
operating-system
process-scheduling
normal
numerical-answers
105
votes
8
answers
32
GATE CSE 2012 | Question: 32
Fetch_And_Add(X,i) is an atomic Read-Modify-Write instruction that reads the value of memory location $X$, increments it by the value $i$, and returns the old value of $X$. It is used in the pseudocode shown below to implement ... take on a non-zero value when the lock is actually available works correctly but may starve some processes works correctly without starvation
gatecse
asked
in
Operating System
Sep 26, 2014
by
gatecse
29.8k
views
gatecse-2012
operating-system
process-synchronization
normal
104
votes
6
answers
33
GATE CSE 2006 | Question: 61
The atomic fetch-and-set $x, y$ instruction unconditionally sets the memory location $x$ to $1$ and fetches the old value of $x$ in $y$ without allowing any intervening access to the memory location $x$ ... a pair of normal load/store can be used The implementation of $V$ is wrong The code does not implement a binary semaphore
Rucha Shelke
asked
in
Operating System
Sep 26, 2014
by
Rucha Shelke
27.5k
views
gatecse-2006
operating-system
process-synchronization
normal
103
votes
7
answers
34
GATE CSE 2017 Set 1 | Question: 36
Consider the C functions foo and bar given below: int foo(int val) { int x=0; while(val > 0) { x = x + foo(val--); } return val; } int bar(int val) { int x = 0; while(val > 0) { x ... in: Return of $6$ and $6$ respectively. Infinite loop and abnormal termination respectively. Abnormal termination and infinite loop respectively. Both terminating abnormally.
Arjun
asked
in
Programming in C
Feb 14, 2017
by
Arjun
25.2k
views
gatecse-2017-set1
programming-in-c
programming
normal
recursion
103
votes
11
answers
35
GATE CSE 2004 | Question: 85
A program takes as input a balanced binary search tree with $n$ leaf nodes and computes the value of a function $g(x)$ for each node $x$. If the cost of computing $g(x)$ ... time complexity of the program is? $\Theta (n)$ $\Theta (n \log n)$ $\Theta(n^2)$ $\Theta (n^2\log n)$
Kathleen
asked
in
DS
Sep 18, 2014
by
Kathleen
31.3k
views
gatecse-2004
binary-search-tree
normal
data-structures
102
votes
9
answers
36
GATE CSE 2017 Set 1 | Question: 25
Consider a two-level cache hierarchy with $L1$ and $L2$ caches. An application incurs $1.4$ memory accesses per instruction on average. For this application, the miss rate of $L1$ cache is $0.1$; the $L2$ cache experiences, on average, $7$ misses per $1000$ instructions. The miss rate of $L2$ expressed correct to two decimal places is ________.
Arjun
asked
in
CO and Architecture
Feb 14, 2017
by
Arjun
24.2k
views
gatecse-2017-set1
co-and-architecture
cache-memory
numerical-answers
101
votes
9
answers
37
GATE CSE 2017 Set 1 | Question: 53
Consider the following C program. #include<stdio.h> #include<string.h> void printlength(char *s, char *t) { unsigned int c=0; int len = ((strlen(s) - strlen(t)) > c) ? strlen(s) : strlen(t); printf("%d\n", len); } ... in $string.h$ as returning a value of type $size\_t$, which is an unsigned int. The output of the program is __________ .
srestha
asked
in
Programming in C
Feb 14, 2017
by
srestha
24.8k
views
gatecse-2017-set1
programming
programming-in-c
normal
numerical-answers
101
votes
3
answers
38
GATE IT 2008 | Question: 61
Let $R (A, B, C, D)$ be a relational schema with the following functional dependencies : $A → B$, $B → C$, $C → D$ and $D → B$. The decomposition of $R$ into $(A, B), (B, C), (B, D)$ gives a ... a lossless join, but is not dependency preserving does not give a lossless join, but is dependency preserving does not give a lossless join and is not dependency preserving
Ishrat Jahan
asked
in
Databases
Oct 28, 2014
by
Ishrat Jahan
35.2k
views
gateit-2008
databases
database-normalization
normal
101
votes
7
answers
39
GATE CSE 2002 | Question: 2.12
A weight-balanced tree is a binary tree in which for each node, the number of nodes in the left sub tree is at least half and at most twice the number of nodes in the right sub tree. The maximum possible height (number of nodes on the path from the root to the furthest ... which of the following? $\log_2 n$ $\log_{\frac{4}{3}} n$ $\log_3 n$ $\log_{\frac{3}{2}} n$
Kathleen
asked
in
DS
Sep 15, 2014
by
Kathleen
23.3k
views
gatecse-2002
data-structures
binary-tree
normal
100
votes
21
answers
40
GATE CSE 2016 Set 1 | Question: 54
For a host machine that uses the token bucket algorithm for congestion control, the token bucket has a capacity of $1$ $\text{megabyte}$ and the maximum output rate is $20$ $\text{megabytes}$ per $\text{second}$. Tokens arrive at a rate to ... to send $12$ $\text{megabytes}$ of data. The minimum time required to transmit the data is _____________ $\text{seconds}$.
Sandeep Singh
asked
in
Computer Networks
Feb 12, 2016
by
Sandeep Singh
41.9k
views
gatecse-2016-set1
computer-networks
token-bucket
normal
numerical-answers
Page:
« prev
1
2
3
4
5
6
7
...
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