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
Questions by Rahul Jain25
0
votes
1
answer
1
TOC DPDA
A DPDA can have dead configurations?? True/False. I think answer should be true bcoz DPDA requires that for a combination of top symbol and input at each state there is unique transition.
A DPDA can have dead configurations?? True/False.I think answer should be true bcoz DPDA requires that for a combination of top symbol and input at each state there is un...
892
views
asked
Feb 9, 2017
Theory of Computation
theory-of-computation
context-free-language
deterministic-context-free-grammars
+
–
0
votes
1
answer
2
Computer network MSS and MTU
Are these definations of MSS and MTU correct?? MSS is maximum payload of TCP segment. TCP segment (MSS + TCP header) For IPpacket, it consists of (MSS + TCP header + IP header) And payload of IP packet means (TCPheader + MSS) Ethernet frame ... Also is fragmentation always done at router?? Can it be done by source?? I am really confused about these terms. Plz verify.
Are these definations of MSS and MTU correct??MSS is maximum payload of TCP segment.TCP segment (MSS + TCP header)For IPpacket, it consists of (MSS + TCP header + IP head...
2.9k
views
asked
Feb 8, 2017
Computer Networks
computer-networks
tcp
network
ip-packet
ethernet
+
–
8
votes
3
answers
3
Gatebook mock
Below is a precedence graph for a set of tasks to be executed on a parallel processing system $S$. Efficiency is defined as the ratio between the speedup and the number of processors. (The speedup is defined as the ratio of the time taken to perform a set of tasks on a single ... same time, what is the efficiency of this precedence graph on $S$? $25\%$ $33\:1/3\%$ $50\%$ $100\%$
Below is a precedence graph for a set of tasks to be executed on a parallel processing system $S$. Efficiency is defined as the ratio between the speedup and the number o...
1.6k
views
asked
Feb 8, 2017
CO and Architecture
gatebook-mt2
co-and-architecture
speedup
+
–
0
votes
0
answers
4
Gatebook mock 2
310
views
asked
Feb 8, 2017
2
votes
1
answer
5
Decidability
Ambiguity of DCFL and CFL is decidable or not??
Ambiguity of DCFL and CFL is decidable or not??
1.9k
views
asked
Feb 7, 2017
Theory of Computation
decidability
theory-of-computation
context-free-language
deterministic-context-free-grammars
+
–
0
votes
1
answer
6
Computer networks colloison domain
What is number of colloision domains in following devices with x-interface??? A) Switch B) Hub C) Router D) Repeater E) Bridge E) Gateway
What is number of colloision domains in following devices with x-interface???A) SwitchB) HubC) RouterD) RepeaterE) BridgeE) Gateway
1.2k
views
asked
Feb 7, 2017
Computer Networks
computer-networks
network
network-flow
+
–
0
votes
1
answer
7
Decidablity+DCFL
I) L-R where L is DCFl and R is regular. Is L-R also DCFL decidable or not??? II)If L1 is reducible to L2 and L2 is non-RE then L1 is also Non-RE??? III) If L1 is reducible to L2 and L1 is non-RE then L2 is also non-RE??
I) L-R where L is DCFl and R is regular. Is L-R also DCFL decidable or not???II)If L1 is reducible to L2 and L2 is non-RE then L1 is also Non-RE??? III) If L1 is reducibl...
834
views
asked
Feb 7, 2017
Theory of Computation
theory-of-computation
decidability
dcfl
closure-property
regular-language
recursive-and-recursively-enumerable-languages
+
–
20
votes
2
answers
8
COA DMA doubt
What is formula for % of time CPU gets blocked?? Is it X(X+Y) or X/Y only??? What is formula for % of time CPU is consumed in Interuppt driven IO??? Formula for % of CPU slow down in interrupt driven IO???
What is formula for % of time CPU gets blocked??Is it X(X+Y) or X/Y only???What is formula for % of time CPU is consumed in Interuppt driven IO??? Formula for % of CPU s...
10.6k
views
asked
Feb 6, 2017
CO and Architecture
co-and-architecture
dma
interrupts
+
–
5
votes
1
answer
9
COA pipeline doubt
I) In a 4 stage pipeline processor, if each stage takes 4 cycles then what is CPI in case of successfull pipeline??? II) In a 4 stage pipeline processor, if each stage takes 2,3,4,5 cycles respectively then what is CPI in case ... are branch imstructions and branch address is available in 3rd stage then what should be branch pelanty??(In both the implementations mentioned above)
I) In a 4 stage pipeline processor, if each stage takes 4 cycles then what is CPI in case of successfull pipeline???II) In a 4 stage pipeline processor, if each stage tak...
952
views
asked
Feb 5, 2017
CO and Architecture
co-and-architecture
pipelining
stall
branch-conditional-instructions
+
–
2
votes
1
answer
10
Database 2PL and Timestamp doubt
I)All schedules that are allowed under 2PL are also allowed under Timestamp?? Is vice versa true?? II)Plz explain by giving example. I have read that there are schedules that are allowed under 2PL but not under Timestamp and vice versa, ... ?? IV) Are all view serializable allowed under Timestamp(Thomas write rule)??? Explanation along with example would be helpful.
I)All schedules that are allowed under 2PL are also allowed under Timestamp?? Is vice versa true??II)Plz explain by giving example. I have read that there are schedules t...
2.4k
views
asked
Feb 4, 2017
Databases
databases
conflict-serializable
concurrency
transaction-and-concurrency
+
–
0
votes
0
answers
11
Self doubt
Is there any valid group for which cayley table will have duplicate entry in row or column.??? Or we can say that for each valid finite group ut will have cayley table in which each row and column has all elements of group without repititon.??
Is there any valid group for which cayley table will have duplicate entry in row or column.???Or we can say that for each valid finite group ut will have cayley table in ...
206
views
asked
Feb 1, 2017
Set Theory & Algebra
set-theory&algebra
group-theory
+
–
1
votes
1
answer
12
Local Area Network
1.1k
views
asked
Jan 25, 2017
Computer Networks
computer-networks
lan-technologies
+
–
1
votes
1
answer
13
MadeEasy Subject Test: Databases - Er Diagram
what will be the key for total participation 1:1 combining tables??? plz give the Candidate keys and foreign keys seperately?? Also what if in 1:1 relation total participation is on both side than what will be key?? Composite key to both tables or key of anyone table will be selected???
what will be the key for total participation 1:1 combining tables??? plz give the Candidate keys and foreign keys seperately??Also what if in 1:1 relation total participa...
516
views
asked
Jan 1, 2017
Databases
databases
er-diagram
made-easy-test-series
+
–
0
votes
1
answer
14
Made Easy
What will be subnet for all and also their DBA's???
What will be subnet for all and also their DBA's???
574
views
asked
Dec 28, 2016
Computer Networks
made-easy-test-series
computer-networks
subnetting
bad-question
+
–
2
votes
1
answer
15
Compilers
here it is given bottom up parsing still action is given in middle so output should be GAAAAT??? Is it true that in syntax tree tanslation bottom up and top down gives same answer???
here it is given bottom up parsing still action is given in middle so output should be GAAAAT??? Is it true that in syntax tree tanslation bottom up and top down gives sa...
1.2k
views
asked
Dec 26, 2016
Compiler Design
compiler-design
syntax-directed-translation
test-series
+
–
3
votes
1
answer
16
MadeEasy Subject Test: Compiler Design - Parsing
A non left recursive and left facotred grammar in which all non-empty rules defining the same non terminal have disjoint first sets, such grammar is called _____________ a) LL(1) b) LR(0) c) LR(1) d) None asnwer given LL(1). but i think bcoz of follow there can be conflict hence none of these should be the answer. Is it right??
A non left recursive and left facotred grammar in which all non-empty rules defining the same non terminal have disjoint first sets, such grammar is called _____________a...
1.2k
views
asked
Dec 25, 2016
Compiler Design
made-easy-test-series
compiler-design
parsing
+
–
1
votes
1
answer
17
Made easy series
how can int pointer be used to point to string constant??? even if we consider that address was passed to int pointer then when while(*++p1) is executed it must raise error right bcoz we are using int pointer???
how can int pointer be used to point to string constant??? even if we consider that address was passed to int pointer then when while(*++p1) is executed it must raise err...
760
views
asked
Dec 21, 2016
Programming in C
programming
pointers
+
–
1
votes
0
answers
18
Decidability+TM
I dont get how the first is decidable and I have no idea about other two. Detailed explanation would be helpful
I dont get how the first is decidable and I have no idea about other two. Detailed explanation would be helpful
234
views
asked
Dec 13, 2016
Theory of Computation
turing-machine
decidability
+
–
1
votes
2
answers
19
Decidability
669
views
asked
Dec 13, 2016
Theory of Computation
turing-machine
decidability
recursive-and-recursively-enumerable-languages
+
–
0
votes
2
answers
20
Memory refrences
872
views
asked
Dec 11, 2016
CO and Architecture
co-and-architecture
+
–
Page:
1
2
3
4
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register