Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Beyonder
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by Beyonder
0
votes
1
UGC NET CSE | June 2019 | Part 2 | Question: 74
Shift-reduce parser consists of input buffer stack parse table Choose the correct option from those given below: a and b only a and c only c only a, b and c
Shift-reduce parser consists ofinput bufferstackparse tableChoose the correct option from those given below:a and b onlya and c onlyc onlya, b and c
4.1k
views
answered
Nov 30, 2023
Compiler Design
ugcnetcse-june2019-paper2
shift-reduce-parser
+
–
0
votes
2
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.3k
views
answered
Dec 30, 2021
Computer Networks
gatecse-2015-set3
computer-networks
sliding-window
normal
numerical-answers
+
–
0
votes
3
GATE CSE 2014 Set 1 | Question: 28
Consider a selective repeat sliding window protocol that uses a frame size of $1$ $\text{KB}$ to send data on a $1.5$ $\text{Mbps}$ link with a one-way latency of $50$ $\text{msec}$. To achieve a link utilization of $60\%$, the minimum number of bits required to represent the sequence number field is ________.
Consider a selective repeat sliding window protocol that uses a frame size of $1$ $\text{KB}$ to send data on a $1.5$ $\text{Mbps}$ link with a one-way latency of $50$ $\...
26.9k
views
answered
Dec 29, 2021
Computer Networks
gatecse-2014-set1
computer-networks
sliding-window
numerical-answers
normal
+
–
8
votes
4
GATE CSE 2014 Set 3 | Question: 51
If $G$ is the forest with $n$ vertices and $k$ connected components, how many edges does $G$ have? $\left\lfloor\frac {n}{k}\right\rfloor$ $\left\lceil \frac{n}{k} \right\rceil$ $n-k$ $n-k+1$
If $G$ is the forest with $n$ vertices and $k$ connected components, how many edges does $G$ have?$\left\lfloor\frac {n}{k}\right\rfloor$$\left\lceil \frac{n}{k} \right\r...
18.2k
views
answered
Oct 8, 2017
Graph Theory
gatecse-2014-set3
graph-theory
graph-connectivity
normal
+
–
0
votes
5
Deadlocks and threads
Which one of the following is false about user threads 1. User threads can switch fast since it does noy invoke kernel 2.user threads are light weight since they do not require system call 3.kernel is not aware of the behavior of every user threads ie if it is blocking or run able 4.none of these
Which one of the following is false about user threads1. User threads can switch fast since it does noy invoke kernel2.user threads are light weight since they do not re...
1.3k
views
answered
Oct 7, 2017
Operating System
threads
+
–
4
votes
6
GATE CSE 2009 | Question: 57, ISRO2016-75
Frames of $\text{1000 bits}$ are sent over a $10^6$ $\text{bps}$ duplex link between two hosts. The propagation time is $\text{25 ms}$. Frames are to be transmitted into this link to maximally pack them in transit (within the link). What is the ... ? Assume that no time gap needs to be given between transmission of two frames. $I=2$ $I=3$ $I=4$ $I=5$
Frames of $\text{1000 bits}$ are sent over a $10^6$ $\text{bps}$ duplex link between two hosts. The propagation time is $\text{25 ms}$. Frames are to be transmitted into ...
48.1k
views
answered
Mar 18, 2017
Computer Networks
gatecse-2009
computer-networks
sliding-window
normal
isro2016
+
–
–1
votes
7
GATE CSE 2007 | Question: 4
Let $G$ be the non-planar graph with the minimum possible number of edges. Then $G$ has 9 edges and 5 vertices 9 edges and 6 vertices 10 edges and 5 vertices 10 edges and 6 vertices
Let $G$ be the non-planar graph with the minimum possible number of edges. Then $G$ has9 edges and 5 vertices9 edges and 6 vertices10 edges and 5 vertices10 edges and 6 v...
10.1k
views
answered
Mar 17, 2017
Graph Theory
gatecse-2007
graph-theory
normal
out-of-syllabus-now
+
–
0
votes
8
Digital Logic
No of switching fn for f (A, B, C, D)=BD+B'D' How to approach this question ?
No of switching fn for f (A, B, C, D)=BD+B'D'How to approach this question ?
1.6k
views
answered
Apr 26, 2016
Digital Logic
digital-logic
+
–
3
votes
9
Kenneth Rosen Edition 7 Exercise 1.2 Question 1 (Page No. 22)
Translate the given statement into propositional logic using the propositions provided. You cannot edit a protected Wikipedia entry unless you are an administrator. Express your answer in terms of e: “You can edit a protected Wikipedia entry” and a: “You are an administrator.”
Translate the given statement into propositional logic using the propositions provided.You cannot edit a protected Wikipedia entry unless you are an administrator.Express...
6.1k
views
answered
Apr 20, 2016
Mathematical Logic
kenneth-rosen
discrete-mathematics
mathematical-logic
+
–
3
votes
10
Why is (a + b)* a regular language?
The language (a+b)* is regular as there is a regular expression for it.But this language contains all possible strings. So it should imply that regular language is the super-set of all languages, but clearly it isn't! Subsets like $a^{n}b^{n}$ are not regular. Can someone tell me what am I missing?
The language (a+b)* is regular as there is a regular expression for it.But this language contains all possible strings. So it should imply that regular language is the su...
3.0k
views
answered
Apr 18, 2016
Theory of Computation
regular-language
theory-of-computation
+
–
0
votes
11
How to prove if a boolean function is functionally complete?
17.1k
views
answered
Apr 15, 2016
Digital Logic
functional-completeness
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register