Awesome q2a theme
Ask us anything
Toggle navigation
Email or Username
Password
Remember
Login
Register

I forgot my password
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Blogs
Previous Year
Exams
Recent activity
0
votes
1
answer
A First Course in Probability by Sheldon Ross Chapter 1
commented
17 hours
ago
in
Combinatory
by
Parag Tamhankar
(
5
points)

9
views
probability
0
votes
1
answer
Linear Algebra and Its Applications Fourth Edition Gilbert Strang, chapter 1, problem set 1.2, Qn. 10
answered
23 hours
ago
in
Linear Algebra
by
aryavart
(
7
points)

10
views
linearalgebra
0
votes
0
answers
i dont know its a assignment
If the bandwidth is 100 Mbps, round trip time is 50sec and the frame size is 25 bits. Calculate (i) Window size used in selective repeat ARQ. (ii) Number of sequence bits in selective repeat ARQ.
asked
1 day
ago
in
Computer Networks
by
nim_nambi
(
5
points)

3
views
slidingwindow
computernetwork
0
votes
0
answers
Workbook Question Found on Web
asked
1 day
ago
in
Compiler Design
by
rahul0521
(
5
points)

4
views
compiler
compilerdesign
parsing
grammar
0
votes
1
answer
Series solution
Series solution of $(2^k) \times 1 + (2^{k1}) \times 2+ (2^{k2}) \times 3+…+(2^2) \times(n2) +2(n1) +n?$
answered
2 days
ago
in
Mathematical Logic
by
Nikhil_dhama
(
219
points)

14
views
testseries
+1
vote
0
answers
Peter Linz 6th Edition Chapter 3 Exercise 3.3 Q 4
Construct a leftlinear grammar for the language S→ abA A → baB B → aA  bb.
[closed]
closed
2 days
ago
in
Theory of Computation
by
Nikhil_dhama
(
219
points)

6
views
peterlinz
toclanguages
peterlinz
0
votes
0
answers
Discrete Mathematical structures Chapter 5
#DiscreteMathematics: whether Binomial Theorem is part of the syllabus?
commented
2 days
ago
in
Combinatory
by
Nikhil_dhama
(
219
points)

8
views
discretemaths
0
votes
1
answer
how to constructing rightlinear grammar
Hi, I do not succeed in this question: Need to construct a rightlinear grammar Would appreciate help :)
commented
3 days
ago
in
Algorithms
by
aryavart
(
7
points)

18
views
regulargrammar
0
votes
0
answers
Finding optimal window size
Finding Optimal Window Size In Slinding Window Protocol. Given Round trip time(RTT sec), Bandwidth(BW bits/sec), packet size(L bits), which approch is right? Approch 1. max data that can be sent in RTT = RTT * BW bits max window size = (RTT * BW)/L ... = (1 + 2a) packets; a=Tp/Tt Some problems are sloved with approch 1 and others with 2nd one. Which one should we use?
commented
3 days
ago
in
Computer Networks
by
eyeamgj
(
29
points)

13
views
slidingwindow
computernetwork
+1
vote
0
answers
Theory of computation  Pumping Lemma for CFL [Self Doubt]
commented
3 days
ago
in
Theory of Computation
by
Shaik Masthan
(
1.5k
points)

10
views
pumpinglemma
+1
vote
2
answers
Made easy workbook
Suppose we have two entity sets person, Email and use a relationship Owns. A person own atmost one email account but an email account can be owned by multiple persons. Which of the following is an ER diagram based on above description.
answered
3 days
ago
in
Databases
by
immanujs
(
5
points)

35
views
workbook
databases
0
votes
0
answers
MAC address and router working
I have some conceptual doubts about MAC address why we need them when we have an IP address and routers know the IP address
asked
3 days
ago
in
Computer Networks
by
jainanmol123
(
13
points)

6
views
selfdoubt
0
votes
0
answers
IIT Gandhinagar Written Test Probability Question
There are 100 rooms in a hotel. The hotel manager is lazy. When a customer requests a room, the manager picks a room from 1 to 100 uniformly at random without even bothering to check whether it is already occupied. If the room is already ... try to check in, one by one, to the hotel. Show that the expected number of occupants is at least 50.
asked
3 days
ago
in
Probability
by
Subham Das
(
7
points)

14
views
probability
expectation
0
votes
0
answers
Matching Number
Please tell me what is the Independence Number Domination Number Matching Number Covering Number of the given graph in the picture. Does perfect matching exist in the given graph?
commented
4 days
ago
in
Graph Theory
by
kaleen bhaiya
(
9
points)

41
views
discretemaths
graphtheory
0
votes
0
answers
Probability Sheldon Ross Self doubt
Consider a random chord of a circle. What is the probability that the length of the chord will be greater than the side of the equilateral triangle inscribed in that circle?
asked
4 days
ago
in
Probability
by
Divyanshu Shukla
(
1
point)

8
views
probability
0
votes
0
answers
Madeeasypostal ACE
"GATE CSE 2000  Question: 1.6  GATE Overflow" https://gateoverflow.in/629/gatecse2000question16 In question above we understood that positive number and unsigned is represented same as in 2's complement. here in question below the hex number is ... be same as number given is positive(bcoz msb is not 7). Determine 8's compliment of an octal number 2670? Right??
asked
5 days
ago
in
Digital Logic
by
BhaktiDhorajiya
(
5
points)

8
views
digitallogic
selfdoubt
0
votes
1
answer
while solving a flip flop question i came around this situation.
answered
May 6
in
Digital Logic
by
chris gyle
(
5
points)

39
views
selfdoubt
0
votes
2
answers
Principle of Duality (Digital Logic)
What will be the dual of the following expression? A + B’.[C’+D(E+F’)]
answered
May 6
in
Digital Logic
by
chris gyle
(
5
points)

20
views
digitallogic
selfdoubt
0
votes
0
answers
discrete mathematics(topic) piegen hole
We select 38 even positive integers, all less than 1000. Prove that therewill be two of them whose difference is at most 26.
asked
May 6
in
Combinatory
by
thispc295
(
5
points)

9
views
discretemaths
0
votes
0
answers
Design Turing Machine for LANGUAGE L1=a*bb(a+b)*
asked
May 6
in
Theory of Computation
by
chris gyle
(
5
points)

9
views
turingmachine
0
votes
0
answers
Fermati's little theorem
(a). Use Fermat's little theorem to compute 52003 (mod 7), 52003(mod 11) and 52003(mod 13)
asked
May 6
in
Engineering Mathematics
by
Mushy
(
5
points)

4
views
discretemaths
0
votes
0
answers
Asymptotic notation
T(n)=T(n1)1 what is complexity of this
asked
May 6
in
Algorithms
by
Rahul06
(
5
points)

9
views
algorithms
0
votes
1
answer
Exam operating system
When switching the CPU between two processes.. which of the following applies A. The PCB is both, saved and reloaded, only for the interrupted process that is existing the CPU B. The PCB is saved for the process that is scheduled for the CPU C. The PCB is reloaded for the process that is scheduled for the CPU D. No PCB is saved or reloaded E. None of the above
answered
May 6
in
Operating System
by
aryavart
(
7
points)

11
views
tifr2021
selfdoubt
databases
drdo
probability
0
votes
0
answers
Made Easy Workbook
Consider a machine with a byte addressable main memory of 2^16 bytes. Assume that a direct mapped data cache consisting of 32 lines of 64 bytes each is used in the system. A 50 x 50 twodimensional array of bytes is stored in the main memory starting from memory location 1100 H. Assume that ... (a) line 4 to line 11 (b) line 4 to line 12 (c) line 0 to line 7 (d) line 0 to line 8
commented
May 6
in
CO & Architecture
by
Shiva Sagar Rao
(
35
points)

13
views
workbook
+1
vote
1
answer
i am preparing for gate 2022 cse.
i need to study COA . can somebody tell me good resources and how to progress with subject
commented
May 6
in
CO & Architecture
by
Shiva Sagar Rao
(
35
points)

29
views
selfdoubt
0
votes
0
answers
GATE19877a Video Solution
List the invariant assertions at points $A, B, C, D$ and $E$ in program given below: Program division (input, output) Const dividend = 81; divisor = 9; Var remainder, quotient:interger begin (*(dividend >= 0) AND (divisor > 0)*) remainder := dividend; ... := remainder  divisor; (*C*) end; (*D*) quotient := quotient  1; remainder := remainder + divisor; (*E*) end
commented
May 6
in
Programming
by
Shaik Masthan
(
1.5k
points)

19
views
gate1987
programming
loopinvariants
videosolution
0
votes
1
answer
CPU Scheduling
Is context switching time and dispatch latency same?
answered
May 6
in
Operating System
by
aryavart
(
7
points)

13
views
selfdoubt
0
votes
0
answers
how to find the number of d flipflops required for implementing mod k counter?
asked
May 6
in
Digital Logic
by
ramcharandevathi
(
5
points)

5
views
selfdoubt
0
votes
0
answers
Made Easy chapter 1 question 12
Find the minimum number of tables in the above ER diagram.
asked
May 6
in
Databases
by
Amaterasu07
(
5
points)

8
views
erdiagram
0
votes
0
answers
Congestion Control
Is AIMD and slow start in congestion control are same. if not then why
asked
May 4
in
Computer Networks
by
vsumit03
(
5
points)

2
views
tcpcongestion
+1
vote
0
answers
Peter Linz 6th Edition Chapter 3 Exercise 3.3 Q 4
Construct a leftlinear grammar for the language S→ abA A → baB B → aA  bb.
asked
May 3
in
Theory of Computation
by
Setsu
(
13
points)

9
views
peterlinz
toclanguages
peterlinz
0
votes
0
answers
ACE TEST SERIES
WHICH OF THE FOLLOWING INDICATES 8`s COMPLEMENT OF $[70700]_8$ IN SIX DIGIT? $[707100]_8$ $[007100]_8$ $[707078]_8$ $[007078]_8$
asked
May 3
in
Digital Logic
by
abhishek.maurya
(
5
points)

10
views
testseries
digitallogic
complementing
0
votes
1
answer
#Memory Management
1.In case of fixed partition/variable partition, suppose all holes(say 5 holes) are filled and one hole is of size 5kb and there we stored a 4kb process so here it will be of internal fragmentation of 1kb so can we also conclude here ... in memory then external fragmentation must be there but if there is external fragmentation in memory there need not be internal fragmentation??
commented
May 2
in
Operating System
by
Enolx.21
(
49
points)

18
views
selfdoubt
0
votes
0
answers
gate 2001 DBMS(normalization)
R(A,B,C,D) is a relation. FD given is:{ AB>C , C>AD } is it in 2NF? is it in 3NF?
asked
May 2
in
Databases
by
rishabh8797
(
5
points)

10
views
databases
selfdoubt
0
votes
0
answers
Huffman Coding Algorithm
Considering the Huffman coding algorithm, the Huffman (encoding) tree requires more number of nodes than the distinct number of characters from the input file (say ‘n’). Then how is the space complexity for the algorithm = O(n), assuming the minheap is operated on recursively?
asked
May 2
in
Algorithms
by
Nabankur Dey
(
5
points)

5
views
huffmancode
0
votes
0
answers
Functional Dependency
A relation R(A,B,C) has FD A $\rightarrow$ B and other relation M(A, B) has FD A $\rightarrow$ B. Does relation R and M have equivalent FD ?
asked
May 2
in
Databases
by
ascend
(
5
points)

7
views
selfdoubt
0
votes
0
answers
Function /discrete mathematics
I've a personal doubt X^2 doesn't have an inverse but cubic function is bijective because it's derivative is square term and hence always positive. I am confused about these two things in theoritically.
edited
May 2
in
Set Theory & Algebra
by
afroze
(
5
points)

5
views
functions
discretemaths
0
votes
0
answers
Find a longest common subsequence between following strings:
asked
May 2
in
Algorithms
by
Danido1
(
5
points)

10
views
madeeasytest
0
votes
0
answers
can we say that two parallel vectors (even with different origins) are linearly dependent and hence can't form basis?
asked
May 2
in
Linear Algebra
by
Codered03
(
5
points)

8
views
enggmaths
0
votes
0
answers
Asymptotic notation
n^3 + n^2logn = bigoh(n^3) For satisfying above equation what should be the value of c??
asked
May 2
in
Algorithms
by
Vink7389
(
5
points)

4
views
selfdoubt
To see more, click for the
full list of questions
or
popular tags
.
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
Welcome to GATE CSE Doubts, where you can ask questions and receive answers from other members of the community.
Recent Posts
New GATEOverflow PDFs
Guidelines to users
No Recent Blog Comments
Recent activity
9,270
questions
3,204
answers
14,751
comments
96,304
users