## Mathematics | Introduction to Propositional Logic | Set 1

What is Logic? Logic is the basis of all mathematical reasoning, and of all automated reasoning. The rules of logic specify the meaning of mathematical… Read More »

## Introduction of Process Synchronization

On the basis of synchronization, processes are categorized as one of the following two types: Independent Process : Execution of one process does not affects… Read More »

## Data Structures and Algorithms | Set 32

Following questions have been asked in GATE CS 2014 exam. 1) Let G be a graph with n vertices and m edges. What is the… Read More »

## Data Structures and Algorithms | Set 31

Following questions have been asked in GATE CS 2013 exam. 1) What is the return value of f(p, p) if the value of p is… Read More »

## Data Structures and Algorithms | Set 30

Following questions have been asked in GATE CS 2013 exam. 1) Which of the following statements is/are TRUE for an undirected graph? P: Number of… Read More »

## Operating Systems | Set 17

Following question has been asked in GATE 2012 CS exam. Fetch_And_Add(X,i) is an atomic Read-Modify-Write instruction that reads the value of memory location X, increments… Read More »

## LRU Cache Implementation

How to implement LRU caching scheme? What data structures should be used? We are given total possible page numbers that can be referred. We are… Read More »

## Database Management Systems | Set 11

Following questions have been asked in GATE CS 2007 exam. 1) Information about a collection of students is given by the relation studinfo(studId, name, sex).… Read More »

## Automata Theory | Set 5

Following questions have been asked in GATE CS 2009 exam. 1) S –> aSa| bSb| a| b ;The language generated by the above grammar over… Read More »

## Automata Theory | Set 4

Following questions have been asked in GATE CS 2011 exam. 1) Let P be a regular language and Q be context-free language such that Q… Read More »

## Automata Theory | Set 3

Following questions have been asked in GATE CS 2011 exam. 1) The lexical analysis for a modern language such as Java needs the power of… Read More »

## Automata Theory | Set 2

Following questions have been asked in GATE CS 2012 exam. 1) What is the complement of the language accepted by the NFA shown below? Assume… Read More »

## Database Management Systems | Set 10

Following questions have been asked in GATE CS 2005 exam. 1) Let r be a relation instance with schema R = (A, B, C, D).… Read More »

## Database Management Systems | Set 9

Following questions have been asked in GATE 2006 CS exam. 1) Consider the following log sequence of two transactions on a bank account, with initial… Read More »

## Computer Networks | Set 12

Following questions have been asked in GATE CS 2009 exam. 1) Let G(x) be the generator polynomial used for CRC checking. What is the condition… Read More »