Questions by vix28 / GATE Overflow for GATE CSE

11 votes

2 answers

1

serializablity and recoverability of schedules
1) T1: R(X), T2: W(X), T1: W(X), T2: Abort, T1: Commit 2) T1: W(X), T2: R(X), T1: W(X), T2: Abort, T1: Commit 3) T1: W(X), T2: R(X), T1: W(X), T2: ... : Abort Can anyone explain whether these schedules are serializable, conflict-serializable, view serializable, recoverable, avoids-cascading-aborts, and strict? The abort operation actually bugging me.

1) T1: R(X), T2: W(X), T1: W(X), T2: Abort, T1: Commit2) T1: W(X), T2: R(X), T1: W(X), T2: Abort, T1: Commit3) T1: W(X), T2: R(X), T1: W(X), T2: Commit, T1: AbortCan anyo...

12.5k views

asked Sep 8, 2016

2 votes

1 answer

2

validity of relational algebra query
Let R and S be two relations, and l be an attribute common to R and S. Let c be a condition over the attributes common to R and S. Prove or disprove the following:

Let R and S be two relations, and l be an attribute common to R and S.Let c be a condition over the attributes common to R and S. Prove ordisprove the following:

479 views

asked Apr 26, 2016

0 votes

3 answers

3

Calculation of context switch overhead - ISI KOL -2014 Qstn 6(a)
Consider three processes, P1, P2, and P3. Their start times and execution times are given below Let x be the amount of time taken by the kernel to complete a context switch from any process Pi to Pj . For what ... P1, P2, P3 be reduced by choosing a Shortest Remaining Time First scheduling policy over a Shortest Job First policy?

Consider three processes, P1, P2, and P3. Their start times and executiontimes are given belowLet x be the amount of time taken by the kernel to complete a contextswitch ...

847 views

asked Apr 26, 2016

6 votes

4 answers

4

multilevel paging technique
A virtual memory system is able to support virtual address space of 256 GB. An entry in the page table is 4 bytes long. (i) Calculate the minimum page size required for a three-level paging scheme. (ii) Draw a diagram indicating how the bits of a ... (and how many) are used to index the page tables at each level, and which bits form the page offset for the case above.

A virtual memory system is able to support virtual address space of 256 GB. An entryin the page table is 4 bytes long.(i) Calculate the minimum page size required for a t...

7.8k views

asked Apr 24, 2016

0 votes

0 answers

5

Time taken for the entire message to reach from source to destination
A 64000-byte message is to be transmitted over a 2-hop path in a storeand- forward packet-switching network. The network limits packets to a maximum size of 2032 bytes including a 32-byte header. The transmission lines in the ... + 31*32.512 msec= 1115.398 msec Can anyone confirm this answer. Please help if any error is there .

A 64000-byte message is to be transmitted over a 2-hop path in a storeand- forward packet-switching network. The network limits packets to a maximum size of 2032 bytes in...

3.6k views

asked Apr 12, 2016

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