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?

asked in Operating System Feb 2, 2019

394 views

0 votes

0 answers

2

Previous gate

asked in Linear Algebra Jan 31, 2019

351 views

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?

asked in Databases Jan 24, 2019

195 views

0 votes

0 answers

4

Clarification on Topic
In the syllabus it was said “differentiability” does this mean we have partial differentiation.??

asked in Calculus Jan 2, 2019

341 views

1 vote

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

asked in Computer Networks Jan 1, 2019

444 views

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$

asked in Theory of Computation Dec 25, 2018

388 views

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

asked in DS Dec 17, 2018

538 views

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

asked in Theory of Computation Dec 13, 2018

3.6k views

1 vote

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.

asked in Databases Dec 4, 2018

430 views

1 vote

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 ?

asked in CO and Architecture Nov 7, 2018

780 views

tags	tag:apple
author	user:martin
title	title:apple
content	content:apple
exclude	-tag:apple
force match	+apple
views	views:100
score	score:10
answers	answers:2
is accepted	isaccepted:true
is closed	isclosed:true

Questions by Hemanth_13

Subscribe to GATE CSE 2024 Test Series

Subscribe to GO Classes for GATE CSE 2024

Subjects

Questions by Hemanth_13

Subscribe to GATE CSE 2024 Test Series

Subscribe to GO Classes for GATE CSE 2024

Recent Posts

Subjects

Recent Blog Comments