Year-wise GATE papers

GATE 2014

19 questions and papers

GATE CS 2014 Set 2 — Question 35

Multiple choice 2 marks Theory of Computation GATE CS — Computer Science & IT

Let \(L_1 = \{w \in \{0,1\}^* \mid w\) has at least as many occurrences of (110)'s as (011)'s\(\}\). Let \(L_2 = \{w \in \{0,1\}^* \mid w\) has at least as many occurrences of (000)'s as (111)'s\(\}\). Which one of the following is TRUE?

GATE CS 2014 Set 2 – Question 40

Multiple choice 2 marks Operating Systems GATE CS — Computer Science & IT

An operating system uses the Banker's algorithm for deadlock avoidance when managing the allocation of three resource types X, Y and Z to three processes P0, P1 and…

GATE CS 2014 Set 1 – Question 32

Numerical answer 2 marks Operating Systems GATE CS — Computer Science & IT

A system uses 3 page frames for storing process pages in main memory. It uses the Least Recently Used (LRU) page replacement policy. Assume that all the page…