GATE 2015 CS (CS2) – Previous Year Questions with Solutions
All 65 questions of GATE 2015 CS (CS2) 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 – Fill both blanks: We our friend’s birthday and we how to make it up to him.
- Question 2 – Choose the sentence using personnel correctly.
- Question 3 – A generic term including clothing such as skirts, trousers and shirts is
- Question 4 – What is the total weight of ten identical poles? I: One fourth of one pole weighs 5 kg. II: Ten poles weigh 160 kg more than two poles. Choose the…
- Question 5 – For f(x)=1− x on −1≤x≤1, give the maximizing x and maximum value, respectively.
- Question 6 – Choose the sentence with the most suitable grammar and usage.
- Question 7 – In triangle PQR, PQ=r, PR=q and QR=p. PS bisects ∠QPR, S lies on QR, and ∠QPS=60°. Find PS.
- Question 8 – For distinct integers p,q,r,s, f(p,q,r,s)=max(p,q,r,s), g(p,q,r,s)=min(p,q,r,s), and h(p,q,r,s) is the remainder when the larger of pq and rs is…
- Question 9 – P,R,S,T,U form an arithmetic progression. Which lists must also be arithmetic progressions? I: 2P,2R,2S,2T,2U II: P−3,R−3,S−3,T−3,U−3 III:…
- Question 10 – Company branches are at M,N,O,P. M is 4 km north of N; P is 2 km south of O; N is 1 km southeast of O. Find the straight-line distance MP in km.
- Question 11 – S1: If a candidate is known to be corrupt, he will not be elected. S2: If a candidate is kind, he will be elected. Which follows logically?
- Question 12 – Find the cardinality of the power set of 0,1,2,…,10.
- Question 13 – On positive integers, aRb iff a≠b and a,b have a common divisor greater than one. Which describes R?
- Question 14 – How many positive divisors does 2100 have?
- Question 15 – Find the larger eigenvalue of pmatrix4&5\\2&1pmatrix.
- Question 16 – An unordered list contains n distinct elements. How many comparisons are needed to find any element that is neither its maximum nor minimum? Assume…
- Question 17 – Find the minimum number of JK flip-flops for a synchronous counter with output sequence 0,0,1,1,2,2,3,3,0,0,… .
- Question 18 – A read takes 50 ns on a cache miss and 5 ns on a hit. Eighty percent of read requests hit. Find the average read time in ns.
- Question 19 – A computer has 40-bit virtual addresses, 8 KB pages, and a 128-entry TLB arranged as 32 sets with four ways each. The TLB stores no process ID. Find…
- Question 20 – Which statements are true? I: The complement of every Turing-decidable language is Turing-decidable. II: Some language in NP is not Turing-decidable.…
- Question 21 – What does foo("ABCD EFGH") print?
- Question 22 – A complete binary tree has max-heaps as the left and right subtrees of its root. Which lower bound describes operations to convert the whole tree to a…
- Question 23 – A binary tree T has 20 leaves. How many nodes have exactly two children?
- Question 24 – Find fun(5).
- Question 25 – Which should a software requirements specification avoid discussing?
- Question 26 – Decision problem Q1 reduces in polynomial time to 3-SAT, and 3-SAT reduces in polynomial time to Q2. Which conclusion is consistent with these…
- Question 27 – Match P: lexical analysis; Q: parsing; R: register allocation; S: expression evaluation. Techniques: 1 graph colouring; 2 DFA minimization; 3…
- Question 28 – Which statement about abstract syntax trees (ASTs) and control-flow graphs (CFGs) is true?
- Question 29 – In basic COCOMO, E is person-month effort, D chronological development months, KLOC thousands of delivered lines, and a b,b b,c b,d b are model…
- Question 30 – Six identical resources are shared by N competing processes. Each process can request at most 2 resources. Which N could lead to deadlock?
- Question 31 – A transaction transfers money between accounts x,y: The requirement that x+y remain constant is a constraint of which transaction property?
- Question 32 – For the B+ tree of order 1 shown, find the minimum number of index nodes, including the root, fetched to retrieve all records with search key ≥7 and…
- Question 33 – In which order does a UNIX socket server invoke accept, bind, listen and recv?
- Question 34 – A link transmits at 106 bits/s using 1000-byte data packets. ACK transmission and node processing delays are negligible; ACK propagation equals data…
- Question 35 – Which statement about HTTP cookies is NOT correct?
- Question 36 – An IP router has these routes: Network Mask Next hop --- --- --- 128.96.170.0 255.255.254.0 Interface 0 128.96.168.0 255.255.254.0 Interface 1…
- Question 37 – Host A sends 8880 bytes of user data by UDP over Ethernet with MTU 1500 bytes. UDP header is 8 bytes and IP header 20 bytes with no options. Find the…
- Question 38 – A TCP connection has bandwidth 1048560 bits/s. Let α be the RTT in milliseconds, rounded to the nearest integer, beyond which window scaling is…
- Question 39 – A simple-checkpoint recovery log contains: A crash occurs now. Choose the undo and redo lists.
- Question 40 – R1(A,B)=(1,5),(3,7) and R2(A,C)=(1,7),(4,9). Let R be their full natural outer join. Candidate tuples are a=(1,5,NULL), b=(1,NULL,7), c=(3,NULL,9),…
- Question 41 – Six fixed memory partitions have sizes 200,400,600,500,300,250 KB. Processes of 357,210,468,491 KB arrive in that order. Under best fit, which…
- Question 42 – A disk rotates at 15000 RPM and transfers 50106 bytes/s. Average seek time is twice average rotational delay. Controller transfer time is ten times…
- Question 43 – A system has 8 KB pages and 32-bit physical addresses. Every page-table entry contains valid, dirty, three permission bits, and a translation. Maximum…
- Question 44 – Find the numbers of basic-block nodes and edges in the control-flow graph for:
- Question 45 – Find the number of states in the minimal DFA for (0+1)*(10).
- Question 46 – Which languages are regular? L 1=\wxwR:w,x\a,b\*,\ w , x >0\; L 2=\anbm:m n,\ m,n0\; L 3=\apbqcr:p,q,r0\.
- Question 47 – Match algorithms 1 Dijkstra shortest path, 2 Floyd–Warshall all-pairs shortest paths, 3 binary search, 4 backtracking graph search, with paradigms i…
- Question 48 – A Young tableau has unique finite entries increasing along rows and columns; empty cells are ∞, with no finite entry to the right of or below an empty…
- Question 49 – partition(a,n) uses a[0] as pivot, moves values ≤pivot left and greater values right, and places the pivot last in the left part. Complete the…
- Question 50 – Which integer hash function distributes keys i=0,…,2020 most uniformly over buckets 0,…,9?
- Question 51 – The secant method starts with distinct estimates x a,x b and repeatedly sets x t=?, then x a=x b, x b=x t, and f b=f(x b), stopping at small residual…
- Question 52 – What does this C program print?
- Question 53 – A four-stage pipeline has IF (fetch/decode), OF (operand fetch), PO (perform operation), WB (writeback). IF,OF,WB take one cycle; PO takes one for…
- Question 54 – Memory is byte-addressable; PC, PSW and other registers are 2 bytes. An upward-growing stack starts at hexadecimal 0100 and SP points to its top…
- Question 55 – How many minterms remain after minimizing [D+AB+A C+AC D+A C D]?
- Question 56 – Let f(x)=x-1/3 and let A be the area between its graph and the x-axis from −1 to 1. Which are true? I: f is continuous on [−1,1]. II: f is unbounded…
- Question 57 – For M=pmatrix3&4&45\\7&9&105\\13&2&195pmatrix, add the third row to the second, then subtract the third column from the first. Find the resulting…
- Question 58 – How many onto functions map X=1,2,3,4 to Y=a,b,c?
- Question 59 – X and Y contain 2 and 20 distinct objects respectively. Choose uniformly from all functions X→Y. What is the probability that the function is…
- Question 60 – Over 0,1, λ denotes the empty string. A regular grammar satisfies X0=1X1, X1=0X1+1X2, X2=0X1+λ. Which expression denotes X0?
- Question 61 – A self-complementary graph is isomorphic to its complement. What must its vertex count n satisfy?
- Question 62 – A bridge is an edge whose removal disconnects a connected graph. Which is true?
- Question 63 – Which first-order formula is logically valid?
- Question 64 – Which assertion about code inspection and code walkthrough is true?
- Question 65 – A half adder uses XOR and AND gates. A full adder uses two half adders and one OR gate. XOR delay is twice AND/OR delay; AND and OR each take 1.2 μs.…