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
93
votes
19
answers
1
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
32.4k
views
gatecse-2016-set1
computer-networks
token-bucket
normal
numerical-answers
106
votes
19
answers
2
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
44.4k
views
gatecse-2016-set1
digital-logic
digital-counter
flip-flop
normal
numerical-answers
3
votes
18
answers
3
UGC NET CSE | November 2017 | Part 3 | Question: 9
If every non-key attribute is functionally dependent on the primary key, then the relation is in ________ First normal form Second normal form Third normal form Fourth normal form
Arjun
asked
in
Databases
Nov 5, 2017
by
Arjun
3.4k
views
ugcnetcse-nov2017-paper3
database-normalization
126
votes
18
answers
4
GATE CSE 2017 Set 2 | Question: 44
Two transactions $T_1$ and $T_2$ are given as $T_1:r_1(X)w_1(X)r_1(Y)w_1(Y)$ $T_2:r_2(Y)w_2(Y)r_2(Z)w_2(Z)$ where $r_i(V)$ denotes a $\textit{read}$ operation by transaction $T_i$ on a variable $V$ and $w_i(V)$ denotes a ... by transaction $T_i$ on a variable $V$. The total number of conflict serializable schedules that can be formed by $T_1$ and $T_2$ is ______
Madhav
asked
in
Databases
Feb 14, 2017
by
Madhav
56.1k
views
gatecse-2017-set2
databases
transaction-and-concurrency
numerical-answers
conflict-serializable
74
votes
18
answers
5
GATE CSE 2016 Set 1 | Question: 39
Let $G$ be a complete undirected graph on $4$ vertices, having $6$ edges with weights being $1, 2, 3, 4, 5,$ and $6$. The maximum possible weight that a minimum weight spanning tree of $G$ can have is __________
Sandeep Singh
asked
in
Algorithms
Feb 12, 2016
by
Sandeep Singh
29.1k
views
gatecse-2016-set1
algorithms
spanning-tree
normal
numerical-answers
113
votes
18
answers
6
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
39.1k
views
gatecse-2009
computer-networks
sliding-window
normal
isro2016
77
votes
18
answers
7
GATE CSE 2004 | Question: 62
A 4-bit carry look ahead adder, which adds two 4-bit numbers, is designed using AND, OR, NOT, NAND, NOR gates only. Assuming that all the inputs are available in both complemented and uncomplemented forms and the delay of each gate is one time ... the carry network has been implemented using two-level AND-OR logic. 4 time units 6 time units 10 time units 12 time units
Kathleen
asked
in
Digital Logic
Sep 19, 2014
by
Kathleen
23.8k
views
gatecse-2004
digital-logic
normal
adder
124
votes
18
answers
8
GATE CSE 2004 | Question: 47
Consider a system with a two-level paging scheme in which a regular memory access takes $150$ $nanoseconds$, and servicing a page fault takes $8$ $milliseconds$. An average instruction takes $100$ nanoseconds of CPU time, and two memory accesses. ... execution time? $\text{645 nanoseconds}$ $\text{1050 nanoseconds}$ $\text{1215 nanoseconds}$ $\text{1230 nanoseconds}$
gatecse
asked
in
CO and Architecture
Sep 5, 2014
by
gatecse
50.4k
views
gatecse-2004
co-and-architecture
virtual-memory
normal
53
votes
17
answers
9
GATE CSE 2016 Set 1 | Question: 26
The coefficient of $x^{12}$ in $\left(x^{3}+x^{4}+x^{5}+x^{6}+\dots \right)^{3}$ is ___________.
Sandeep Singh
asked
in
Combinatory
Feb 12, 2016
by
Sandeep Singh
20.4k
views
gatecse-2016-set1
combinatory
generating-functions
normal
numerical-answers
151
votes
16
answers
10
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
39.2k
views
gatecse-2016-set2
data-structures
binary-search-tree
normal
numerical-answers
17
votes
15
answers
11
GATE CSE 2019 | Question: 21
The value of $3^{51} \text{ mod } 5$ is _____
Arjun
asked
in
Combinatory
Feb 7, 2019
by
Arjun
14.4k
views
gatecse-2019
numerical-answers
combinatory
modular-arithmetic
1-mark
44
votes
15
answers
12
GATE CSE 2017 Set 1 | Question: 22
Consider the language $L$ given by the regular expression $(a+b)^{*} b (a+b)$ over the alphabet $\{a,b\}$. The smallest number of states needed in a deterministic finite-state automaton (DFA) accepting $L$ is ___________ .
Arjun
asked
in
Theory of Computation
Feb 14, 2017
by
Arjun
24.6k
views
gatecse-2017-set1
theory-of-computation
finite-automata
numerical-answers
minimal-state-automata
57
votes
15
answers
13
GATE CSE 2007 | Question: 15, ISRO2016-26
Consider the following segment of C-code: int j, n; j = 1; while (j <= n) j = j * 2; The number of comparisons made in the execution of the loop for any $n > 0$ is: $\lceil \log_2n \rceil +1$ $n$ $\lceil \log_2n \rceil$ $\lfloor \log_2n \rfloor +1$
Arjun
asked
in
Algorithms
Jul 6, 2016
by
Arjun
26.3k
views
gatecse-2007
algorithms
time-complexity
normal
isro2016
60
votes
15
answers
14
GATE CSE 2015 Set 3 | Question: 5
The number of $4$ digit numbers having their digits in non-decreasing order (from left to right) constructed by using the digits belonging to the set $\{1, 2, 3\}$ is ________.
go_editor
asked
in
Combinatory
Feb 14, 2015
by
go_editor
11.6k
views
gatecse-2015-set3
combinatory
normal
numerical-answers
86
votes
15
answers
15
GATE IT 2007 | Question: 83
The head of a hard disk serves requests following the shortest seek time first (SSTF) policy. What is the maximum cardinality of the request set, so that the head changes its direction after servicing every request if the total number of tracks are $2048$ and the head can start from any track? $9$ $10$ $11$ $12$
Ishrat Jahan
asked
in
Operating System
Oct 31, 2014
by
Ishrat Jahan
17.9k
views
gateit-2007
operating-system
disk-scheduling
normal
71
votes
15
answers
16
GATE CSE 2012 | Question: 33
Suppose a fair six-sided die is rolled once. If the value on the die is $1, 2,$ or $3,$ the die is rolled a second time. What is the probability that the sum total of values that turn up is at least $6$ ? $\dfrac{10}{21}$ $\dfrac{5}{12}$ $\dfrac{2}{3}$ $\dfrac{1}{6}$
gatecse
asked
in
Probability
Sep 26, 2014
by
gatecse
17.4k
views
gatecse-2012
probability
conditional-probability
normal
66
votes
15
answers
17
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
20.8k
views
gatecse-2005
algorithms
sorting
normal
56
votes
14
answers
18
GATE CSE 2018 | Question: 46
The number of possible min-heaps containing each value from $\{1,2,3,4,5,6,7\}$ exactly once is _______
gatecse
asked
in
DS
Feb 14, 2018
by
gatecse
29.6k
views
gatecse-2018
binary-heap
numerical-answers
combinatory
2-marks
90
votes
14
answers
19
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
29.1k
views
gatecse-2015-set1
operating-system
process-scheduling
normal
numerical-answers
76
votes
14
answers
20
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
45.4k
views
gatecse-2014-set1
algorithms
numerical-answers
normal
maximum-minimum
Page:
1
2
3
4
5
6
...
2936
next »
Subscribe to GATE CSE 2023 Test Series
Subscribe to GO Classes for GATE CSE 2023
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
DRDO Previous Year Papers
From Rank 4200 to 64: My Journey to Success in GATE CSE Exam
What are the key things to focus on during the final 10-15 days before the GATE exam to improve performance?
All India GO Classes Mock test
NTA UGC NET JRF December 2022 Apply Online Form 2023
Subjects
All categories
General Aptitude
(2.5k)
Engineering Mathematics
(9.3k)
Digital Logic
(3.3k)
Programming and DS
(5.8k)
Algorithms
(4.6k)
Theory of Computation
(6.7k)
Compiler Design
(2.3k)
Operating System
(5.0k)
Databases
(4.6k)
CO and Architecture
(3.8k)
Computer Networks
(4.6k)
Non GATE
(1.3k)
Others
(2.4k)
Admissions
(649)
Exam Queries
(842)
Tier 1 Placement Questions
(17)
Job Queries
(74)
Projects
(9)
Unknown Category
(853)
Recent Blog Comments
Can Someone guide me how to prepare for interview...
It's not a standard resource, don't follow them.
https://byjus.com/maths/diagonalization/
@amit166 can you share the reference of the...
Twist at every point Man
Network Sites
GO Mechanical
GO Electrical
GO Electronics
GO Civil
CSE Doubts
Aptitude Overflow