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
55
votes
12
answers
61
GATE CSE 2006 | Question: 44
Station $A$ uses $32\; \text{byte}$ packets to transmit messages to Station $B$ using a sliding window protocol. The round trip delay between A and $B$ is $80\; \text{milliseconds}$ and the bottleneck bandwidth on the path between $A$ and $B$ is $128\; \text{kbps}$ . What is the optimal window size that $A$ should use? $20$ $40$ $160$ $320$
Rucha Shelke
asked
in
Computer Networks
Sep 26, 2014
by
Rucha Shelke
26.8k
views
gatecse-2006
computer-networks
sliding-window
normal
82
votes
12
answers
62
GATE CSE 2014 Set 1 | Question: 27
Let the size of congestion window of a TCP connection be $32$ KB when a timeout occurs. The round trip time of the connection is $100$ msec and the maximum segment size used is $2$ KB. The time taken (in msec) by the TCP connection to get back to $32$ KB congestion window is _________.
go_editor
asked
in
Computer Networks
Sep 26, 2014
by
go_editor
37.6k
views
gatecse-2014-set1
computer-networks
tcp
congestion-control
numerical-answers
normal
63
votes
12
answers
63
GATE CSE 2005 | Question: 70
Consider a disk drive with the following specifications: $16$ surfaces, $512$ tracks/surface, $512$ sectors/track, $1$ KB/sector, rotation speed $3000$ rpm. The disk is operated in cycle stealing mode whereby whenever one $4$ byte word is ready it is sent ... $40$ nsec. The maximum percentage of time that the CPU gets blocked during DMA operation is: $10$ $25$ $40$ $50$
Kathleen
asked
in
CO and Architecture
Sep 22, 2014
by
Kathleen
65.2k
views
gatecse-2005
co-and-architecture
disk
normal
dma
70
votes
12
answers
64
GATE CSE 2009 | Question: 44
The following key values are inserted into a $B+$ - tree in which order of the internal nodes is $3$, and that of the leaf nodes is $2$, in the sequence given below. The order of internal nodes is the maximum number of tree pointers in each node, and the ... $1$ The maximum number of times leaf nodes would get split up as a result of these insertions is $2$ $3$ $4$ $5$
Kathleen
asked
in
Databases
Sep 22, 2014
by
Kathleen
36.9k
views
gatecse-2009
databases
b-tree
normal
43
votes
12
answers
65
GATE CSE 2007 | Question: 24
Suppose we uniformly and randomly select a permutation from the $20 !$ permutations of $1, 2, 3\ldots ,20.$ What is the probability that $2$ appears at an earlier position than any other even number in the selected permutation? $\left(\dfrac{1}{2} \right)$ $\left(\dfrac{1}{10}\right)$ $\left(\dfrac{9!}{20!}\right)$ None of these
Kathleen
asked
in
Probability
Sep 21, 2014
by
Kathleen
15.1k
views
gatecse-2007
probability
easy
uniform-distribution
89
votes
12
answers
66
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
66
votes
12
answers
67
GATE CSE 2003 | Question: 61
In a permutation \(a_1 ... a_n\), of n distinct integers, an inversion is a pair \((a_i, a_j)\) such that \(i < j\) and \(a_i > a_j\). If all permutations are equally likely, what is the expected number of inversions in a randomly chosen permutation of \(1. . . n\)? \(\frac{n(n-1)}{2}\) \(\frac{n(n-1)}{4}\) \(\frac{n(n+1)}{4}\) \(2n[\log_2n]\)
Kathleen
asked
in
Algorithms
Sep 17, 2014
by
Kathleen
20.3k
views
gatecse-2003
algorithms
sorting
inversion
normal
56
votes
12
answers
68
GATE CSE 2003 | Question: 14
The regular expression $0^*(10^*)^*$ denotes the same set as $(1^*0)^*1^*$ $0+(0+10)^*$ $(0+1)^*10(0+1)^*$ None of the above
Kathleen
asked
in
Theory of Computation
Sep 16, 2014
by
Kathleen
19.2k
views
gatecse-2003
theory-of-computation
regular-expression
easy
37
votes
11
answers
69
GATE CSE 2021 Set 2 | Question: 10
Consider the following $\text{ANSI C}$ program. #include <stdio.h> int main() { int arr[4][5]; int i, j; for (i=0; i<4; i++) { for (j=0; j<5; j++) { arr[i][j] = 10 * i + j; } } printf(“%d”, *(arr[1]+9)); return 0; } What is the output of the above program? $14$ $20$ $24$ $30$
Arjun
asked
in
Programming in C
Feb 18, 2021
by
Arjun
29.9k
views
gatecse-2021-set2
programming-in-c
array
output
1-mark
4
votes
11
answers
70
NIELIT 2016 MAR Scientist B - Section C: 12
Which of the following sorting algorithms does not have a worst case running time of $O(n^2)$? Insertion sort. Merge sort. Quick sort. Bubble sort.
admin
asked
in
Algorithms
Mar 31, 2020
by
admin
15.5k
views
nielit2016mar-scientistb
algorithms
sorting
time-complexity
56
votes
11
answers
71
GATE CSE 2019 | Question: 45
A certain processor deploys a single-level cache. The cache block size is $8$ words and the word size is $4$ bytes. The memory system uses a $60$-MHz clock. To service a cache miss, the memory controller first takes $1$ cycle to accept ... for the memory system when the program running on the processor issues a series of read operations is ______$\times 10^6$ bytes/sec.
Arjun
asked
in
CO and Architecture
Feb 7, 2019
by
Arjun
20.3k
views
gatecse-2019
numerical-answers
co-and-architecture
cache-memory
2-marks
38
votes
11
answers
72
GATE CSE 2019 | Question: 50
What is the minimum number of $2$-input NOR gates required to implement a $4$ -variable function expressed in sum-of-minterms form as $f=\Sigma(0,2,5,7, 8, 10, 13, 15)?$ Assume that all the inputs and their complements are available. Answer: _______
Arjun
asked
in
Digital Logic
Feb 7, 2019
by
Arjun
30.2k
views
gatecse-2019
numerical-answers
digital-logic
canonical-normal-form
2-marks
42
votes
11
answers
73
GATE CSE 2018 | Question: 1
Which one of the following is a closed form expression for the generating function of the sequence $\{a_n\}$, where $a_n = 2n +3 \text{ for all } n=0, 1, 2, \dots$? $\frac{3}{(1-x)^2}$ $\frac{3x}{(1-x)^2}$ $\frac{2-x}{(1-x)^2}$ $\frac{3-x}{(1-x)^2}$
gatecse
asked
in
Combinatory
Feb 14, 2018
by
gatecse
22.6k
views
gatecse-2018
generating-functions
normal
combinatory
1-mark
85
votes
11
answers
74
GATE CSE 2017 Set 1 | Question: 08
Consider the C code fragment given below. typedef struct node { int data; node* next; } node; void join(node* m, node* n) { node* p = n; while(p->next != NULL) { p = p->next; } p->next = m; } Assuming that m and n ... append list m to the end of list n. cause a null pointer dereference for all inputs. append list n to the end of list m for all inputs.
khushtak
asked
in
DS
Feb 14, 2017
by
khushtak
25.6k
views
gatecse-2017-set1
data-structures
linked-list
normal
57
votes
11
answers
75
GATE CSE 2017 Set 1 | Question: 43
Consider the following grammar: stmt $\rightarrow$ if expr then expr else expr; stmt | $Ò$ expr $\rightarrow$ term relop term | term term $\rightarrow$ id | number id $\rightarrow$ a | b | c number $\rightarrow [0-9]$ where relop is a relational ... program if $e_1$ then $e_2$ else $e_3$ has $2$ control flow paths. $e_1 \rightarrow e_2$ and $e_1 \rightarrow e_3$.
Arjun
asked
in
Compiler Design
Feb 14, 2017
by
Arjun
20.3k
views
gatecse-2017-set1
compiler-design
parsing
normal
numerical-answers
47
votes
11
answers
76
GATE CSE 2017 Set 1 | Question: 35
Consider the following two functions. void fun1(int n) { if(n == 0) return; printf("%d", n); fun2(n - 2); printf("%d", n); } void fun2(int n) { if(n == 0) return; printf("%d", n); ... printf("%d", n); } The output printed when $\text{fun1}(5)$ is called is $53423122233445$ $53423120112233$ $53423122132435$ $53423120213243$
Arjun
asked
in
Programming in C
Feb 14, 2017
by
Arjun
20.2k
views
gatecse-2017-set1
programming
normal
tricky
recursion
35
votes
11
answers
77
GATE CSE 2017 Set 2 | Question: 13
A circular queue has been implemented using a singly linked list where each node consists of a value and a single pointer pointing to the next node. We maintain exactly two external pointers FRONT and REAR pointing to the front node and the rear node of the queue, respectively ... to the front node. (I) only. (II) only. Both (I) and (II). Neither (I) nor (II).
Madhav
asked
in
DS
Feb 14, 2017
by
Madhav
27.3k
views
gatecse-2017-set2
data-structures
queue
30
votes
11
answers
78
GATE CSE 2017 Set 2 | Question: 14
Consider the following function implemented in C: void printxy(int x, int y) { int *ptr; x=0; ptr=&x; y=*ptr; *ptr=1; printf(“%d, %d”, x, y); } The output of invoking $printxy(1,1)$ is: $0, 0$ $0, 1$ $1, 0$ $1, 1$
Madhav
asked
in
Programming in C
Feb 14, 2017
by
Madhav
9.6k
views
gatecse-2017-set2
programming-in-c
identify-function
pointers
33
votes
11
answers
79
GATE CSE 2017 Set 2 | Question: 16
Identify the language generated by the following grammar, where $S$ is the start variable. $ S \rightarrow XY$ $ X \rightarrow aX \mid a$ $ Y \rightarrow aYb \mid \epsilon$ $\{a^mb^n \mid m \geq n, n > 0 \}$ $ \{ a^mb^n \mid m \geq n, n \geq 0 \}$ $\{a^mb^n \mid m > n, n \geq 0 \}$ $\{a^mb^n \mid m > n, n > 0 \}$
khushtak
asked
in
Theory of Computation
Feb 14, 2017
by
khushtak
18.3k
views
gatecse-2017-set2
theory-of-computation
context-free-language
3
votes
11
answers
80
UGC NET CSE | January 2017 | Part 3 | Question: 31
The asymptotic upper bound solution of the recurrence relation given by $T(n) = 2T \left( \frac{n}{2} \right) +\frac{n}{\lg \: n}$ is $O(n^2)$ $O(n \:\lg \: n )$ $O(n \:\lg \:\lg \: n)$ $O(\lg \:\lg \: n)$
go_editor
asked
in
Algorithms
Jan 31, 2017
by
go_editor
5.2k
views
ugcnetcse-jan2017-paper3
algorithms
asymptotic-notation
recurrence-relation
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