Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Recent
Hot!
Most votes
Most answers
Most views
Previous GATE
Featured
Most answered questions
34
votes
9
answers
281
GATE CSE 2008 | Question: 58
A computer on a $10\text{Mbps}$ network is regulated by a token bucket. The token bucket is filled at a rate of $2\text{Mbps}$. It is initially filled to capacity with $16\text{Megabits}$. What is the maximum duration for which the computer can transmit at the full $10\text{Mbps}$? $1.6$ seconds $2$ seconds $5$ seconds $8$ seconds
A computer on a $10\text{Mbps}$ network is regulated by a token bucket. The token bucket is filled at a rate of $2\text{Mbps}$. It is initially filled to capacity with $1...
Kathleen
25.6k
views
Kathleen
asked
Sep 12, 2014
Computer Networks
gatecse-2008
computer-networks
token-bucket
+
–
114
votes
9
answers
282
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$
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$$36...
gatecse
35.4k
views
gatecse
asked
Sep 12, 2014
Graph Theory
gatecse-2012
graph-theory
normal
marks-to-all
counting
+
–
25
votes
9
answers
283
GATE CSE 2008 | Question: 1
$\displaystyle \lim_{x \to \infty}\frac{x-\sin x}{x+\cos x}$ equals $1$ $-1$ $\infty$ $-\infty$
$\displaystyle \lim_{x \to \infty}\frac{x-\sin x}{x+\cos x}$ equals$1$$-1$$\infty$$-\infty$
Kathleen
10.2k
views
Kathleen
asked
Sep 11, 2014
Calculus
gatecse-2008
calculus
limits
easy
+
–
81
votes
9
answers
284
GATE CSE 2013 | Question: 44
Consider the following operation along with Enqueue and Dequeue operations on queues, where $k$ is a global parameter. MultiDequeue(Q){ m = k while (Q is not empty) and (m > 0) { Dequeue(Q) m = m – 1 } } What is the worst case time complexity of a sequence of $n$ queue operations on an initially empty queue? $Θ(n)$ $Θ(n + k)$ $Θ(nk)$ $Θ(n^2)$
Consider the following operation along with Enqueue and Dequeue operations on queues, where $k$ is a global parameter.MultiDequeue(Q){ m = k while (Q is not empty) and (m...
gatecse
31.8k
views
gatecse
asked
Aug 7, 2014
DS
gatecse-2013
data-structures
algorithms
normal
queue
+
–
5
votes
8
answers
285
GATE CSE 2024 | Set 1 | Question: 2
The product of all eigenvalues of the matrix $\left[\begin{array}{lll}1 & 2 & 3 \\ 4 & 5 & 6 \\ 7 & 8 & 9\end{array}\right]$ is $-1$ $0$ $1$ $2$
The product of all eigenvalues of the matrix $\left[\begin{array}{lll}1 & 2 & 3 \\ 4 & 5 & 6 \\ 7 & 8 & 9\end{array}\right]$ is$-1$$0$$1$$2$
Arjun
3.2k
views
Arjun
asked
Feb 16
Linear Algebra
gatecse2024-set1
linear-algebra
eigen-value
+
–
58
votes
8
answers
286
GO Classes CS 2025 | Weekly Quiz 1 | Propositional Logic | Question: 14
Consider the following popular puzzle. When asked for the ages of her three children, Mrs. Baker says that Alice is her youngest child if Bill is not her youngest child, and that Alice is not her youngest child ... is her youngest child. Carl is her youngest child. Information is not sufficient to find out the youngest child.
Consider the following popular puzzle.When asked for the ages of her three children, Mrs. Baker says that “Alice is her youngest child if Bill is not her youngest child...
GO Classes
3.9k
views
GO Classes
asked
Mar 30, 2022
Mathematical Logic
goclasses2025_cs_wq1
goclasses
mathematical-logic
propositional-logic
2-marks
+
–
14
votes
8
answers
287
GATE CSE 2021 Set 1 | Question: 7
Let $p$ and $q$ be two propositions. Consider the following two formulae in propositional logic. $S_1: (\neg p\wedge(p\vee q))\rightarrow q$ $S_2: q\rightarrow(\neg p\wedge(p\vee q))$ Which one of the following choices is correct? Both $S_1$ and ... but $S_2$ is not a tautology $S_1$ is not a tautology but $S_2$ is a tautology Neither $S_1$ nor $S_2$ is a tautology
Let $p$ and $q$ be two propositions. Consider the following two formulae in propositional logic.$S_1: (\neg p\wedge(p\vee q))\rightarrow q$$S_2: q\rightarrow(\neg p\wedge...
Arjun
8.6k
views
Arjun
asked
Feb 18, 2021
Mathematical Logic
gatecse-2021-set1
mathematical-logic
propositional-logic
1-mark
+
–
1
votes
8
answers
288
UGC NET CSE | June 2005 | Part 2 | Question: 12
Find the output of the following $“C”$ code : Main() { int x=20, y=35; x=y++ + x++; y=++y + ++x; printf (“%d, %d\n”, x, y); } $55, 93$ $53, 97$ $56, 95$ $57, 94$
Find the output of the following $“C”$ code :Main() { int x=20, y=35; x=y++ + x++; y=++y + ++x; printf (“%d, %d\n”, x, y); }$55, 93$$53, 97$$56, 95$$57, 94$
go_editor
2.4k
views
go_editor
asked
Mar 26, 2020
Programming in C
ugcnetcse-june2005-paper2
programming-in-c
variable-scope
+
–
2
votes
8
answers
289
UGC NET CSE | January 2017 | Part 2 | Question: 33
Consider the following statements related to compiler construction: Lexical Analysis is specified by context-free grammars and implemented by pushdown automata. Syntax Analysis is specified by regular expressions and implemented by finite-state machine. Which of the above statement(s) is/are correct? Only I Only II Both I and II Neither I nor II
Consider the following statements related to compiler construction:Lexical Analysis is specified by context-free grammars and implemented by pushdown automata.Syntax Anal...
go_editor
4.2k
views
go_editor
asked
Mar 24, 2020
Compiler Design
ugcnetjan2017ii
compiler-design
lexical-analysis
+
–
28
votes
8
answers
290
GATE CSE 2020 | Question: 42
The number of permutations of the characters in LILAC so that no character appears in its original position, if the two L’s are indistinguishable, is ______.
The number of permutations of the characters in LILAC so that no character appears in its original position, if the two L’s are indistinguishable, is ______.
Arjun
16.7k
views
Arjun
asked
Feb 12, 2020
Combinatory
gatecse-2020
numerical-answers
combinatory
2-marks
+
–
5
votes
8
answers
291
Andrew S. Tanenbaum (OS) Edition 4 Exercise 2 Question 39 (Page No. 177)
Consider the following piece of C code: void main( ) { fork( ); fork( ); exit( ); } How many child processes are created upon execution of this program?
Consider the following piece of C code: void main( ) { fork( ); fork( ); exit( ); }How many child processes are created upon execution of this program?
admin
3.6k
views
admin
asked
Oct 25, 2019
Operating System
tanenbaum
operating-system
process-and-threads
fork-system-call
descriptive
+
–
8
votes
8
answers
292
GATE2011 AG: GA-4
There are two candidates $P$ and $Q$ in an election. During the campaign, $40\%$ of the voters promised to vote for $P,$ and rest for $Q.$ However, on the day of election $15\%$ of the voters went back on their promise to vote for $P$ ... instead voted for $P.$ Suppose$,P$ lost by $2$ votes$,$ then what was the total number of voters? $100$ $110$ $90$ $95$
There are two candidates $P$ and $Q$ in an election. During the campaign, $40\%$ of the voters promised to vote for $P,$ and rest for $Q.$ However, on the day of election...
admin
8.8k
views
admin
asked
May 14, 2019
Quantitative Aptitude
general-aptitude
quantitative-aptitude
gate2011-ag
percentage
+
–
1
votes
8
answers
293
Gate 2019 answer key
I want to challenge the recursive question of gate 2019.Can u suggest what supporting document can be placed?
I want to challenge the recursive question of gate 2019.Can u suggest what supporting document can be placed?
mradul
2.4k
views
mradul
asked
Feb 21, 2019
GATE
final-answer-key-gate-2019
gate-2019
+
–
11
votes
8
answers
294
GATE CSE 2019 | Question: GA-4
Ten friends planned to share equally the cost of buying a gift for their teacher. When two of them decided not to contribute, each of the other friends had to pay Rs. $150$ more. The cost of the gift was Rs. ____ $666$ $3000$ $6000$ $12000$
Ten friends planned to share equally the cost of buying a gift for their teacher. When two of them decided not to contribute, each of the other friends had to pay Rs. $15...
Arjun
8.2k
views
Arjun
asked
Feb 7, 2019
Quantitative Aptitude
gatecse-2019
general-aptitude
quantitative-aptitude
cost-market-price
1-mark
+
–
23
votes
8
answers
295
GATE CSE 2019 | Question: 1
A certain processor uses a fully associative cache of size $16$ kB, The cache block size is $16$ bytes. Assume that the main memory is byte addressable and uses a $32$-bit address. How many bits are required for the Tag and the Index fields respectively in the addresses ... $0$ bits $28$ bits and $4$ bits $24$ bits and $4$ bits $28$ bits and $0$ bits
A certain processor uses a fully associative cache of size $16$ kB, The cache block size is $16$ bytes. Assume that the main memory is byte addressable and uses a $32$-bi...
Arjun
18.1k
views
Arjun
asked
Feb 7, 2019
CO and Architecture
gatecse-2019
co-and-architecture
cache-memory
normal
1-mark
+
–
24
votes
8
answers
296
GATE CSE 2019 | Question: 17
The following C program is executed on a Unix/Linux system : #include<unistd.h> int main() { int i; for(i=0; i<10; i++) if(i%2 == 0) fork(); return 0; } The total number of child processes created is ________________ .
The following C program is executed on a Unix/Linux system :#include<unistd.h int main() { int i; for(i=0; i<10; i++) if(i%2 == 0) fork(); return 0; }The total number of ...
Arjun
17.6k
views
Arjun
asked
Feb 7, 2019
Operating System
gatecse-2019
numerical-answers
operating-system
fork-system-call
1-mark
+
–
23
votes
8
answers
297
GATE CSE 2019 | Question: 26
Consider the following C function. void convert (int n ) { if (n<0) printf{ %d , n); else { convert(n/2); printf( %d , n%2); } } Which one of the following will happen when the function convert is called with any positive ... order and terminate It will print the binary representation of $n$ but will not terminate It will not print anything and will not terminate
Consider the following C function.void convert (int n ) { if (n<0) printf{“%d”, n); else { convert(n/2); printf(“%d”, n%2); } }Which one of the following will hap...
Arjun
16.9k
views
Arjun
asked
Feb 7, 2019
Algorithms
gatecse-2019
algorithms
identify-function
2-marks
+
–
47
votes
8
answers
298
GATE CSE 2019 | Question: 37
There are $n$ unsorted arrays: $A_1, A_2, \dots, A_n$. Assume that $n$ is odd.Each of $A_1, A_2, \dots, A_n$ contains $n$ distinct elements. There are no common elements between any two arrays. The worst-case time complexity of computing the median of the medians of $A_1, A_2, \dots , A_n$ is $O(n)$ $O(n \: \log \: n)$ $O(n^2)$ $\Omega (n^2 \log n)$
There are $n$ unsorted arrays: $A_1, A_2, \dots, A_n$. Assume that $n$ is odd.Each of $A_1, A_2, \dots, A_n$ contains $n$ distinct elements. There are no common elements ...
Arjun
35.7k
views
Arjun
asked
Feb 7, 2019
Algorithms
gatecse-2019
algorithms
time-complexity
2-marks
+
–
13
votes
8
answers
299
Two dimensional array
Consider a 2 dimensional array A[40...95,40...95] in lower triangular matrix representation. The size of each element of array is 1 Byte.If array is implemented in memory as Row major,with base address as 1000,the address of A[66][50] is ..... Ans. 1361
Consider a 2 dimensional array A[40...95,40...95] in lower triangular matrix representation. The size of each element of array is 1 Byte.If array is implemented in memory...
Na462
5.6k
views
Na462
asked
Aug 22, 2018
DS
programming-in-c
array
pointers
data-structures
+
–
0
votes
8
answers
300
UGC NET CSE | July 2018 | Part 2 | Question: 26
A binary search tree in which every non-leaf node has non-empty left and right subtrees is called a strictly binary tree. Such a tree with 19 leaves: cannot have more than 37 nodes has exactly 37 nodes has exactly 35 nodes cannot have more than 35 nodes
A binary search tree in which every non-leaf node has non-empty left and right subtrees is called a strictly binary tree. Such a tree with 19 leaves:cannot have more than...
Pooja Khatri
3.7k
views
Pooja Khatri
asked
Jul 13, 2018
DS
ugcnetcse-july2018-paper2
data-structures
binary-search-tree
+
–
Page:
« prev
1
...
10
11
12
13
14
15
16
17
18
19
20
...
3233
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register