Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
ST
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by ST
2
answers
1
CN DOUBT - CONGESTION WINDOW
If the present windows size at receiver is 8000byte. Each mss is 2000 byte and no. Of acknowledgemt during that time are 2. What is present window size if congestion avoidance algo. Is used.
If the present windows size at receiver is 8000byte. Each mss is 2000 byte and no. Of acknowledgemt during that time are 2. What is present window size if congestion avo...
474
views
commented
Jan 27, 2017
2
answers
2
Transport Layer
Solution for Q1 ,Q2?
Solution for Q1 ,Q2?
1.3k
views
commented
Jan 27, 2017
Computer Networks
computer-networks
transport-layer
tcp
+
–
1
answer
3
Aloha
You have two computers, $A$ and $B$, sharing a wireless network in your room. The network runs the slotted Aloha protocol with equal-sized packets. You want $B$ to get twice the throughout over the wireless network as $A$ whenever both nodes are backlogged. You configure $A$ to send packets with ... of $B$ to, in order to achieve your throughout goal? $p/(1+p)$ $p/(1+2p)$ $2p/(1+p)$ $1/2$
You have two computers, $A$ and $B$, sharing a wireless network in your room. The network runs the slotted Aloha protocol with equal-sized packets. You want $B$ to get tw...
2.0k
views
commented
Jan 18, 2017
Computer Networks
slotted-aloha
computer-networks
+
–
7
answers
4
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$
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...
14.7k
views
comment edited
Jan 17, 2017
Computer Networks
gateit-2005
computer-networks
routing
normal
+
–
4
answers
5
MadeEasy Test Series: Theory Of Computation - Regular Languages
Which of the following is a non-regular language? $L = \{wxwy \mid x,y,w \in (a+b)^+\}$ $L = \{xwyw \mid x,y,w \in (a+b)^+\}$ $L = \{wxyw \mid x,y,w \in (a+b)^+\}$ All of these
Which of the following is a non-regular language?$L = \{wxwy \mid x,y,w \in (a+b)^+\}$$L = \{xwyw \mid x,y,w \in (a+b)^+\}$$L = \{wxyw \mid x,y,w \in (a+b)^+\}$All of the...
3.2k
views
commented
Jan 14, 2017
Theory of Computation
made-easy-test-series
theory-of-computation
regular-language
+
–
1
answer
6
Turing Machine
Consider the following languages : L1 : {< M, q >|M is a Turing Machine that visits state q on some input within 15 steps}. L2 : {< M >|M is a Turing Machine, |M|< 200 where |M|is number of states in machine}. Which of the ... ? L1 is decidable but L2 is not decidable L2 is decidable but L1 is not decidable Both L1 and L2 is decidable Neither L1 nor L2 is decidable
Consider the following languages :L1 : {< M, q >|M is a Turing Machine that visits state q on some input within 15 steps}.L2 : {< M >|M is a Turing Machine, |M|< 200 wher...
1.3k
views
comment edited
Jan 9, 2017
1
answer
7
Loop level parallelism
Consider 4 stage instruction pipeline where different instructions are spending different cycles at different stages shown below: The following loop is executed in the pipeline The number of cycles saved using the loop level parallelism over without loop level parallelism to executed the above program is _______ (in cycles).
Consider 4 stage instruction pipeline where different instructions are spending different cycles at different stages shown below:The following loop is executed in the pip...
1.6k
views
commented
Jan 9, 2017
CO and Architecture
co-and-architecture
+
–
2
answers
8
Thomas Write Rule
Consider the following schedule: The possible values of P & Q for which the above schedule is allowed under Thomas write rule but not under basic timestamp ordering protocol if timestamp(T2 )>timestamp(T1 ) W(B),W(C) W(A),W(A) Both (a)&(b) None of these
Consider the following schedule:The possible values of P & Q for which the above schedule is allowed under Thomas write rule but not under basic timestamp ordering protoc...
3.6k
views
commented
Jan 9, 2017
Databases
databases
+
–
1
answer
9
DBMS Finding the Super Keys involving normalization concept
Consider an entity employee with attributes (EmpID, Empname, Deptname, Salary, mobno, Project ID, Designation) No two employee with same name and No two employee with same ID. An employee can have more than 1 mobileno ... the requirement of 2NF. The number of super keys there in the table containing attribute project ID are __________.
Consider an entity employee with attributes (EmpID, Empname, Deptname, Salary, mobno, Project ID, Designation) No two employee with same name and No two employee with sam...
806
views
commented
Jan 4, 2017
Databases
databases
database-normalization
+
–
1
answer
10
#TOC plz help
Consider the following two languages : S1: L1= {<M>|M is a TM AND L(M)>=3} S2: L2= {<M>|M is a TM AND L(M)<3} Which of the following is correct? a. Only S1 is REC b. Only S2 is REC c. Both S1 and S2 are REC d. None of the above is REC
Consider the following two languages :S1: L1= {<M>|M is a TM AND L(M)>=3}S2: L2= {<M>|M is a TM AND L(M)<3}Which of the following is correct?a. Only S1 is REC b. Only S2 ...
435
views
commented
Jan 3, 2017
1
answer
11
Let a, b and c be the number of entities in entity sets A, B, and C, respectively
Let a, b and c be the number of entities in entity sets A, B, and C, respectively. Let t be the maximum number of triples in the relationship set for R. Which of the following is a possible combination of values for a, b ... c=4, t=20 a =100, b=10, c=20, t=100 --could'nt understand the question.what are triples??
Let a, b and c be the number of entities in entity sets A, B, and C, respectively. Let t be the maximum number of triples in the relationship set for R. Which of the foll...
2.4k
views
commented
Jan 3, 2017
Databases
databases
+
–
1
answer
12
sheldon Ross
A coin is flipped n times. Assuming that the flips are independent, with each one coming up heads with probability p, what is the probability that there is a string of k consecutive heads?
A coin is flipped n times. Assuming that the flips are independent, with each onecoming up heads with probability p, what is the probability that there is a string of kco...
581
views
comment edited
Dec 28, 2016
Mathematical Logic
probability
expectation
combinatory
+
–
0
answers
13
Deadlock
Consider two processes, $P$ and $Q$, each need three records, $R1$, $R2$. and $R3$, in a database. If $P$ asks for them in any order $R1$, $R2$, $R3$, and $Q$ asks for them in any order, What fraction of all the combinations are guaranteed to be deadlock-free?
Consider two processes, $P$ and $Q$, each need three records, $R1$, $R2$. and $R3$, in a database. If $P$ asks for them in any order $R1$, $R2$, $R3$, and $Q$ asks for th...
344
views
commented
Dec 28, 2016
Operating System
deadlock-prevention-avoidance-detection
operating-system
+
–
1
answer
14
C programming
#include <stdio.h> int main() { short int a[10]; int i=0; for(i=0;i<10;i++) a[i] = 300 + i; char *c = (char*)a; printf("%d\n", *(c+4)); int *n = (int*)a; printf("%d\n",*(n)); } output ?
#include <stdio.h int main() { short int a[10]; int i=0; for(i=0;i<10;i++) a[i] = 300 + i; char *c = (char*)a; printf("%d\n", *(c+4)); int *n = (int*)a; printf("%d\n",*(n...
760
views
commented
Dec 23, 2016
Programming in C
programming-in-c
output
pointers
+
–
17
answers
15
GATE CSE 2016 Set 1 | Question: 26
The coefficient of $x^{12}$ in $\left(x^{3}+x^{4}+x^{5}+x^{6}+\dots \right)^{3}$ is ___________.
The coefficient of $x^{12}$ in $\left(x^{3}+x^{4}+x^{5}+x^{6}+\dots \right)^{3}$ is ___________.
25.6k
views
commented
Dec 22, 2016
Combinatory
gatecse-2016-set1
combinatory
generating-functions
normal
numerical-answers
+
–
8
answers
16
GATE CSE 2006 | Question: 69
Consider the relation enrolled (student, course) in which (student, course) is the primary key, and the relation paid (student, amount) where student is the primary key. Assume no null values and no foreign keys or integrity constraints. Assume that amounts ... faster than Plan 2 for all databases For $x = 9000,$ Plan I executes slower than Plan 2 for all databases
Consider the relation enrolled (student, course) in which (student, course) is the primary key, and the relation paid (student, amount) where student is the primary key. ...
15.0k
views
commented
Dec 8, 2016
Databases
gatecse-2006
databases
sql
normal
+
–
7
answers
17
GATE IT 2005 | Question: 69
In an inventory management system implemented at a trading corporation, there are several tables designed to hold all the information. Amongst these, the following two tables hold information on which items are supplied by which suppliers, and which warehouse ... who do not supply any item supply exactly one item supply one or more items supply two or more items
In an inventory management system implemented at a trading corporation, there are several tables designed to hold all the information. Amongst these, the following two ta...
14.1k
views
commented
Dec 8, 2016
Databases
gateit-2005
databases
sql
normal
+
–
0
answers
18
SQL HAVING Clause
Can Anyone Explain how Query 28 works with example.
Can Anyone Explain how Query 28 works with example.
707
views
commented
Dec 7, 2016
Databases
databases
sql
gatebook-dbms
+
–
9
answers
19
GATE CSE 2005 | Question: 72
Consider the following code fragment: if (fork() == 0) { a = a + 5; printf("%d, %p n", a, &a); } else { a = a - 5; printf ("%d, %p n", a,& a); } Let $u,v$ be the values printed by the parent process and $x,y$ be the values printed by the child ... $u + 10 = x \text{ and } v = y$ $u + 10 = x \text{ and } v != y$
Consider the following code fragment: if (fork() == 0) { a = a + 5; printf("%d, %p n", a, &a); } else { a = a - 5; printf ("%d, %p n", a,& a); }Let $u,v$ be the values pr...
37.0k
views
comment edited
Nov 23, 2016
Operating System
gatecse-2005
operating-system
fork-system-call
normal
+
–
1
answer
20
Gatebook TOC
Let M be a single-tape deterministic TM with tape alphabet { blank, 0, 1 }, and let C denote the ( possibly infinite ) computation of M starting with a blank tape. The input to each problem is M, together with a positive integer n. Which of the following problems is(are) decidable ... tape cells during the company C (A). III only (B). I and II only (C).I and III only (D).I,II and III
Let M be a single-tape deterministic TM with tape alphabet { blank, 0, 1 }, and let C denote the( possibly infinite ) computation of M starting with a blank tape. The inp...
566
views
comment edited
Nov 20, 2016
Theory of Computation
theory-of-computation
+
–
4
answers
21
GATE CSE 2006 | Question: 59
Consider the following translation scheme. $ S\rightarrow ER$ $ R\rightarrow *E\left \{ \text{print}(\text{ }*\text{'}); \right \} R\mid \varepsilon $ $ E\rightarrow F+E\left \{ \text{print}(\text{ }+\text{'}); \right \}\mid F $ ... $2 * 3 + 4$ $2 * +3 \ 4$ $2 \ 3 * 4 +$ $2 \ 3 \ 4+*$
Consider the following translation scheme. $ S\rightarrow ER$$ R\rightarrow *E\left \{ \text{print}(\text{‘}*\text{’}); \right \} R\mid \varepsilon $$ E\rightarrow F+...
10.9k
views
commented
Nov 19, 2016
Compiler Design
gatecse-2006
compiler-design
grammar
normal
+
–
10
answers
22
GATE CSE 2003 | Question: 18
In a bottom-up evaluation of a syntax directed definition, inherited attributes can always be evaluated be evaluated only if the definition is L-attributed be evaluated only if the definition has synthesized attributes never be evaluated
In a bottom-up evaluation of a syntax directed definition, inherited attributes canalways be evaluatedbe evaluated only if the definition is L-attributedbe evaluated only...
36.5k
views
commented
Nov 19, 2016
Compiler Design
gatecse-2003
compiler-design
syntax-directed-translation
normal
+
–
11
answers
23
GATE CSE 2014 Set 1 | Question: 12
Consider a rooted n node binary tree represented using pointers. The best upper bound on the time required to determine the number of subtrees having exactly $4$ nodes is $O(n^a\log^bn)$. Then the value of $a+10b$ is __________.
Consider a rooted n node binary tree represented using pointers. The best upper bound on the time required to determine the number of subtrees having exactly $4$ nodes is...
24.3k
views
answered
Nov 10, 2016
DS
gatecse-2014-set1
data-structures
binary-tree
numerical-answers
normal
+
–
2
answers
24
MadeEasy Test Series 2017: Computer Networks - Ethernet
Assume that X and Y are the only two stations on an Ethernet. Each has a steady queue of frames to send. Both X and Y attempt to transmit a frame, they wait to get the control of channel using binary exponential algorithm. The ... fifth round of the algorithm (assuming every time both X and Y will collide in back-off race till 4th round) is
Assume that X and Y are the only two stations on an Ethernet. Each has a steady queue of frames to send. Both X and Y attempt to transmit a frame, they wait to get the co...
3.8k
views
commented
Nov 6, 2016
Computer Networks
made-easy-test-series
computer-networks
ethernet
+
–
1
answer
25
TestBook Test Series: Computer Networks - Flow Control Methods
Two station A and B are connected via a point to point Link.A sends a freame to B using Go back-n protocolwith window size 7 and sequence number is of 3 bit.A sends frame one by one but B's ack for frame 3 is not reached ... ACK4,but frame 5 is lost and not received by B..so now what will be the buffer frame of current window of A?
Two station A and B are connected via a point to point Link.A sends a freame to B using Go back-n protocolwith window size 7 and sequence number is of 3 bit.A sends frame...
787
views
commented
Nov 5, 2016
Computer Networks
testbook-test-series
computer-networks
flow-control-methods
go-back-n
+
–
1
answer
26
MadeEasy Test Series: Databases - Er Diagram
Consider the following ER diagram: The minimum number of tables needed to represent ER-diagram are _____ .
Consider the following ER diagram:The minimum number of tables needed to represent ER-diagram are _____ .
3.2k
views
commented
Nov 1, 2016
Databases
made-easy-test-series
databases
er-diagram
+
–
1
answer
27
made easy test
A computer system with 2 level paging scheme in which regular memory access takes 300 nanoseconds and servicing a pagefault takes 500ns. An average instruction takes 200 ns of CPU time and one memory access. The TLB hit ratio is 80% and page fault ratio is 20%. The average instruction execution time is ? My answer is 660 ns but made easy solution has 580 ns. Can any one check??
A computer system with 2 level paging scheme in which regular memory access takes 300 nanoseconds and servicing a pagefault takes 500ns. An average instruction takes 200 ...
1.7k
views
comment edited
Oct 30, 2016
Operating System
paging
operating-system
translation-lookaside-buffer
+
–
1
answer
28
Elaborate Unix INODE
Consider a file system implemented using unix inode. The system consist of $n_{0}$ direct disk block addresses, $n_{1}$ single indirect disk block addresses, $n_{2}$ doubly indirect DBAs and $n_{3}$ triple indirect DBAs. The Disk Block Address = ... is implemented. this includes data we can point to + all of metadata together. Please verify what is correct and what isn't.
Consider a file system implemented using unix inode. The system consist of $n_{0}$ direct disk block addresses, $n_{1}$ single indirect disk block addresses, $n_{2}$ dou...
2.9k
views
commented
Oct 29, 2016
Operating System
operating-system
inode
unix
+
–
1
answer
29
question related to gate 2008_67 (complex question)
Question related to: gate 2008_67 Here is the question: https://gateoverflow.in/490/gate2008_67?show=61309#c61309 "So, in the given question, a main memory page frame is fetched with 24 bits of address and 12 offset bits, while ... bit for calculating the no of page tables possible? Please correct my concept,at any level,where i went wrong.
Question related to: gate 2008_67Here is the question: https://gateoverflow.in/490/gate2008_67?show=61309#c61309"So, in the given question, a main memory page frame is fe...
2.2k
views
commented
Oct 24, 2016
Operating System
paging
multilevel
operating-system
+
–
3
answers
30
GATE CSE 1995 | Question: 1.10
Consider a grammar with the following productions $S \rightarrow a \alpha b \mid b \alpha c \mid aB$ $S \rightarrow \alpha S\mid b$ $S \rightarrow \alpha b b\mid ab$ $S \alpha \rightarrow bd b\mid b$ The above grammar is: Context free Regular Context sensitive $LR(k)$
Consider a grammar with the following productions$S \rightarrow a \alpha b \mid b \alpha c \mid aB$$S \rightarrow \alpha S\mid b$$S \rightarrow \alpha b b\mid ab$$...
18.1k
views
commented
Oct 22, 2016
Compiler Design
gate1995
compiler-design
grammar
normal
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register