Recent activity by yuvrajeyes / GATE Overflow for GATE CSE

1 answer

1

GATE Overflow Test Series | Mock GATE | Test 6 | Question: 55
Consider the following synchronization solution. do { key = TRUE; while ( key == TRUE) atomic_swap (&lock, &key); <Critical Section> lock = FALSE; } while (TRUE); Here, atomic_swap ... appropriate choices) Race condition may be possible Mutual exclusion is guaranteed Progress is guaranteed Starvation freedom is guaranteed

Consider the following synchronization solution.do { key = TRUE; while ( key == TRUE) atomic_swap (&lock, &key); <Critical Section lock = FALSE; } while (TRUE);Here, atom...

228 views

commented Jan 28, 2023

6 answers

2

Average Access time in Memory Organization
Consider a Processor with two Caches which it can access directly in parallel $L_1$(80% hit rate) and $L_2$(90% hit rate) with access times as 100ns and 200ns respectively. In case of miss in any of those it fetches the data from hard disk $L_3$(100% hit rate) which has a latency of 500ns. What is the average access time($T_{avg}$) of the organization?

Consider a Processor with two Caches which it can access directly in parallel $L_1$(80% hit rate) and $L_2$(90% hit rate) with access times as 100ns and 200ns respectivel...

4.3k views

comment edited Jan 4, 2023

1 answer

3

#Self doubt
Since Dealock --> No Progress then Does Progess --> No Deadlock bcoz contrapositive should be true.

Since Dealock No Progressthen Does Progess No Deadlockbcoz contrapositive should be true.

232 views

commented Jan 2, 2023

2 answers

4

GATE Overflow Test Series | Databases | Test 1 | Question: 14
Consider a $m:n$ relationship and an ER model using it. Which of the following is/are correct for converting this relationship to a relational instance? (Mark all the appropriate options) If participation of both the entities are ... we only need $2$ relations If participation of both the entities are optional then we need $3$ relations

Consider a $m:n$ relationship and an ER model using it. Which of the following is/are correct for converting this relationship to a relational instance? (Mark all the app...

402 views

commented Jan 1, 2023

1 answer

5

GATE Overflow Test Series | Discrete Mathematics | Test 4 | Question: 26
The minimum number of color required to color the complement of the below graph is ________

The minimum number of color required to color the complement of the below graph is ________

393 views

comment reshown Dec 30, 2022

0 answers

6

Test-Series
Consider the following language: $L$ $=$ { $<M>$ $|$ $L(M)$ has atleast $10$ strings } Which of the following is true about L? A)L is decidable B)L is Turing recognizable C)L is not recursive D)None of these

Consider the following language:$L$ $=$ { $<M>$ $|$ $L(M)$ has atleast $10$ strings }Which of the following is true about L?A)L is decidable ...

437 views

commented Nov 17, 2022

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