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
User nvs16
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by nvs16
7
answers
1
GATE CSE 2019 | Question: 40
Consider the following statements: The smallest element in a max-heap is always at a leaf node The second largest element in a max-heap is always a child of a root node A max-heap can be constructed from a binary search tree in $\Theta(n)$ time A binary search tree ... time Which of the above statements are TRUE? I, II and III I, II and IV I, III and IV II, III and IV
commented
in
DS
May 6, 2021
20.5k
views
gatecse-2019
data-structures
binary-heap
2-marks
4
answers
2
Segmentation
Segmentation may contain a) Internal fragmentation b) External fragmentation c) Both d) None Also please explain the answer...
commented
in
Operating System
Jan 24, 2021
23.3k
views
2
answers
3
GATE CSE 2008 | Question: 36
Which of the following are NOT true in a pipelined processor? Bypassing can handle all RAW hazards Register renaming can eliminate all register carried WAR hazards Control hazard penalties can be eliminated by dynamic branch prediction I and II only I and III only II and III only I, II and III
commented
in
CO and Architecture
Dec 10, 2020
22.0k
views
gatecse-2008
pipelining
co-and-architecture
normal
1
answer
4
Pipelining
Consider 4 stage instruction pipeline where different instructions are spending different cycles at different stages shown below: S1 S2 S3 S4 I1 1 3 2 1 I2 1 1 3 2 I3 3 1 1 1 I4 1 2 1 1 The following loop is executed in the pipeline for ... The number of cycles saved using the loop level parallelism over without loop level parallelism to executed the above program is _______ (in cycles).
commented
in
CO and Architecture
Dec 10, 2020
2.2k
views
7
answers
5
GATE IT 2008 | Question: 29
If $M$ is a square matrix with a zero determinant, which of the following assertion (s) is (are) correct? S1: Each row of $M$ can be represented as a linear combination of the other rows S2: Each column of $M$ can be represented as a linear combination of the other columns S3 ... solution S4: $M$ has an inverse $S3$ and $S2$ $S1$ and $S4$ $S1$ and $S3$ $S1, S2$ and $S3$
commented
in
Linear Algebra
Dec 8, 2020
9.6k
views
gateit-2008
linear-algebra
normal
matrix
2
answers
6
lost update problem
If schedule is Serializable then free from WW, RW,WR .But Lost update may be possible . please explain how in serializable schedule lost update problem still exist.
commented
in
Databases
Dec 8, 2020
4.2k
views
1
answer
7
Leaky bucket
commented
in
Computer Networks
Dec 7, 2020
4.2k
views
leaky-bucket
computer-networks
3
answers
8
Leaky bucket algorithm
commented
in
Computer Networks
Dec 7, 2020
2.1k
views
leaky-bucket
computer-networks
congestion-control
4
answers
9
GATE CSE 1994 | Question: 2.4
The number of subsets $\left\{ 1,2, \dots, n\right\}$ with odd cardinality is ___________
commented
in
Set Theory & Algebra
Dec 1, 2020
5.6k
views
gate1994
set-theory&algebra
easy
set-theory
fill-in-the-blanks
6
answers
10
GATE CSE 2019 | Question: 38
Let $G$ be any connected, weighted, undirected graph. $G$ has a unique minimum spanning tree, if no two edges of $G$ have the same weight. $G$ has a unique minimum spanning tree, if, for every cut of $G$, there is a unique minimum-weight edge crossing the cut. Which of the following statements is/are TRUE? I only II only Both I and II Neither I nor II
commented
in
Graph Theory
Nov 20, 2020
20.4k
views
gatecse-2019
engineering-mathematics
discrete-mathematics
graph-theory
graph-connectivity
2-marks
1
answer
11
TIFR CSE 2018 | Part B | Question: 12
Consider the following statements: For every positive integer $n,$ let $\#{n}$ be the product of all primes less than or equal to $n.$ Then, $\# {p}+1$ is a prime, for every prime $p.$ $\large\pi$ is a universal constant ... . Only statement (ii) is correct. Only statement (iii) is correct. Only statement (iv) is correct. None of the statements are correct.
commented
in
Theory of Computation
Oct 19, 2020
2.1k
views
tifr2018
theory-of-computation
regular-language
2
answers
12
TIFR CSE 2013 | Part B | Question: 6
Let $L$ and $L'$ be languages over the alphabet $\Sigma $. The left quotient of $L$ by $L'$ is $L/L'\overset{{def}}{=} \left\{w \in \Sigma^* : wx ∈ L\text{ for some }x \in L'\right\}$ ... then $L$ is regular. $L/L'$ is a subset of $L$. If $L/L'$ and $L'$ are regular, then $L$ is regular.
commented
in
Theory of Computation
Oct 19, 2020
3.0k
views
tifr2013
theory-of-computation
regular-language
2
answers
13
GATE IT 2006 | Question: 80
Let $L$ be a regular language. Consider the constructions on $L$ below: repeat $(L) = \{ww \mid w \in L\}$ prefix $(L) = \{u \mid ∃v : uv \in L\}$ suffix $(L) = \{v \mid ∃u : uv \in L\}$ half $(L) = \{u \mid ∃v : | v | = | u | \text{ and } uv \in L\}$ Which of the constructions could lead to a non-regular language? Both I and IV Only I Only IV Both II and III
commented
in
Theory of Computation
Oct 19, 2020
9.3k
views
gateit-2006
theory-of-computation
normal
regular-language
12
answers
14
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
commented
in
Theory of Computation
Oct 18, 2020
19.2k
views
gatecse-2003
theory-of-computation
regular-expression
easy
2
answers
15
GATE CSE 1997 | Question: 70
Following is a state table for time finite state machine. ... . For example if states $X$ and $Y$ are equivalent then use $XY$ as the name for the equivalent state in the minimal machine).
comment edited
in
Theory of Computation
Oct 17, 2020
7.8k
views
gate1997
theory-of-computation
minimal-state-automata
descriptive
11
answers
16
GATE CSE 2008 | Question: 52
Match the following NFAs with the regular expressions they correspond to: P Q R S $\epsilon + 0\left(01^*1+00\right)^*01^*$ $\epsilon + 0\left(10^*1+00\right)^*0$ $\epsilon + 0\left(10^*1+10\right)^*1$ $\epsilon + 0\left(10^*1+10\right)^*10^*$ $P-2, Q-1, R-3, S-4$ $P-1, Q-3, R-2, S-4$ $P-1, Q-2, R-3, S-4$ $P-3, Q-2, R-1, S-4$
commented
in
Theory of Computation
Oct 16, 2020
12.6k
views
gatecse-2008
theory-of-computation
finite-automata
normal
4
answers
17
GATE CSE 2017 Set 1 | Question: 39
Let $A$ and $B$ be finite alphabets and let $\#$ be a symbol outside both $A$ and $B$. Let $f$ be a total function from $A^{*}$ to $B^{*}$. We say $f$ is computable if there exists a Turing machine $M$ which given an ... $L_{f}$ is recursive, but not conversely. If $f$ is computable then $L_{f}$ is recursively enumerable, but not conversely.
commented
in
Theory of Computation
Oct 15, 2020
18.4k
views
gatecse-2017-set1
theory-of-computation
decidability
difficult
6
answers
18
GATE CSE 2019 | Question: 15
For $\Sigma = \{a ,b \}$, let us consider the regular language $L=\{x \mid x = a^{2+3k} \text{ or } x=b^{10+12k}, k \geq 0\}$. Which one of the following can be a pumping length (the constant guaranteed by the pumping lemma) for $L$ ? $3$ $5$ $9$ $24$
commented
in
Theory of Computation
Oct 9, 2020
34.0k
views
gatecse-2019
theory-of-computation
pumping-lemma
1-mark
10
answers
19
GATE IT 2004 | Question: 88
Suppose that the maximum transmit window size for a TCP connection is $12000$ $\text{bytes}$. Each packet consists of $2000$ $\text{bytes}$. At some point in time, the connection is in slow-start phase with a current transmit window of $4000$ $\text{bytes}$. ... transmit window? $4000$ $\text{bytes}$ $8000$ $\text{bytes}$ $10000$ $\text{bytes}$ $12000$ $\text{bytes}$
commented
in
Computer Networks
Oct 6, 2020
23.8k
views
gateit-2004
computer-networks
sliding-window
normal
2
answers
20
general doubt
Many questions in Gate IT has been asked about data communication part like serial communication, multiplexing etc in compuer networks. But are these things in syllabus of 2017?
commented
in
Computer Networks
Oct 1, 2020
620
views
gate2017
syllabus
7
answers
21
GATE IT 2005 | Question: 85b
Consider a simple graph with unit edge costs. Each node in the graph represents a router. Each node maintains a routing table indicating the next hop router to be used to relay a packet to its destination and the cost of the path to the destination through that router. Initially, the ... $(t + 100)$ is : $>100$ but finite $\infty$ $3$ $>3$ and $\leq 100$
commented
in
Computer Networks
Oct 1, 2020
14.8k
views
gateit-2005
computer-networks
routing
normal
6
answers
22
GATE IT 2007 | Question: 61
In the waveform (a) given below, a bit stream is encoded by Manchester encoding scheme. The same bit stream is encoded in a different coding scheme in wave form (b). The bit stream and the ... Manchester respectively $0111101000$ and Differential Manchester respectively $1000010111$ and Integral Manchester respectively $0111101000$ and Integral Manchester respectively
commented
in
Computer Networks
Sep 30, 2020
18.0k
views
gateit-2007
computer-networks
communication
manchester-encoding
normal
out-of-gate-syllabus
4
answers
23
GATE IT 2005 | Question: 75
In a TDM medium access control bus LAN, each station is assigned one time slot per cycle for transmission. Assume that the length of each time slot is the time to transmit $100$ $\text{bits}$ ... in the LAN so that the throughput of each station can be $2/3$ $\text{Mbps}$ is $3$ $5$ $10$ $20$
commented
in
Computer Networks
Sep 29, 2020
14.2k
views
gateit-2005
computer-networks
mac-protocol
normal
6
answers
24
GATE IT 2004 | Question: 85
Consider a simplified time slotted MAC protocol, where each host always has data to send and transmits with probability $p$ = $0.2$ in every slot. There is no backoff and one frame can be transmitted in one slot. If more than one host transmits in the same slot, then ... if each host has to be provided a minimum throughput of $0.16$ frames per time slot? $1$ $2$ $3$ $4$
commented
in
Computer Networks
Sep 29, 2020
16.7k
views
gateit-2004
computer-networks
congestion-control
mac-protocol
normal
6
answers
25
GATE CSE 2009 | Question: 48
Let $G(x)$ be the generator polynomial used for CRC checking. What is the condition that should be satisfied by $G(x)$ to detect odd number of bits in error? $G(x)$ contains more than two terms $G(x)$ does not divide $1+x^k$, for any $k$ not exceeding the frame length $1+x$ is a factor of $G(x)$ $G(x)$ has an odd number of terms.
commented
in
Computer Networks
Sep 29, 2020
29.0k
views
gatecse-2009
computer-networks
error-detection
normal
7
answers
26
GATE CSE 2012 | Question: 45
Consider an instance of TCP's Additive Increase Multiplicative Decrease (AIMD) algorithm where the window size at the start of the slow start phase is $2$ MSS and the threshold at the start of the first transmission is $8$ MSS. Assume that a timeout occurs during ... Find the congestion window size at the end of the tenth transmission. $8$ MSS $14$ MSS $7$ MSS $12$ MSS
commented
in
Computer Networks
Sep 28, 2020
38.3k
views
gatecse-2012
computer-networks
congestion-control
normal
2
answers
27
GATE CSE 2020 | Question: 38
An organization requires a range of IP address to assign one to each of its $1500$ computers. The organization has approached an Internet Service Provider (ISP) for this task. The ISP uses CIDR and serves the requests from the available IP address space $202.61.0.0/17$. The ... $\text{III}$ only $\text{III}$ and $\text{IV}$ only $\text{I}$ and $\text{IV}$ only
commented
in
Computer Networks
Sep 24, 2020
24.2k
views
gatecse-2020
computer-networks
subnetting
2-marks
10
answers
28
GATE CSE 2009 | Question: 28
Consider a $4$ stage pipeline processor. The number of cycles needed by the four instructions $I1, I2, I3, I4$ in stages $S1, S2, S3, S4$ ... the number of cycles needed to execute the following loop? For (i=1 to 2) {I1; I2; I3; I4;} $16$ $23$ $28$ $30$
commented
in
CO and Architecture
Sep 22, 2020
34.2k
views
gatecse-2009
co-and-architecture
pipelining
normal
5
answers
29
GATE CSE 2013 | Question: 28
Consider the following sequence of micro-operations. MBR ← PC MAR ← X PC ← Y Memory ← MBR Which one of the following is a possible operation performed by this sequence? Instruction fetch Operand fetch Conditional branch Initiation of interrupt service
commented
in
CO and Architecture
Sep 22, 2020
15.0k
views
gatecse-2013
co-and-architecture
microprogramming
normal
1
answer
30
GATE CSE 1990 | Question: 8a
A single bus CPU consists of four general purpose register, namely, $R0, \ldots, R3, \text{ALU}, \text{MAR}, \text{MDR}, \text{PC}, \text{SP}$ and $\text{IR}$ (Instruction Register). Assuming suitable microinstructions, write a microroutine for the instruction, $\text{ADD }R0, R1$.
commented
in
CO and Architecture
Sep 22, 2020
2.0k
views
gate1990
descriptive
co-and-architecture
data-path
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:...