## How to prepare for GATE CSE – 2019

GATE(Graduate Aptitude Test in Engineering) is one the most important and in-demand entrance exam for engineering graduates in our country. M.Tech. in Computer Science is… Read More »

Quick Links for GATE 2018

GATE(Graduate Aptitude Test in Engineering) is one the most important and in-demand entrance exam for engineering graduates in our country. M.Tech. in Computer Science is… Read More »

GATE(Graduate Aptitude in Engineering) is one the most important and in-demand entrance exam for engineering graduates in our country. Geeksforgeeks is here to guide you… Read More »

A lexical analyzer uses the following patterns to recognize three tokens T1, T2, and T3 over the alphabet {a,b,c}. T1: a?(b∣c)*a T2: b?(a∣c)*b T3: c?(b∣a)*c… Read More »

Consider the following four relational schemas. For each schema, all non-trivial functional dependencies are listed, The underlined attributes are the respective primary keys. Schema I:… Read More »

Consider a matrix P whose only eigenvectors are the multiples of . Consider the following statements. (I) P does not have an inverse (II) P… Read More »

Let G be a simple undirected graph. Let TD be a depth first search tree of G. Let TB be a breadth first search tree… Read More »

The instruction pipeline of a RISC processor has the following stages: Instruction Fetch (IF), Instruction Decode (ID), Operand Fetch (OF), Perform Operation (PO) and Writeback… Read More »

Consider the weights and values of items listed below. Note that there is only one unit of each item. The task is to pick a… Read More »

Consider the relations r(A, B) and s(B, C), where s.B is a primary key and r.B is a foreign key referencing s.B. Consider the query… Read More »

Let N be the set of natural numbers. Consider the following sets, P: Set of Rational numbers (positive and negative) Q: Set of functions from… Read More »

The number of possible min-heaps containing each value from {1, 2, 3, 4, 5, 6, 7} exactly once is _______. Note –This was Numerical Type… Read More »

Let G be a graph with 100! vertices, with each vertex labelled by a distinct permutation of the numbers 1, 2, …, 100. There is… Read More »

In a system, there are three types of resources: E, F and G. Four processes P0, P1, P2 and P3 execute concurrently. At the outset,… Read More »

Consider the first-order logic sentence φ ≡ ∃s∃t∃u∀v∀w∀x∀y ψ(s, t, u, v, w, x, y) where ψ(s, t, u, v, w, x, y) is a… Read More »

Consider the unsigned 8-bit fixed point binary number representation, below, b7b6b5b4b3 ⋅ b2b1b0 where the position of the binary point is between b3 and b2… Read More »