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
Recent activity by sudsho
1
answer
1
which of the following is true..??
Consider the following statements: S1 : Increasing the number of page frames allocated to a process sometime increase the page fault rate in FIFO page replacement policy irrespective of page reference string. S2 : It is not necessary to have loader everytime in main memory. ... S1 is true B) Only S2 is true C) Both S1 and S2 are true D) Neither S1 and S2 are true
Consider the following statements:S1 : Increasing the number of page frames allocated to a process sometime increase the page fault rate in FIFO page replacement policy i...
2.6k
views
commented
Feb 7, 2017
1
answer
2
Ethernet
In standard ethernet with transmission rate of 20 Mbps, the length of the cable is 2500 m and the size of a frame is 1024 bits. The propagation speed of a signal in a cable is $2 \times 10^8$ m/s. The percentage of the time medium is occupied but not used by a station is?
In standard ethernet with transmission rate of 20 Mbps, the length of the cable is 2500 m and the size of a frame is 1024 bits. The propagation speed of a signal in a cab...
2.6k
views
commented
Feb 7, 2017
Computer Networks
ethernet
computer-networks
+
–
1
answer
3
RTT
A) What is Round Trip Time ? B) Explain R.T.T. clearly for Stop n Wait , Go-Back-N , Selective Repeat ARQ .
A) What is Round Trip Time ?B) Explain R.T.T. clearly for Stop n Wait , Go-Back-N , Selective Repeat ARQ .
2.8k
views
answer selected
Feb 5, 2017
Computer Networks
sliding-window
computer-networks
+
–
2
answers
4
Theory of Computatiion
How is b*a* ⋂ a*b* = a* ⋃ b*??
How is b*a* ⋂ a*b* = a* ⋃ b*??
284
views
answered
Feb 4, 2017
Theory of Computation
theory-of-computation
+
–
2
answers
5
MadeEasy Subject Test: Operating System - Process Synchronization
Reader Writer's problem How is deadlock possible in this?
Reader Writer's problemHow is deadlock possible in this?
851
views
answer selected
Feb 4, 2017
Operating System
made-easy-test-series
operating-system
process-synchronization
+
–
1
answer
6
test series
5's complement of a given number (43)base8,when it is expressed with base 5?
5's complement of a given number (43)base8,when it is expressed with base 5?
676
views
commented
Feb 4, 2017
1
answer
7
starvation
I'm looking for an explanation for this Since no bounded waiting means a process waits while others can enter the system hence that process is starving and starvation freedom implies no process should starve for a long amount of time (not necessarily infinite) ... this not true no starvation => bounded waiting I think I might be missing something so can you please highlight that
I'm looking for an explanation for thisSince no bounded waiting means a process waits while others can enter the system hence that process is starving and starvation free...
1.4k
views
commented
Feb 4, 2017
Operating System
operating-system
deadlock-prevention-avoidance-detection
+
–
0
answers
8
DBMS ERD DOUBT
i think answer is 4. given ans. is 3 pls confirm.
i think answer is 4. given ans. is 3 pls confirm.
1.3k
views
commented
Feb 4, 2017
1
answer
9
database doubt
if two entities A and B are connected using total participation with relation R then minimum number of tables required in relational model is?
if two entities A and B are connected using total participation with relation R then minimum number of tables required in relational model is?
710
views
commented
Feb 4, 2017
2
answers
10
Group Theory discrete maths
A={1,2,3,4,5,6} Given that set A is a group with respect to multiplication mod 7.Is A a cyclic group?If yes,identify the generators. Is there any theorem that i cana pply here to solve without building operation table?
A={1,2,3,4,5,6}Given that set A is a group with respect to multiplication mod 7.Is A a cyclic group?If yes,identify the generators.Is there any theorem that i cana pply h...
3.1k
views
commented
Feb 3, 2017
Set Theory & Algebra
discrete-mathematics
group-theory
+
–
2
answers
11
Higher normal form decomposition
$X$ is an entity set. $E$ and $F$ are multivalued attributes. How many minimum tables which satisfy 1NF ? How many minimum tables which satisfy 2NF ? How many minimum tables which satisfy 3NF ? How many minimum tables which satisfy BCNF ? How many minimum tables which satisfy 4NF ?
$X$ is an entity set. $E$ and $F$ are multivalued attributes.How many minimum tables which satisfy 1NF ?How many minimum tables which satisfy 2NF ?How many minimum tables...
2.5k
views
commented
Feb 1, 2017
Databases
database-normalization
databases
decomposition
er-diagram
+
–
1
answer
12
Compiler design
G : Grammar S1 : Every LALR(1) G is LR(1). S2 : Every LR(1) G is LALR(1). S3: Some LL(1) is Regular. A. TFF B.TFT C. TTF D. FTT E. NONE
G : GrammarS1 : Every LALR(1) G is LR(1).S2 : Every LR(1) G is LALR(1).S3: Some LL(1) is Regular.A. TFF B.TFT C. TTF D. FTT E. NONE
318
views
answer selected
Feb 1, 2017
Compiler Design
compiler-design
parsing
lr-parser
+
–
0
answers
13
virtual gate
276
views
comment edited
Feb 1, 2017
2
answers
14
compliment in hasse diagram
2.4k
views
commented
Jan 31, 2017
1
answer
15
2s complement Notation
What is the difference betwen 2s complent of a number and 2s complement representation of a number .
What is the difference betwen 2s complent of a number and 2s complement representation of a number .
1.2k
views
commented
Jan 31, 2017
Digital Logic
number-representation
+
–
1
answer
16
ME test
Which of the following is correct? A) Every Distributive Lattice is Complimented Lattice B) Every Complimented Lattice is Distributive Lattice C) Every Distributive Lattice is Bounded Lattice D) None of these
Which of the following is correct?A) Every Distributive Lattice is Complimented LatticeB) Every Complimented Lattice is Distributive LatticeC) Every Distributive Lattice ...
779
views
answered
Jan 31, 2017
1
answer
17
slow start doubt
570
views
commented
Jan 30, 2017
0
answers
18
Made easy Linear algebra
Is it necessary that the lower triangular matrix should contain 1 as leading diagonal in LU decomposition? In the solution to this problem they have taken the triangular matrix diagonal as 1.
Is it necessary that the lower triangular matrix should contain 1 as leading diagonal in LU decomposition? In the solution to this problem they have taken the triangular ...
434
views
commented
Jan 30, 2017
Linear Algebra
linear-algebra
engineering-mathematics
+
–
0
answers
19
fragmentation
801
views
commented
Jan 30, 2017
0
answers
20
Self Doubt
By seeing a grammar I can say it is ambiguous or not. But How can I say it is inherently ambiguous or not.?
By seeing a grammar I can say it is ambiguous or not. But How can I say it is inherently ambiguous or not.?
782
views
commented
Jan 30, 2017
Theory of Computation
theory-of-computation
inherently-ambiguous
ambiguous
+
–
1
answer
21
ace mock 6 max size of packet
409
views
commented
Jan 30, 2017
2
answers
22
Testbook Test Series: Theory Of Computation - Identify Class Language
# i confirm answer plz check???
# i confirm answer plz check???
914
views
answer selected
Jan 30, 2017
Theory of Computation
theory-of-computation
testbook-test-series
identify-class-language
+
–
1
answer
23
ACE test series
872
views
comment edited
Jan 27, 2017
Theory of Computation
ace-test-series
+
–
2
answers
24
Operating System Concepts, 7th Edition, Q12.2
Suppose that a disk drive has 5,000 cylinders, numbered 0 to 4999. The drive is currently serving a request at cylinder 143, and the previous request was at cylinder 125. The queue of pending requests, in FIFO order, is: 86,1470, 913 ... , what is the total distance (in cylinders) that the disk arm moves to satisfy all the pending requests for C-SCAN?
Suppose that a disk drive has 5,000 cylinders, numbered 0 to 4999. Thedrive is currently serving a request at cylinder 143, and the previousrequest was at cylinder 125. T...
5.7k
views
answer edited
Jan 27, 2017
Operating System
operating-system
disk-scheduling
disk
normal
+
–
5
answers
25
UGC NET CSE | January 2017 | Part 3 | Question: 2
Which of the following is incorrect for virtual memory? Large programs can be written More I/O is required More addressable memory available Faster and easy swapping of process
Which of the following is incorrect for virtual memory?Large programs can be writtenMore I/O is requiredMore addressable memory availableFaster and easy swapping of proce...
1.8k
views
comment edited
Jan 27, 2017
Operating System
ugcnetcse-jan2017-paper3
operating-system
virtual-memory
+
–
1
answer
26
NET Jan17 paper-3 Q19
Q19 Which of the following are not regular A)Strings of even number of a's. B)Strings of a's , whose length is a prime number. C)Set of all palindromes made up of a's and b's. D)trings of a's , whose length is a perfect square. 1) A and B only 2) A,B,C only 3) B,C and D only 4) B and D only
Q19 Which of the following are not regularA)Strings of even number of a's.B)Strings of a's , whose length is a prime number.C)Set of all palindromes made up of a's and b'...
1.6k
views
answered
Jan 26, 2017
1
answer
27
toc - doubt
how (i) is true???
how (i) is true???
698
views
answer selected
Jan 26, 2017
Theory of Computation
theory-of-computation
+
–
0
answers
28
Ethernet
according to standards of ethernet minimum data size in LAN is 64bytes in some question by solving L=2Tp*B, i got L value as 60bytes. now answer for this question shud be 60bytes according to the answer or 64 bytes according to standards?
according to standards of ethernet minimum data size in LAN is 64bytesin some question by solving L=2Tp*B, i got L value as 60bytes.now answer for this question shud be 6...
1.1k
views
comment edited
Jan 25, 2017
Computer Networks
ethernet
+
–
1
answer
29
testbook compiler
529
views
answer selected
Jan 25, 2017
Compiler Design
compiler-design
parsing
first-and-follow
testbook-test-series
+
–
0
answers
30
repeted values in Relation Table
I want to know as we know codd's rule says that no two tuples in a relation should be same. i.e we can not have 2 tuples with same values in clm feilds. now to maintain these constraints, we choose to have some key over the relation ... having mutiset values, (as there are no keys present), how Dbms do indexing to retrive records? someone help me on this pls.
I want to know as we know codd's rule says that no two tuples in a relation should be same. i.e we can not have 2 tuples with same values in clm feilds. now to maintain t...
1.4k
views
comment edited
Jan 25, 2017
Databases
databases
sql
relational-dbms
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register