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 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 Σ*
commented
in
Theory of Computation
Jan 31, 2020
5.9k
views
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
answered
in
Programming
Jan 27, 2020
655
views
cmi2019
identify-function
2
answers
3
Number of Hamiltonian cycles in a complete graph
Number of Hamilton cycles in a complete labelled graph?
commented
in
Graph Theory
Jan 23, 2020
5.2k
views
graph-theory
cycle
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
commented
in
Compiler Design
Jan 18, 2020
249
views
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
commented
in
Databases
Jan 16, 2020
5.7k
views
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?
commented
in
Programming
Jan 7, 2020
1.3k
views
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\}$
commented
in
Theory of Computation
Dec 28, 2019
11.5k
views
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
commented
in
CO and Architecture
Dec 25, 2019
11.6k
views
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 _________.
commented
in
CO and Architecture
Dec 24, 2019
18.9k
views
gatecse-2018
co-and-architecture
machine-instructions
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$
commented
in
Operating System
Nov 28, 2019
10.9k
views
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.
commented
in
Theory of Computation
Nov 15, 2019
5.6k
views
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
commented
in
Theory of Computation
Nov 1, 2019
501
views
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 __________.
commented
in
Compiler Design
Oct 28, 2019
22.2k
views
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
commented
in
Computer Networks
Oct 19, 2019
491
views
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
commented
in
Computer Networks
Oct 6, 2019
11.2k
views
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?
commented
in
Computer Networks
Oct 2, 2019
489
views
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$
commented
in
Mathematical Logic
Aug 19, 2019
17.5k
views
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.
commented
in
Mathematical Logic
Aug 18, 2019
4.5k
views
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?
comment edited
in
Mathematical Logic
Aug 18, 2019
787
views
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
commented
in
Mathematical Logic
Aug 12, 2019
9.7k
views
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 = 2), ... that I am missing? PS. From where can I study this? Hamacher book doesn't contain pipelining in this much detail.
commented
in
CO and Architecture
Aug 11, 2019
1.1k
views
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}$
commented
in
CO and Architecture
Aug 3, 2019
10.0k
views
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
asked
in
Operating System
May 13, 2019
380
views
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?
commented
in
Combinatory
Apr 22, 2019
469
views
iiith-pgee
4
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}}$
answered
in
Probability
Apr 22, 2019
6.3k
views
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}$
commented
in
Computer Networks
Apr 2, 2019
14.3k
views
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?
commented
in
Computer Networks
Apr 2, 2019
202
views
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?
answered
in
Numerical Methods
Mar 29, 2019
413
views
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 ______.
commented
in
Computer Networks
Mar 29, 2019
10.9k
views
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$
commented
in
Operating System
Mar 25, 2019
10.5k
views
gateit-2005
operating-system
disk
normal
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
@amit166 can you share the reference of the...
Twist at every point Man
Diagonalization of a MatrixIf there is an...
"i applied to amazon for 6 times,flipkart 2...
The Memes were inserted perfectly😁😁