Recent activity by rahul_vashisth / GATE Overflow for GATE CSE

2 answers

1

UGC NET CSE | July 2018 | Part 2 | Question: 51
At a particular time of computation, the value of a counting semaphore is 10. Then 12 P operations and "x" V operations were performed on this semaphore. If the final value of semaphore is 7, x will be 8 9 10 11

At a particular time of computation, the value of a counting semaphore is 10. Then 12 P operations and "x" V operations were performed on this semaphore. If the final val...

2.1k views

answered Nov 26, 2023

2 answers

2

UGC NET CSE | December 2018 | Part 2 | Question: 69
To overcome difficulties in Readers-Writers problem, which of the following statement/s is/are true? Writers are given exclusive access to shared objects. Readers are given exclusive access to shared objects. Both Readers and Writers are given exclusive ... the code given below : $Code:$ (i) only (ii) only (iii) only Both (ii) and (iii)

To overcome difficulties in Readers-Writers problem, which of the following statement/s is/are true?Writers are given exclusive access to shared obje...

2.7k views

answered Nov 26, 2023

6 answers

3

ISRO2008-8
The TCP sliding window can be used to control the flow of information always occurs when the field value is $0$ always occurs when the field value is $1$ occurs horizontally

The TCP sliding windowcan be used to control the flow of informationalways occurs when the field value is $0$always occurs when the field value is $1$occurs horizontally

4.5k views

answered Nov 22, 2023

2 answers

4

Computer Science - UGC NET 2021 [ Question ID = 2349 ]
Given below are two statements : Statement I: Cleanroom software process model incorporates the statistical quality certification of code increments as they accumulate into a system. Statement II: Cleanroom software engineering follows the classic analysis, ... I is true but Statement II is false. Statement I is false but Statement II is true.

Given below are two statements : Statement I: Cleanroom software process model incorporates the statistical quality certification of code increments as they accumulate in...

393 views

answered Nov 15, 2023

1 answer

5

Computer Science - UGC NET 2021 [ Question ID = 2350 ]
Given below are two statements, one is labelled as Assertion A and the other is labelled as Reason R : Assertion A : Software developers do not do exhaustive software testing in practice. Reason R : Even for small inputs, exhaustive testing is too ... R is NOT the correct explanation of A. A is true but R is false. A is false but R is true.

Given below are two statements, one is labelled as Assertion A and the other is labelled as Reason R : Assertion A : Software developers do not do exhaustive software tes...

369 views

commented Nov 15, 2023

2 answers

6

UGC NET CSE | December 2010 | Part 2 | Question: 18
Which of the following is an optimistic concurrency control method ? Validation based Time stamp ordering Lock-based None of these

Which of the following is an optimistic concurrency control method ?Validation basedTime stamp orderingLock-basedNone of these

4.3k views

commented Nov 14, 2023

3 answers

7

NIELIT 2017 OCT Scientific Assistant A (CS) - Section B: 21
What is the modality of relationship, if there is no explicit need for relationship to occur? Zero Two Three One

What is the modality of relationship, if there is no explicit need for relationship to occur?ZeroTwoThreeOne

1.0k views

answered Nov 14, 2023

1 answer

8

UGC NET CSE | October 2022 | Part 1 | Question: 63
How many rotations are required during the construction of an $\text{AVL}$ tree if the following elements are to be added in the given sequence? $35,50,40,25,30,60,78,20,28$ $2$ left rotations, $2$ right rotations $2$ left rotations, $3$ right rotations $3$ left rotations, $2$ right rotations $3$ left rotations, $1$ right rotation

How many rotations are required during the construction of an $\text{AVL}$ tree if the following elements are to be added in the given sequence?$35,50,40,25,30,60,78,20,2...

450 views

answered Aug 3, 2023

1 answer

9

UGC NET CSE | June 2023 | Part 2: 59
Given below are two statements: Which of the following concurrency control protocol ensures both conflict serializability and freedom from deadlock? Statement $\text{I}$: Two phase locking Statement $\text{II}$: Timestamp ordering In the light of the ... Statement $\text{I}$ is incorrect but Statement $\text{II}$ is correct Given below are two statements:

Given below are two statements:Which of the following concurrency control protocol ensures both conflict serializability and freedom from deadlock?Statement $\text{I}$: T...

355 views

answered Aug 2, 2023

3 answers

10

NIELIT 2021 Dec Scientist A - Section B: 117
Worst case scenario in case of linear search algorithm is ______________ . Item is somewhere in the middle of the array. Item is not in the array at all. Item is the last element in the array. Item is the last element in the array or is not there at all.

Worst case scenario in case of linear search algorithm is ______________ .Item is somewhere in the middle of the array.Item is not in the array at all.Item is the last el...

554 views

answered Apr 27, 2023

1 answer

11

made easy
Suppose now that R(A,B) and S(A,B) are two relations with r and s tuples,respectively(not necessarily distinct).if m is the number of (not necessarily distinct)tuples in the result of the SQL query: R intersect S; Then which of the following is the most restrictive, correct condition on the value of m? a)m=min(r,s) b)0≤m≤(r+s) c)min(r,s)≤m≤max(r,s) d)0≤m≤min(r,s)

Suppose now that R(A,B) and S(A,B) are two relations with r and s tuples,respectively(not necessarily distinct).if m is the number of (not necessarily distinct)tuples in ...

1.4k views

answered Apr 22, 2023

1 answer

12

NIELIT 2022 April Scientist B | Section B | Question: 57
Consider the following two phase locking protocol. Suppose a transaction $\text{T}$ ... guarantee neither serializability nor deadlock-freedom guarantee serializability but not deadlock-freedom guarantee deadlock-freedom but not serializability.

Consider the following two phase locking protocol. Suppose a transaction $\text{T}$ accesses (for read or write operations), a certain set of objects $\{\text{O1},\ldots,...

675 views

answered Apr 12, 2023

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