GATE 2014 CS (CS1) – Previous Year Questions with Solutions
All 65 questions of GATE 2014 CS (CS1) with answers and explanations. Read each question, then practise it by topic or as a full paper.
Practise this paper in The GATE Grind →
- Question 1 – Which option is closest in meaning to “cope with” in: “It is fascinating to see life forms cope with varied environmental conditions”?
- Question 2 – Choose the most appropriate completion: “He could not understand the judges awarding her the first prize, because he thought that her performance was…
- Question 3 – At a press meet on a recent scam, the minister said, “The buck stops here.” What did he convey?
- Question 4 – If (z+1/z)2=98, compute z2+1/z2.
- Question 5 – The roots of ax2+bx+c=0 are real and positive, with real a, b, c. Then ax2+b x +c=0 has .
- Question 6 – The Palghat (Palakkad) Gap, about 30 km wide in the southern Western Ghats in India, is lower than the hilly terrain to its north and south. The exact…
- Question 7 – Geneticists say they are close to confirming the genetic roots of psychiatric illnesses such as depression and schizophrenia, and consequently doctors…
- Question 8 – Round-trip tourist tickets receive a 10% discount on total fare. Groups of 4 or more receive an additional 5% discount on total fare. One-way fare is…
- Question 9 – 300 respondents reported vehicle ownership. Counts (men, women) are: car only (40,34), scooter only (30,20), both (60,46), no vehicle (20,50). What…
- Question 10 – An interior point of a tetrahedron (a solid with four triangular faces) is connected to its corners by straight lines. How many new internal planes…
- Question 11 – “Not all that glitters is gold.” Predicate glitters(x) means x glitters, and gold(x) means x is gold. Which formula represents this statement?
- Question 12 – A unit-length stick is broken at a point chosen uniformly at random. Find the expected length of the shorter stick.
- Question 13 – Let G = (V,E) be a directed graph. Which graph has the same strongly connected components as G?
- Question 14 – Find the number of solutions of 3x+2y=1, 4x+7z=1, x+y+z=3, x-2y+7z=0.
- Question 15 – Find the dot product of eigenvectors corresponding to any pair of different eigenvalues of a 4 × 4 symmetric positive-definite matrix.
- Question 16 – Let f()=vmatrix&&\\(/6)&(/6)&(/6)\\(/3)&(/3)&(/3)vmatrix for [/6,/3]. Which claims are TRUE? I: Some (/6,/3) has f()=0. II: Some θ in that interval…
- Question 17 – Find the minimal sum-of-products form of F(P,Q,R,S)=PQ+ PQR+ PQ RS.
- Question 18 – Find the base (radix) in which 312/20 = 13.1.
- Question 19 – A 32-bit architecture uses one-word instructions and has 64 registers, each 32 bits. It supports 45 instructions having an immediate operand and two…
- Question 20 – Consider this C program: #include <stdio.h> main() int i; int *pi = &i; scanf("%d", pi); printf("%d", i+5); Which statement is TRUE?
- Question 21 – G has n vertices and m edges and is represented by an adjacency matrix. Find the tightest upper bound on Depth First Search running time.
- Question 22 – A rooted n-node binary tree is represented using pointers. The best upper bound for counting subtrees with exactly four nodes is O(nabn). Find a +…
- Question 23 – For the directed graph shown, which statement is TRUE?
- Question 24 – Quicksort P sorts ascending using the first element as pivot. Let t₁ and t₂ count its comparisons on [1,2,3,4,5] and [4,1,5,3,2] respectively. Which…
- Question 25 – Which one of the following is TRUE?
- Question 26 – For the finite automaton shown, find the set of reachable states after input 0011.
- Question 27 – Which compiler statement is FALSE?
- Question 28 – Match models 1: Waterfall, 2: Evolutionary, 3: Component-based software engineering, 4: Spiral development with a: Specifications developed…
- Question 29 – A disk has cylinders 0–200. The arm is at 100 with queued requests 30,85,90,100,105,110,135,145. With Shortest-Seek-Time-First scheduling, how many…
- Question 30 – Which thread statement is FALSE?
- Question 31 – Relation R=(E,F,G,H,I,J,K,L,M,N) has dependencies EF G, F IJ, EH KL, K M, L N. Find its key.
- Question 32 – S1: A foreign-key declaration can always be replaced by an equivalent SQL CHECK assertion. S2: Given R(a,b,c) with primary key (a,b), the following is…
- Question 33 – For link-state and distance-vector routing in a network of 500 nodes and 4000 links: S1: Link-state has higher computational overhead. S2:…
- Question 34 – Which generate message digests for network-security protocols? P: RSA; Q: SHA-1; R: DES; S: MD5.
- Question 35 – Order browser–server operations: 1: Browser requests webpage using HTTP; 2: Browser establishes TCP connection; 3: Server sends requested webpage…
- Question 36 – A 2 km token ring has 10 stations including a monitor. Signal propagation speed is 2 × 10⁸ m/s; token transmission time is ignored. Each station may…
- Question 37 – A TCP connection has congestion window 32 KB when timeout occurs. RTT is 100 ms and MSS is 2 KB. Find time to recover a 32 KB congestion window (ms).
- Question 38 – Selective-repeat sliding-window frames are 1 KB over a 1.5 Mbps link with one-way latency 50 ms. For link utilization 60%, find minimum…
- Question 39 – Three transactions read and write item x using rᵢ and wᵢ. Which schedule is conflict serializable?
- Question 40 – S1: Every table with two single-valued attributes is in 1NF, 2NF, 3NF and BCNF. S2: AB → C, D → E, E → C is a minimal cover of AB → C, D → E, AB → E,…
- Question 41 – Banker’s algorithm manages resource types X,Y,Z for P₀,P₁,P₂. Current allocation vectors are P₀:(0,0,1), P₁:(3,2,0), P₂:(2,1,1); maximum vectors are…
- Question 42 – Single-CPU processes A,B,C,D,E have (arrival,execution) times in ms: A(0,6), B(3,2), C(5,4), D(7,6), E(10,3). Find average turnaround time under…
- Question 43 – Three page frames are initially empty. For reference string 1,2,3,4,2,1,5,3,2,4,6, find page faults using optimal replacement.
- Question 44 – A canonical item set is S → L · > R and Q → R ·. On input symbol <, the set has .
- Question 45 – Let L be a language and L its complement. Which is NOT a viable possibility?
- Question 46 – Which regular expressions represent the shown DFA? I: 0*1(1+00*1)*; II: 0*1*1+11*0*1; III: (0+1)*1.
- Question 47 – Five bags labelled 1–5 each contain equal-weight coins within the bag; some bags have 10 g coins and others 11 g coins. Taking 1,2,4,8,16 coins…
- Question 48 – A polynomial-time algorithm correctly computing the largest clique of any graph is discovered. Which Venn diagram represents P, NP and NP Complete…
- Question 49 – Find the minimum comparisons needed to find both minimum and maximum of 100 numbers.
- Question 50 – A 9-slot hash table uses h(k) = k mod 9 and chaining. Keys 5,28,19,15,20,33,12,17,10 are inserted in that order. Find maximum, minimum and average…
- Question 51 – Consider this C function, where size is the number of elements in E: int MyX(int *E, unsigned int size) int Y = 0, Z, i, j, k; for (i = 0; i < size;…
- Question 52 – Find the total multiplications in this pseudocode (inclusive loop bounds): D = 2 for i = 1 to n for j = i to n for k = j + 1 to n D = D * 3
- Question 53 – A six-stage instruction pipeline has perfectly balanced stages and no cycle-time overhead. If 25% of instructions incur two pipeline stall cycles,…
- Question 54 – A length-N cache-block access sequence contains n unique addresses. Distinct block addresses between consecutive accesses to the same block are…
- Question 55 – For the 4-to-1 multiplexer shown, with select lines S 1 and S 0, find the minimal sum-of-products form of output F.
- Question 56 – The function f(x)=x x satisfies f(x)+f(x)+t x=0. Find t.
- Question 57 – f is continuous on [0,2], with f(0) = f(2) = −1 and f(1) = 1. Which statement must be true?
- Question 58 – Four fair six-sided dice are rolled. Probability that the sum is 22 equals X/1296. Find X.
- Question 59 – A pennant is an ordered sequence of 1s and 2s; an n-pennant has sum n. For example (1,1,2) is a 4-pennant. The 1-pennants are (1), 2-pennants…
- Question 60 – S is the set of all functions f:\0,1\4\0,1\. If N counts functions from S to 0,1, find 2 2N.
- Question 61 – An undirected graph without self-loops has vertices \(i,j):1 i12,\ 1 j12\. Distinct vertices (a,b) and (c,d) are adjacent when a-c 1 and b-d 1. Find…
- Question 62 – A nonincreasing n-tuple is graphic if a simple undirected n-vertex graph has those degrees. Which tuple is NOT graphic?
- Question 63 – Which propositional formula is TRUE exactly when two of p, q, r are TRUE?
- Question 64 – Schema: employees(emp-id, first-name, last-name, hire-date, dept-id, salary); departments(dept-id, dept-name, manager-id, location-id). To display…
- Question 65 – Processors P₁ and P₂ execute the same instruction set. Under identical conditions and input, P₂ takes 25% less time but incurs 20% more CPI than P₁.…