GATE CSE 1996 | GATE CSE Year Wise Previous Years Questions

GATE CSE 1996

MCQ (Single Correct Answer)

-0.6

Four jobs to be executed on a single processor system arrive at time $${0^ + }$$ in the order $$A, B, C, D.$$ their burst $$CPU$$ time requirements are $$4, 1, 8, 1$$ time units respectively. The completion time of A under round robin scheduling with time slice of one time units.

$$10$$

$$4$$

$$8$$

$$9$$

GATE CSE 1996

MCQ (Single Correct Answer)

-0.3

A critical section is a program segment

Which should run in certain specified amount of time

Which avoids deadlocks

Where shared resources are accessed

Which must be enclosed by a pair of semaphore operations, P and V

GATE CSE 1996

MCQ (Single Correct Answer)

-0.6

The correct matching for the following pairs is

List - I
(A) Activation record
(B) Location counter
(C) Reference counts
(D) Address relocation

List - II
(1) Linking loader
(2) Garbage collection
(3) Subroutine call
(4) Assembler

A – 3 B – 4 C – 1 D - 2

A – 4 B – 3 C – 1 D - 2

A – 4 B – 3 C – 2 D - 1

A – 3 B – 4 C – 2 D - 1

GATE CSE 1996

MCQ (Single Correct Answer)

-0.3

Which of the following statements is false?

The halting problem for Turing machine is un-decidable

Determining whether ambiguity a context free grammar is un-decidable

Given two arbitrary context free grammars $${G_1}$$ and $${G_2}$$ whether $$L\left( {{G_1}} \right) = L\left( {{G_2}} \right)$$

Given two regular grammars $${{G_1}}$$ and $${{G_2}},$$ it is un-decidable whether $$L\left( {{G_1}} \right) = L\left( {{G_2}} \right)$$

PREVIOUS NEXT

GATE CSE Papers

2024