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 Hemanth_13
0
votes
1
answer
1
Minor Clarifications
OS: Which process scheduling mechanism gives the optimal average waiting time and throughput, is it SJF or SRTF? Which DISK scheduling algo gives the minimum seek time is it SSTF?
OS:Which process scheduling mechanism gives the optimal average waiting time and throughput, is it SJF or SRTF?Which DISK scheduling algo gives the minimum seek time is i...
396
views
asked
Feb 2, 2019
Operating System
scheduling
+
–
0
votes
0
answers
2
Previous gate
354
views
asked
Jan 31, 2019
Linear Algebra
eigen-value
+
–
0
votes
0
answers
3
#selfdoubt
R2(X) R2(Y) R1(X) R1(Y) W1(X) R2(X) R2(X) R2(Y) R1(X) R1(Y) W1(X) R1(X) R2(X) R2(Y) R1(X) R1(Y) W1(X) commit(t1) R2(X) Which of the above have unrepeatable read problem?
R2(X) R2(Y) R1(X) R1(Y) W1(X) R2(X)R2(X) R2(Y) R1(X) R1(Y) W1(X) R1(X)R2(X) R2(Y) R1(X) R1(Y) W1(X) commit(t1) R2(X)Which of the above have unrepeatable read problem?
201
views
asked
Jan 24, 2019
Databases
schedules-dbms
+
–
0
votes
0
answers
4
Clarification on Topic
In the syllabus it was said “differentiability” does this mean we have partial differentiation.??
In the syllabus it was said “differentiability” does this mean we have partial differentiation.??
339
views
asked
Jan 2, 2019
Calculus
general-query
+
–
1
votes
0
answers
5
Previous year question doubt
Consider the following statements regarding the slow start phase of the TCP congestion control algorithm. Note that cwnd stands for the TCP congestion window and MSS window denotes the Maximum Segments Size: The cwnd increases by 2MSS on every successful ... in RTT time. If that statement is true I will get option 2 Can someone please clarify on above statement
Consider the following statements regarding the slow start phase of the TCP congestion control algorithm. Note that cwnd stands for the TCP congestion window and MSS wind...
437
views
asked
Jan 1, 2019
Computer Networks
computer-networks
+
–
0
votes
0
answers
6
Self Doubt on language acceptance
$L= {WW^RX| W,X=(a+b)^+}$ My question was why can’t this be regular?? Consider below regular expression $aa(a+b)^+ + ab(a+b)^+ +ba(a+b)^+ + bb(a+b)^+$==>$(aa+ab+ba+bb)(a+b)^+$ wont this language generate all strings of L as we do for $WXW^R$
$L= {WW^RX| W,X=(a+b)^+}$ My question was why can’t this be regular??Consider below regular expression $aa(a+b)^+ + ab(a+b)^+ +ba(a+b)^+ + bb(a+b)^+$==>$(aa+ab+ba+bb)(...
380
views
asked
Dec 25, 2018
Theory of Computation
theory-of-computation
+
–
0
votes
1
answer
7
Aspire Buzz #hashing
If h is any hashing function and is used to hash n keys in to a table of size m, where n<=m, the expected number of collisions involving a particular key x is : a.)Less than 1 b.)Less than n c.)Less than m d.)Less than n/2. My thought: If all the elements maps to same key then number of collisions would be less than n, am I wrong anywhere
If h is any hashing function and is used to hash n keys in to a table of size m, where n<=m, the expected number of collisions involving a particular key x is :a.)Less th...
542
views
asked
Dec 17, 2018
DS
hashing
+
–
3
votes
3
answers
8
MadeEasy Subject Test 2019: Theory Of Computation - Decidability
Consider <M> be the encoding of Turing Machine as string over alphabet $\Sigma$ = {0,1}.Consider L= { <M>| M is TM that halt on all input and L(M) = L` for some undecidable language L` . Then L is Decidable and Recursive Decidable and non Recursive Undecidable and Recursive Undecidable and non Recursive
Consider <M be the encoding of Turing Machine as string over alphabet $\Sigma$ = {0,1}.Consider L= { <M>| M is TM that halt on all input and L(M) = L for some undecidab...
3.5k
views
asked
Dec 13, 2018
Theory of Computation
made-easy-test-series
theory-of-computation
decidability
turing-machine
+
–
1
votes
0
answers
9
Self Doubt on ER diagram
How to solve these type of questions https://gateoverflow.in/201404/er-diagram Copying the image for quick reference: Minimum no of tables. My approach was: First allocate all the relationships to entities (i.e decide on relationships) So here R5 goes with E4 , R4 ... tables will be E1R1E2R2, E4R5, E3R4, R3. Correct me if I'm wrong. Let me know if there is a better process.
How to solve these type of questions https://gateoverflow.in/201404/er-diagramCopying the image for quick reference:Minimum no of tables.My approach was:First allocate al...
425
views
asked
Dec 4, 2018
Databases
databases
er-diagram
er-to-relational
+
–
1
votes
2
answers
10
COA: Cache Accesss Time
Little confusion with these questions. What will be o/p for these two questions one with Write back and the other is Write through. 1.)A 128 word cache and main memory are divided into 8 word blocks. The access time of a cache ... average access time? What will be the default technique ( write-allocate and no write-allocate)followed for Hierarchal and Simultaneous access ?
Little confusion with these questions.What will be o/p for these two questions one with Write back and the other is Write through.1.)A 128 word cache and main memory are ...
810
views
asked
Nov 7, 2018
CO and Architecture
co-and-architecture
cache-memory
write-through
write-back
effective-memory-access
numerical-answers
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register