Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Winner
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by Winner
1
answer
1
Michael Sipser exercise
For each of the following languages, give the minimum pumping length and justify your answer. 0001* 0*1* 001 ∪ 0* 1* 0*1$^+$0$^+$1* ∪ 10*1 (01)* ε 1*01*01* 10(11*0)*0 1011 Σ*
For each of the following languages, give the minimum pumping length and justify your answer.0001* 0*1*001 ∪ 0* 1*0*1$^+$0$^+$1* ∪ 10*1(01)*ε1*01*01*10(11*0)*01011Σ...
7.7k
views
commented
Jan 31, 2020
Theory of Computation
pumping-lemma
minimum-pumping-length
+
–
3
answers
2
CMI2019-A-9
The next two questions refer to the following program. In the code below reverse$(A,i,j)$ takes an array $A,$ indices $i$ and $j$ with $i\leq j,$ and reverses the segment $A[i],A[i+1],\cdots,A[j].$ ... } reverse(A,i,m); } return; } When the procedure terminates, the array A has been: Sorted in descending order Sorted in ascending order Reversed Left unaltered
The next two questions refer to the following program.In the code below reverse$(A,i,j)$ takes an array $A,$ indices $i$ and $j$ with $i\leq j,$ and reverses the segment ...
880
views
answered
Jan 27, 2020
Programming in C
cmi2019
identify-function
+
–
14
answers
3
GATE CSE 2019 | Question: 12
Let $G$ be an undirected complete graph on $n$ vertices, where $n > 2$. Then, the number of different Hamiltonian cycles in $G$ is equal to $n!$ $(n-1)!$ $1$ $\frac{(n-1)!}{2}$
Let $G$ be an undirected complete graph on $n$ vertices, where $n 2$. Then, the number of different Hamiltonian cycles in $G$ is equal to$n!$$(n-1)!$$1$$\frac{(n-1)!}{2}...
21.0k
views
commented
Jan 23, 2020
Graph Theory
gatecse-2019
engineering-mathematics
discrete-mathematics
graph-theory
graph-connectivity
1-mark
+
–
0
answers
4
Test by Bikram | Compiler Design | Test 1 | Question: 27
$\textbf{goto}$ function of LR class of grammar is represented as: Deterministic Finite Automata transitions Non-deterministic Finite Automata transitions PDA transitions Parsing table
$\textbf{goto}$ function of LR class of grammar is represented as:Deterministic Finite Automata transitionsNon-deterministic Finite Automata transitionsPDA transitionsPar...
448
views
commented
Jan 17, 2020
Compiler Design
tbb-cd-1
compiler-design
parsing
lr-parser
+
–
1
answer
5
GATE IT 2005 | Question: 67
A company maintains records of sales made by its salespersons and pays them commission based on each individual's total sales made in a year. This data is maintained in a table with following schema: salesinfo = (salespersonid, ... running concurrently throughout Execute T3 followed by T2; T1 running concurrently throughout Execute T3 followed by T2 followed by T1
A company maintains records of sales made by its salespersons and pays them commission based on each individual's total sales made in a year. This data is maintained in a...
7.9k
views
commented
Jan 15, 2020
Databases
gateit-2005
databases
transaction-and-concurrency
normal
+
–
2
answers
6
#self doubt
https://gateoverflow.in/204103/gate2018-29?show=204103#q204103 in this question wht is passed in function 1.....what actually 1st function is doing?
https://gateoverflow.in/204103/gate2018-29?show=204103#q204103in this question wht is passed in function 1.....what actually 1st function is doing?
1.6k
views
commented
Jan 7, 2020
Programming in C
usergate2018
usermod
+
–
5
answers
7
GATE CSE 2019 | Question: 7
If $L$ is a regular language over $\Sigma = \{a,b\} $, which one of the following languages is NOT regular? $L.L^R = \{xy \mid x \in L , y^R \in L\}$ $\{ww^R \mid w \in L \}$ $\text{Prefix } (L) = \{x \in \Sigma^* \mid \exists y \in \Sigma^* $such that$ \ xy \in L\}$ $\text{Suffix }(L) = \{y \in \Sigma^* \mid \exists x \in \Sigma^* $such that$ \ xy \in L\}$
If $L$ is a regular language over $\Sigma = \{a,b\} $, which one of the following languages is NOT regular?$L.L^R = \{xy \mid x \in L , y^R \in L\}$$\{ww^R \mid w \in L \...
14.7k
views
commented
Dec 28, 2019
Theory of Computation
gatecse-2019
theory-of-computation
regular-language
1-mark
+
–
3
answers
8
Give me the formula for write back and write through ( avg access time ) in both parallel and serial
14.1k
views
commented
Dec 25, 2019
7
answers
9
GATE CSE 2018 | Question: 51
A processor has $16$ integer registers $\text{(R0, R1}, \ldots ,\text{ R15)}$ and $64$ floating point registers $\text{(F0, F1}, \ldots , \text{F63)}.$ It uses a $2\text{- byte}$ instruction format. There are four categories of ... $\text{(1F)}.$ The maximum value of $\text{N}$ is _________.
A processor has $16$ integer registers $\text{(R0, R1}, \ldots ,\text{ R15)}$ and $64$ floating point registers $\text{(F0, F1}, \ldots , \text{F63)}.$ It uses a $2\text{...
24.0k
views
commented
Dec 24, 2019
CO and Architecture
gatecse-2018
co-and-architecture
machine-instruction
instruction-format
numerical-answers
2-marks
+
–
6
answers
10
GATE CSE 2018 | Question: 40
Consider the following solution to the producer-consumer synchronization problem. The shared buffer size is $N$. Three semaphores $empty$, $full$ and $mutex$ are defined with respective initial values of $0, N$ and $1$. Semaphore $empty$ denotes the number of available slots in the buffer, ... $P: empty, \ \ \ Q:full, \ \ \ R:full, \ \ \ S:empty$
Consider the following solution to the producer-consumer synchronization problem. The shared buffer size is $N$. Three semaphores $empty$, $full$ and $mutex$ are defined ...
14.3k
views
commented
Nov 27, 2019
Operating System
gatecse-2018
operating-system
process-synchronization
normal
2-marks
+
–
2
answers
11
DCFL
Is DFCL closed under complement ? If so can you provide any text for the same.
Is DFCL closed under complement ? If so can you provide any text for the same.
6.9k
views
commented
Nov 15, 2019
Theory of Computation
theory-of-computation
dcfl
identify-class-language
+
–
0
answers
12
PDA Doubt
Please can anyone explain the PDA for reverse of a string via a transition graph
Please can anyone explain the PDA for reverse of a string via a transition graph
691
views
commented
Nov 1, 2019
Theory of Computation
pushdown-automata
theory-of-computation
+
–
12
answers
13
GATE CSE 2016 Set 1 | Question: 19
Consider the following code segment. x = u - t; y = x * v; x = y + w; y = t - z; y = x * y; The minimum number of total variables required to convert the above code segment to static single assignment form is __________.
Consider the following code segment.x = u - t; y = x * v; x = y + w; y = t - z; y = x * y;The minimum number of total variables required to convert the above code segment...
27.3k
views
commented
Oct 28, 2019
Compiler Design
gatecse-2016-set1
compiler-design
static-single-assignment
normal
numerical-answers
+
–
1
answer
14
Doubt related to solving numerical questions in computer network
how to decide while solving questions whether we have to take the units in power of 2 or power of 10 when it came to bandwidth or data size?? every question follows different approach,I am confused
how to decide while solving questions whether we have to take the units in power of 2 or power of 10 when it came to bandwidth or data size?? every question follows diffe...
645
views
commented
Oct 19, 2019
Computer Networks
bandwidth
datasize
+
–
5
answers
15
GATE IT 2004 | Question: 27
A host is connected to a Department network which is part of a University network. The University network, in turn, is part of the Internet. The largest network in which the Ethernet address of the host is unique is the subnet to which the host belongs the Department network the University network the Internet
A host is connected to a Department network which is part of a University network. The University network, in turn, is part of the Internet. The largest network in which ...
13.4k
views
commented
Oct 5, 2019
Computer Networks
gateit-2004
computer-networks
lan-technologies
ethernet
normal
+
–
1
answer
16
Switching
1)What is switching? And in which layer switching happens? 2)Is circuit better than packet in OSI model? 3)Main difference between circuit switching and packet switching?
1)What is switching? And in which layer switching happens?2)Is circuit better than packet in OSI model?3)Main difference between circuit switching and packet switching?
742
views
commented
Oct 1, 2019
Computer Networks
computer-networks
network-switching
+
–
3
answers
17
GATE CSE 2018 | Question: 28
Consider the first-order logic sentence $\varphi \equiv \exists \: s \: \exists \: t \: \exists \: u \: \forall \: v \: \forall \: w \forall \: x \: \forall \: y \: \psi(s, t, u, v, w, x, y)$ ... or equal to $3$ There exists no model of $\varphi$ with universe size of greater than $7$ Every model of $\varphi$ has a universe of size equal to $7$
Consider the first-order logic sentence$$\varphi \equiv \exists \: s \: \exists \: t \: \exists \: u \: \forall \: v \: \forall \: w \forall \: x \: \forall \: y \: \psi(...
22.2k
views
commented
Aug 19, 2019
Mathematical Logic
gatecse-2018
mathematical-logic
normal
first-order-logic
2-marks
+
–
4
answers
18
GATE CSE 1991 | Question: 15,b
Consider the following first order formula: ... Does it have finite models? Is it satisfiable? If so, give a countable model for it.
Consider the following first order formula:$\left ( \matrix{ \forall x \exists y : R(x,y) \\[1em] \Large \land \\[1em] \forall x \forall y : \left ( R(x,y) \impl...
6.2k
views
commented
Aug 18, 2019
Mathematical Logic
gate1991
mathematical-logic
first-order-logic
descriptive
+
–
1
answer
19
Rosen (Nested Quantifiers)
If we think about nested quantifiers as nested loops ∀x((F (x) ∧ P(x)) → ∃yM(x, y)) for this then when we are iterating for outer loop x and we find the LHS to be true then only iterate in internal loop of y whether she is ... (x, y) } } We are making unnecessary comparisons here. So how could we move that existential quantifier in beginning? What is null quantification?
If we think about nested quantifiers as nested loops ∀x((F (x) ∧ P(x)) → ∃yM(x, y)) for this then when we are iterating for outer loop x and we find the LHS to b...
1.2k
views
comment edited
Aug 18, 2019
6
answers
20
GATE CSE 2003 | Question: 72
The following resolution rule is used in logic programming. Derive clause $(P \vee Q)$ from clauses $(P\vee R),(Q \vee ¬R)$ Which of the following statements related to this rule is FALSE? $((P ∨ R)∧(Q ∨ ¬R))⇒(P ∨ Q)$ ... if $(P ∨ R)∧(Q ∨ ¬R)$ is satisfiable $(P ∨ Q)⇒ \text{FALSE}$ if and only if both $P$ and $Q$ are unsatisfiable
The following resolution rule is used in logic programming.Derive clause $(P \vee Q)$ from clauses $(P\vee R),(Q \vee ¬R)$Which of the following statements related to th...
13.9k
views
commented
Aug 12, 2019
Mathematical Logic
gatecse-2003
mathematical-logic
normal
propositional-logic
+
–
0
answers
21
Doubt in pipelining questions.
Consider this question and its selected answer: https://gateoverflow.in/3690/gate2004-it-47 And this question: https://gateoverflow.in/1314/gate2009-28 Both questions are somewhat similar. In the first one's answer, instruction $I_1$ (when i = ... I am missing? PS. From where can I study this? Hamacher book doesn't contain pipelining in this much detail.
Consider this question and its selected answer: https://gateoverflow.in/3690/gate2004-it-47And this question: https://gateoverflow.in/1314/gate2009-28Both questions are s...
1.5k
views
commented
Aug 11, 2019
CO and Architecture
co-and-architecture
pipelining
gateit-2004
gatecse-2009
+
–
3
answers
22
GATE IT 2004 | Question: 47
Consider a pipeline processor with $4$ stages $S1$ to $S4$. We want to execute the following loop: for (i = 1; i < = 1000; i++) {I1, I2, I3, I4} where the time taken (in ns) by instructions $I1$ to $I4$ for stages $S1$ to $S4$ ... output of $I1$ for $i = 2$ will be available after $\text{11 ns}$ $\text{12 ns}$ $\text{13 ns}$ $\text{28 ns}$
Consider a pipeline processor with $4$ stages $S1$ to $S4$. We want to execute the following loop:for (i = 1; i < = 1000; i++) {I1, I2, I3, I4}where the time taken (in ns...
12.3k
views
commented
Aug 3, 2019
CO and Architecture
gateit-2004
co-and-architecture
pipelining
normal
+
–
0
answers
23
Bits hd 2018 operating system
Which of this is allowed by multiprogramming not by multitasking? A) New to ready B)Ready to Running C) Waiting to running D) Running to Waiting
Which of this is allowed by multiprogramming not by multitasking?A) New to readyB)Ready to RunningC) Waiting to runningD) Running to Waiting
570
views
asked
May 12, 2019
Operating System
bits
+
–
1
answer
24
Pgee 2013
You have a box containing 10 black and 10 blue socks.What is the minimum number of times you need to pull out so that you have a pair of the same color?
You have a box containing 10 black and 10 blue socks.What is the minimum number of times you need to pull out so that you have a pair of the same color?
718
views
commented
Apr 22, 2019
Combinatory
iiith-pgee
+
–
5
answers
25
GATE IT 2008 | Question: 23
What is the probability that in a randomly chosen group of $r$ people at least three people have the same birthday? $1-\dfrac{365-364 \dots (365-r+1)}{365^{r}}$ ... $\dfrac{365 \cdot 364 \dots (365-r+1)}{365^{r}}$
What is the probability that in a randomly chosen group of $r$ people at least three people have the same birthday?$1-\dfrac{365-364 \dots (365-r+1)}{365^{r}}$$\dfrac{365...
8.5k
views
answered
Apr 21, 2019
Probability
gateit-2008
probability
normal
+
–
6
answers
26
GATE IT 2004 | Question: 87
A TCP message consisting of $2100$ $bytes$ is passed to IP for delivery across two networks. The first network can carry a maximum payload of $1200$ $bytes$ per frame and the second network can carry a maximum payload of $400$ $bytes$ per frame, excluding ... second network for this transmission? $\text{40 bytes}$ $\text{80 bytes}$ $\text{120 bytes}$ $\text{160 bytes}$
A TCP message consisting of $2100$ $bytes$ is passed to IP for delivery across two networks. The first network can carry a maximum payload of $1200$ $bytes$ per frame an...
19.1k
views
commented
Apr 2, 2019
Computer Networks
gateit-2004
computer-networks
network-flow
normal
+
–
0
answers
27
Self doubt
What is the difference between the advertised window and the receiver buffer in tcp connection and what does unacknowledged bytes in the advertisement window implies?
What is the difference between the advertised window and the receiver buffer in tcp connection and what does unacknowledged bytes in the advertisement window implies?
502
views
commented
Apr 2, 2019
Computer Networks
computer-networks
+
–
1
answer
28
Is reading comprehension asked in IIITH
Does in iiith pgeee exam , does Reading comprehension is being asked. Do we need to prepare for it?
Does in iiith pgeee exam , does Reading comprehension is being asked. Do we need to prepare for it?
686
views
answered
Mar 29, 2019
Numerical Methods
iiith-pgee
+
–
10
answers
29
GATE CSE 2015 Set 3 | Question: 28
Consider a network connecting two systems located $8000$ $\text{Km}$ apart. The bandwidth of the network is $500 \times 10^6$ $\text{bits}$ per second. The propagation speed of the media is $4 \times 10^6$ $\text{meters}$ per ... . Assume that processing delays at nodes are negligible. Then, the minimum size in bits of the sequence number field has to be ______.
Consider a network connecting two systems located $8000$ $\text{Km}$ apart. The bandwidth of the network is $500 \times 10^6$ $\text{bits}$ per second. The propagation sp...
14.4k
views
commented
Mar 29, 2019
Computer Networks
gatecse-2015-set3
computer-networks
sliding-window
normal
numerical-answers
+
–
5
answers
30
GATE IT 2005 | Question: 81-b
A disk has $8$ equidistant tracks. The diameters of the innermost and outermost tracks are $1$ cm and $8$ cm respectively. The innermost track has a storage capacity of $10$ MB. If the disk has $20$ sectors per track and is currently at the end of the $5^{th}$ sector ... starting from the sector $4$ of the outer-most track? $13.5 \ ms$ $10 \ ms$ $9.5 \ ms$ $20 \ ms$
A disk has $8$ equidistant tracks. The diameters of the innermost and outermost tracks are $1$ cm and $8$ cm respectively. The innermost track has a storage capacity of $...
13.7k
views
commented
Mar 25, 2019
Operating System
gateit-2005
operating-system
disk
normal
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register