Similar Topics

3.2k+ articles

GATE-GATE CS 1997

60+ articles

GATE CS 1997

60+ posts

Popular articles

Recent articles

GATE | GATE CS 1997 | Question 50

Last Updated: 06 September 2018

Let R(a,b,c) and S(d,e,f) be two relations in which d is the foreign key of S that refers to the primary key of R. Consider the following four operations R and S1. Insert ...read more

GATE-GATE CS 1997

GATE | GATE CS 1997 | Question 48

Last Updated: 07 February 2019

Each Process Pi, i= 1.......9 is coded as follows repeat P(mutex) {Critical section} V(mutex) foreverThe code for P10 is identical except it uses V(mutex) in pla ...read more

GATE-GATE CS 1997

GATE | GATE CS 1997 | Question 47

Last Updated: 28 March 2020

An operating system contains 3 user processes each requiring 2 units of resource R. The minimum number of units of R such that no deadlocks will ever arise is(A) 3(B) 5(C) ...read more

GATE-GATE CS 1997

Similar Topics

3.2k+ articles

GATE-GATE CS 1997

60+ articles

GATE | GATE CS 1997 | Question 46

Last Updated: 23 October 2017

Which of the following languages over {a,b,c} is accepted by a deterministic pushdown automata?a. {wcwR ∣ w∈ {a,b}* }b. {wwR ∣ w∈ {a,b,c}* }c. {anbncn ∣ n ≥ 0 }d. {w ∣ w i ...read more

GATE-GATE CS 1997

GATE | GATE CS 1997 | Question 44

Last Updated: 12 January 2021

Which one of the following regular expressions over {0,1} denotes the set of all strings not containing 100 as a substring?(A) 0* (1+0)*(B) 0*1010*(C) 0*1*01*(D) 0*(10+1)* ...read more

GATE-GATE CS 1997

GATE | GATE CS 1997 | Question 42

Last Updated: 02 May 2018

Let G be the graph with 100 vertices numbered 1 to 100. Two vertices i and j are adjacent if |i−j|=8or |i−j|=12. The number of connected components in G is(A)8(B)4(C)12(D) ...read more

GATE-GATE CS 1997

GATE | GATE CS 1997 | Question 32

Last Updated: 29 July 2019

A priority queue Q is used to implement a stack S that stores characters. PUSH(C) is implemented as INSERT(Q, C, K) where K is an appropriate integer key chosen by the imp ...read more

GATE-GATE CS 1997

GATE | GATE CS 1997 | Question 30

Last Updated: 16 October 2017

A binary search tree contains the values 1, 2, 3, 4, 5, 6, 7, 8. The tree is traversed in pre-order and the values are printed out. Which of the following sequences is a v ...read more

GATE-GATE CS 1997

GATE | GATE CS 1997 | Question 25

Last Updated: 27 September 2021

Dirty bit for a page in a page table(A) helps avoid unnecessary writes on a paging device(B) helps maintain LRU information(C) allows only read on a page(D) none of the ab ...read more

GATE-GATE CS 1997

GATE | GATE CS 1997 | Question 24

Last Updated: 15 October 2018

Thrashing(A) reduces page I/O(B) decreases the degree of multiprogramming(C) implies excessive page I/O(D) improves the system performance Answer: (C) Explanation: Please ...read more

GATE-GATE CS 1997

GATE | GATE CS 1997 | Question 20

Last Updated: 16 October 2017

Locality of reference implies that the page reference being made by a process(A) will always be to the page used in the previous page reference(B) is likely to be to one o ...read more

GATE-GATE CS 1997

GATE | GATE CS 1997 | Question 8

Last Updated: 17 January 2020

A language L allows declaration of arrays whose sizes are not known during compilation. It is required to make efficient use of memory. Which of the following is true?(A) ...read more

GATE-GATE CS 1997

GATE | GATE CS 1997 | Question 7

Last Updated: 06 February 2020

Which of the following is essential for converting an infix expression to the postfix from efficiently ?(A) An operator stack(B) An operand stack(C) An operand stack and a ...read more

GATE-GATE CS 1997

GATE | GATE CS 1997 | Question 4

Last Updated: 14 October 2018

The concatenation of two lists is to be performed in O(1) time. Which of the following implementations of a list should be used?(A)singly linked list(B)doubly linked list( ...read more

GATE-GATE CS 1997

GATE | GATE CS 1997 | Question 49

Last Updated: 22 April 2020

For a database relation R(a,b,c,d), where the domains a, b, c, d include only atomic values, only the following functional dependencies and those that can be inferred from ...read more

GATE-GATE CS 1997