Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by sudsho
2
votes
61
ACE test series
178
views
answered
Dec 27, 2016
2
votes
62
#ACE test series
which of the following is inccorect for the meaning of null values? A) value unknown B) value exist but not available C) attribute does not apply to this tupple D) none
which of the following is inccorect for the meaning of null values?A) value unknownB) value exist but not availableC) attribute does not apply to this tuppleD) none
440
views
answered
Dec 26, 2016
6
votes
63
me test
An upper layer packet is split into 20 frames each of which has 80 percent chance of arriving undamaged. No error control is done by data link layer. The number of times message be sent on average to get the entire message through is ________.
An upper layer packet is split into 20 frames each of which has 80 percentchance of arriving undamaged. No error control is done by data link layer. Thenumber of times me...
815
views
answered
Dec 15, 2016
Computer Networks
test-series
computer-networks
+
–
2
votes
64
cnn doubt
which of the following routing algo allows more duplication of packets A flooding Bselective flooding C link state D.shortest distance routing algo
which of the following routing algo allows more duplication of packetsA flooding Bselective floodingC link state D.shortest distance routing algo
346
views
answered
Dec 13, 2016
Computer Networks
computer-networks
+
–
3
votes
65
GATE CSE 2005 | Question: 25
The maximum window size for data transmission using the selective reject protocol with $n\text{-bit}$ frame sequence numbers is: $2^n$ $2^{n-1}$ $2^n-1$ $2^{n-2}$
The maximum window size for data transmission using the selective reject protocol with $n\text{-bit}$ frame sequence numbers is:$2^n$$2^{n-1}$$2^n-1$$2^{n-2}$
38.8k
views
answered
Dec 13, 2016
Computer Networks
gatecse-2005
computer-networks
sliding-window
easy
+
–
5
votes
66
which data structure is used in BFS
Which data structure is used in breadth first search of a graph to store nodes ? 1)Array 2)Stack 3)Queue 4)Tree
Which data structure is used in breadth first search of a graph to store nodes ?1)Array2)Stack3)Queue4)Tree
12.7k
views
answered
Dec 12, 2016
4
votes
67
Difference Between Subnetmask and DBA
Given a classful network if we are given an IP address . How do we deffertiate it as DBA or Subnetmask ? Are the same ? Please explain with an example
Given a classful network if we are given an IP address . How do we deffertiate it as DBA or Subnetmask ? Are the same ? Please explain with an example
806
views
answered
Dec 12, 2016
Computer Networks
computer-networks
+
–
3
votes
68
An electronic device used to connect different types of topologies having same protocol
An electronic device used to connect different types of topologies having same protocol 1)Repeater 2)Router 3)Bridge 4)Switch
An electronic device used to connect different types of topologies having same protocol1)Repeater2)Router3)Bridge4)Switch
4.0k
views
answered
Dec 11, 2016
4
votes
69
Error detecting at datalink layer
Error detecting at datalink layer is achieved by a)Equalization b)Bit stuffing c)Hammingcodes d)Cyclic Redundancy code
Error detecting at datalink layer is achieved bya)Equalizationb)Bit stuffingc)Hammingcodesd)Cyclic Redundancy code
1.9k
views
answered
Dec 11, 2016
1
votes
70
MadeEasy Test Series: Compiler Design - Grammar
How it is left factored??
How it is left factored??
601
views
answered
Dec 11, 2016
Compiler Design
made-easy-test-series
compiler-design
grammar
+
–
1
votes
71
SLR(1) Parser
Every SLR grammar is unambiguous. True or False? Why?
Every SLR grammar is unambiguous. True or False? Why?
1.5k
views
answered
Dec 10, 2016
Compiler Design
compiler-design
parsing
lr-parser
ambiguous-grammar
descriptive
+
–
8
votes
72
CFL or not ?
I'm having problems with identifying CFL languages a lot recently.I understand L1 is not , but how come L2 is ? Understood 1 stack is enough but aren't there two comparisons ? Or that doesn't matter you can do any number of comparisons ? ... comparisons are needed n<k and k<2n. Any other fixed formula , to identify class of language which acts as easy guideline ?
I'm having problems with identifying CFL languages a lot recently.I understand L1 is not , but how come L2 is ? Understood 1 stack is enough but aren't there two comparis...
3.3k
views
answered
Dec 7, 2016
Theory of Computation
theory-of-computation
context-free-language
dcfl
+
–
1
votes
73
Database
Given R (ABCDE) A-->BC,CD->E B->D E->A CONVERT GIVEN INTO 1NF 2NF 3NF AND THEN BCNF PLEASE VERIFY :)
Given R (ABCDE)A >BC,CD->E B->D E->ACONVERT GIVEN INTO 1NF 2NF 3NF AND THEN BCNF PLEASE VERIFY :)
301
views
answered
Dec 2, 2016
Databases
databases
+
–
1
votes
74
Routers
I read Each interface of a router is assigned an IP address. at many places. What does an interface mean here. Does it mean various Ethernet ports in a Router. From which side the IP address that is assigned to this interface is taken? So, suppose a router has 4 ports ... are connected through them. Let their IP addresses be $A,B,C$ and $D$. then what does an interface having an IP mean ?
I read Each interface of a router is assigned an IP address. at many places. What does an interface mean here. Does it mean various Ethernet ports in a Router.From which ...
562
views
answered
Nov 29, 2016
Computer Networks
computer-networks
+
–
3
votes
75
Regular Languages
If L1 contains finite number of strings and L2 is a CFL then $L1\cap L2$ is ____ (A) Regular (B) CSL (C) CFL (D) None of these
If L1 contains finite number of strings and L2 is a CFL then $L1\cap L2$ is ____(A) Regular(B) CSL(C) CFL(D) None of these
983
views
answered
Nov 27, 2016
Theory of Computation
theory-of-computation
regular-language
context-free-language
+
–
1
votes
76
TOC_GATE
Let G = ({S}, {a, b} R, S) be a context free grammar where the rule set R is S → a S b | SS | ε Which of the following statements is true? A G is not ambiguous B There exist x, y, ∈ L (G) such that xy ∉ L(G) There is a deterministic pushdown automaton that accepts L(G) D We can find a deterministic finite state automaton that accepts L(G)
Let G = ({S}, {a, b} R, S) be a context free grammar where the rule set R is S → a S b | SS | ε Which of the following statements is true?AG is not ambiguousBThere exi...
485
views
answered
Nov 26, 2016
4
votes
77
self_doubt
what is page fault service time ? what are its factor and how it is related/not related with the memory access time?? plss help with suitable example
what is page fault service time ? what are its factor and how it is related/not related with the memory access time??plss help with suitable example
773
views
answered
Nov 25, 2016
2
votes
78
MadeEasy Test Series: Computer Networks - Flow Control Methods
Station X needs to send a message consisting of 12 packets to station Y using a sliding window protocol (Window Size 4) and Go back n error control strategy. All packets are ready and immediately available for transmission. If every ... gets lost), then the number of packets that X will transmit for sending the message to Y are _____.
Station X needs to send a message consisting of 12 packets to station Y using a sliding window protocol (Window Size 4) and Go back n error control strategy. All packets ...
2.3k
views
answered
Nov 25, 2016
Computer Networks
made-easy-test-series
computer-networks
flow-control-methods
sliding-window
+
–
Page:
« prev
1
2
3
4
5
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register