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 viewed questions
3
votes
2
answers
21
Operating systems efficiency
CPU Efficiency is very less in case of: (a) Batch OS (b) Multi-Programming OS (c) Multi-tasking OS (d) Multi-Processing OS
Cordelia
asked
in
Operating System
Feb 4, 2018
by
Cordelia
54.0k
views
89
votes
16
answers
22
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
44
votes
4
answers
23
GATE CSE 2006 | Question: 52
The median of $n$ elements can be found in $O(n)$ time. Which one of the following is correct about the complexity of quick sort, in which median is selected as pivot? $\Theta (n)$ $\Theta (n \log n)$ $\Theta (n^{2})$ $\Theta (n^{3})$
Rucha Shelke
asked
in
Algorithms
Sep 26, 2014
by
Rucha Shelke
53.3k
views
gatecse-2006
algorithms
sorting
easy
113
votes
20
answers
24
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.9k
views
gatecse-2016-set1
digital-logic
digital-counter
flip-flop
normal
numerical-answers
128
votes
6
answers
25
GATE CSE 2001 | Question: 2.23
$R(A,B,C,D)$ is a relation. Which of the following does not have a lossless join, dependency preserving $BCNF$ decomposition? $A \rightarrow B, B \rightarrow CD$ $A \rightarrow B, B \rightarrow C, C \rightarrow D$ $ AB \rightarrow C, C \rightarrow AD$ $A \rightarrow BCD$
Kathleen
asked
in
Databases
Sep 14, 2014
by
Kathleen
51.6k
views
gatecse-2001
databases
database-normalization
normal
168
votes
17
answers
26
GATE CSE 2016 Set 2 | Question: 40
The number of ways in which the numbers $1, 2, 3, 4, 5, 6, 7$ can be inserted in an empty binary search tree, such that the resulting tree has height $6$, is _________. Note: The height of a tree with a single node is $0$.
Akash Kanase
asked
in
DS
Feb 12, 2016
by
Akash Kanase
49.7k
views
gatecse-2016-set2
data-structures
binary-search-tree
normal
numerical-answers
58
votes
7
answers
27
GATE IT 2008 | Question: 4
What is the size of the smallest $\textsf{MIS}$ (Maximal Independent Set) of a chain of nine nodes? $5$ $4$ $3$ $2$
Ishrat Jahan
asked
in
Graph Theory
Oct 27, 2014
by
Ishrat Jahan
49.7k
views
gateit-2008
normal
graph-connectivity
126
votes
18
answers
28
GATE CSE 2009 | Question: 57, ISRO2016-75
Frames of $\text{1000 bits}$ are sent over a $10^6$ $\text{bps}$ duplex link between two hosts. The propagation time is $\text{25 ms}$. Frames are to be transmitted into this link to maximally pack them in transit (within the link). What is the ... ? Assume that no time gap needs to be given between transmission of two frames. $I=2$ $I=3$ $I=4$ $I=5$
Kathleen
asked
in
Computer Networks
Sep 22, 2014
by
Kathleen
48.4k
views
gatecse-2009
computer-networks
sliding-window
normal
isro2016
77
votes
8
answers
29
GATE CSE 2005 | Question: 74
Suppose the round trip propagation delay for a $10\text{ Mbps}$ Ethernet having $48\text{-bit}$ jamming signal is $46.4\ \mu s$. The minimum frame size is: $94$ $416$ $464$ $512$
Kathleen
asked
in
Computer Networks
Sep 22, 2014
by
Kathleen
48.3k
views
gatecse-2005
computer-networks
mac-protocol
ethernet
96
votes
9
answers
30
GATE CSE 2013 | Question: 45
Consider an instruction pipeline with five stages without any branch prediction: Fetch Instruction (FI), Decode Instruction (DI), Fetch Operand (FO), Execute Instruction (EI) and Write Operand (WO). The stage delays for FI, DI, FO, EI and WO are ... during the execution of this program, the time (in ns) needed to complete the program is $132$ $165$ $176$ $328$
Kriss Singh
asked
in
CO and Architecture
Sep 5, 2014
by
Kriss Singh
47.9k
views
gatecse-2013
normal
co-and-architecture
pipelining
35
votes
6
answers
31
GATE CSE 1995 | Question: 1.16
For merging two sorted lists of sizes $m$ and $n$ into a sorted list of size $m+n$, we require comparisons of $O(m)$ $O(n)$ $O(m+n)$ $O(\log m + \log n)$
Kathleen
asked
in
Algorithms
Oct 8, 2014
by
Kathleen
47.6k
views
gate1995
algorithms
sorting
normal
112
votes
7
answers
32
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.6k
views
gatecse-2016-set1
operating-system
process-synchronization
difficult
ambiguous
14
votes
5
answers
33
How to find the complexity of T(n)=T(sqrt(n)) + 1 ?
Please tell me the complete steps how to solve this problem. $ T(n) = T ( \sqrt n )+ 1$
Jonathan Decosta
asked
in
Algorithms
Jun 10, 2015
by
Jonathan Decosta
46.9k
views
algorithms
recurrence-relation
5
votes
2
answers
34
How many transitive relations are there on a set with n elements if a)n=1 b) n=2 c) n=3
How many transitive relations are there on a set with n elements if a)n=1 b) n=2 c) n=3
Sanjay Sharma
asked
in
Set Theory & Algebra
Mar 7, 2017
by
Sanjay Sharma
46.4k
views
142
votes
4
answers
35
GATE CSE 2005 | Question: 68
A $5$ stage pipelined CPU has the following sequence of stages: IF - instruction fetch from instruction memory RD - Instruction decode and register read EX - Execute: ALU operation for data and address computation MA - Data memory access - for write access, the ... taken to complete the above sequence of instructions starting from the fetch of $I_1$? $8$ $10$ $12$ $15$
Kathleen
asked
in
CO and Architecture
Sep 22, 2014
by
Kathleen
46.2k
views
gatecse-2005
co-and-architecture
pipelining
normal
121
votes
15
answers
36
GATE CSE 2003 | Question: 78
A processor uses $2-level$ page tables for virtual to physical address translation. Page tables for both levels are stored in the main memory. Virtual and physical addresses are both $32$ bits wide. The memory is byte addressable. For virtual to physical address translation, the ... virtual address is approximately (to the nearest $0.5$ ns) $1.5$ ns $2$ ns $3$ ns $4$ ns
gatecse
asked
in
Operating System
Sep 15, 2014
by
gatecse
46.0k
views
gatecse-2003
operating-system
normal
virtual-memory
51
votes
10
answers
37
GATE CSE 2020 | Question: 53
Consider a paging system that uses $1$-level page table residing in main memory and a $\textsf{TLB}$ for address translation. Each main memory access takes $100$ ns and $\textsf{TLB}$ lookup takes $20$ ns. Each page transfer to/from the disk ... $1$ decimal places) is ___________
Arjun
asked
in
Operating System
Feb 12, 2020
by
Arjun
45.1k
views
gatecse-2020
numerical-answers
operating-system
virtual-memory
2-marks
13
votes
3
answers
38
relation
Number of relations $S$ over set $\{0,1,2,3 \}$ such that $(x,y) \in S \Rightarrow x = y$
Lakshman Bhaiya
asked
in
Set Theory & Algebra
Dec 27, 2017
by
Lakshman Bhaiya
44.5k
views
set-theory&algebra
relations
83
votes
6
answers
39
GATE CSE 2017 Set 1 | Question: 31
Let $A$ be $n\times n$ real valued square symmetric matrix of rank $2$ with $\sum_{i=1}^{n}\sum_{j=1}^{n}A^{2}_{ij} = 50.$ Consider the following statements. One eigenvalue must be in $\left [ -5,5 \right ]$ The eigenvalue ... than $5$ Which of the above statements about eigenvalues of $A$ is/are necessarily CORRECT? Both I and II I only II only Neither I nor II
Arjun
asked
in
Linear Algebra
Feb 14, 2017
by
Arjun
44.4k
views
gatecse-2017-set1
linear-algebra
eigen-value
normal
60
votes
9
answers
40
GATE CSE 2003 | Question: 36
How many perfect matching are there in a complete graph of $6$ vertices? $15$ $24$ $30$ $60$
Kathleen
asked
in
Graph Theory
Sep 16, 2014
by
Kathleen
43.8k
views
gatecse-2003
graph-theory
graph-matching
normal
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