GATE 2015 CS (CS1) – Previous Year Questions with Solutions
All 65 questions of GATE 2015 CS (CS1) with answers and explanations. Read each question, then practise it by topic or as a full paper.
65 questions worth 100 marks in all (30 1-mark, 35 2-mark). Subjects covered: Engineering Mathematics (11), General Aptitude (10), Programming and Data Structures (9), Computer Networks (7), Algorithms (6), Operating System (6), Digital Logic (4), Databases (4).
Practise this paper in The GATE Grind →
- Question 1 – Didn't you buy when you went shopping?
- Question 2 – Which of the following options is the closest in meaning to the sentence below? She enjoyed herself immensely at the party.
- Question 3 – Which one of the following combinations is incorrect?
- Question 4 – Based on the given statements, select the most appropriate option to solve the given question. If two floors in a certain building are 9 feet apart,…
- Question 5 – Given Set A = \2, 3, 4, 5\ and Set B = \11, 12, 13, 14, 15\, two numbers are randomly selected, one from each set. What is the probability that the…
- Question 6 – Select the alternative meaning of the underlined part of the sentence. The chain snatchers took to their heels when the police party arrived.
- Question 7 – The given statement is followed by some courses of action. Assuming the statement to be true, decide the correct option. Statement: There has been a…
- Question 8 – The pie chart below has the breakup of the number of students from different departments in an engineering college for the year 2012. The proportion…
- Question 9 – The probabilities that a student passes in Mathematics, Physics and Chemistry are m, p, and c respectively. Of these subjects, the student has 75%…
- Question 10 – The number of students in a class who have answered correctly, wrongly, or not attempted each question in an exam, are listed in the table below. The…
- Question 11 – If g(x) = 1 - x and h(x) = xx-1, then g(h(x))h(g(x)) is:
- Question 12 – x x1/x is
- Question 13 – Match the following: (P) Prim's algorithm for minimum spanning tree (Q) Floyd-Warshall algorithm for all pairs shortest paths (R) Mergesort (S)…
- Question 14 – Which one of the following is the recurrence equation for the worst case time complexity of the Quicksort algorithm for sorting n ( 2) numbers? In the…
- Question 15 – The height of a tree is the length of the longest root-to-leaf path in it. The maximum and minimum number of nodes in a binary tree of height 5 are
- Question 16 – Match the following: (P) Condition coverage (Q) Equivalence class partitioning (R) Volume testing (S) Alpha testing (i) Black-box testing (ii) System…
- Question 17 – Which of the following is/are correct inorder traversal sequence(s) of binary search tree(s)? I. 3, 5, 7, 8, 15, 19, 25 II. 5, 8, 9, 12, 10, 15, 25…
- Question 18 – Which one of the following is TRUE at any valid state in shift-reduce parsing?
- Question 19 – Which one of the following is NOT equivalent to p q?
- Question 20 – For a set A, the power set of A is denoted by 2A. If A = \5, \6\, \7\\, which of the following options are TRUE? I. 2A II. 2A III. \5, \6\\ 2A IV. \5,…
- Question 21 – Consider a 4-bit Johnson counter with an initial value of 0000. The counting sequence of this counter is
- Question 22 – For computers based on three-address instruction formats, each address field can be used to specify which of the following: (S1) A memory operand (S2)…
- Question 23 – Suppose two hosts use a TCP connection to transfer a large file. Which of the following statements is/are FALSE with respect to the TCP connection? I.…
- Question 24 – Suppose that everyone in a group of N people wants to communicate secretly with the N-1 others using symmetric key cryptographic system. The…
- Question 25 – Which of the following statements is/are FALSE? I. XML overcomes the limitations in HTML to support a structured way of organizing content. II. XML…
- Question 26 – Which one of the following fields of an IP header is NOT modified by a typical IP router?
- Question 27 – In one of the pairs of protocols given below, both the protocols can use multiple TCP connections between the same client and the server. Which one is…
- Question 28 – For any two languages L 1 and L 2 such that L 1 is context-free and L 2 is recursively enumerable but not recursive, which of the following is/are…
- Question 29 – Consider a system with byte-addressable memory, 32-bit logical addresses, 4 kilobyte page size and page table entries of 4 bytes each. The size of the…
- Question 30 – The following two functions `P1` and `P2` that share a variable `B` with an initial value of 2 execute concurrently. The number of distinct values…
- Question 31 – SELECT operation in SQL is equivalent to
- Question 32 – A file is organized so that the ordering of data records is the same as or close to the ordering of data entries in some index. Then that index is…
- Question 33 – In the LU decomposition of the matrix bmatrix 2 & 2 \\ 4 & 9 bmatrix, if the diagonal elements of U are both 1, then the lower diagonal entry l 22 of…
- Question 34 – The output of the following C program is .
- Question 35 – What are the worst-case complexities of insertion and deletion of a key in a binary search tree?
- Question 36 – Suppose that the stop-and-wait protocol is used on a link with a bit rate of 64 kilobits per second and 20 milliseconds propagation delay. Assume that…
- Question 37 – Consider a max heap, represented by the array: 40, 30, 20, 10, 15, 16, 17, 8, 4. Array Index 1 2 3 4 5 6 7 8 9 --- --- --- --- --- --- --- --- --- ---…
- Question 38 – Consider the following C program segment. The cyclomatic complexity of the program segment is .
- Question 39 – Consider a LAN with four nodes S 1, S 2, S 3 and S 4. Time is divided into fixed-size slots, and a node can begin its transmission only at the…
- Question 40 – The binary operator is defined by the following truth table. p q p q --- --- --- 0 0 0 0 1 1 1 0 1 1 1 0 Which one of the following is true about the…
- Question 41 – x=199 1x(x+1) = .
- Question 42 – Suppose L = \p, q, r, s, t\ is a lattice represented by the following Hasse diagram: [Hasse diagram: p is the bottom, t is the top, and q, r, s are…
- Question 43 – Consider the operations f(X, Y, Z) = X'YZ + XY' + Y'Z' and g(X, Y, Z) = X'YZ + X'YZ' + XY. Which one of the following is correct?
- Question 44 – Let G be a connected planar graph with 10 vertices. If the number of edges on each face is three, then the number of edges in G is .
- Question 45 – Let a n represent the number of bit strings of length n containing two consecutive 1s. What is the recurrence relation for a n?
- Question 46 – A variable x is said to be live at a statement S i in a program if the following three conditions hold simultaneously: i. There exists a statement S j…
- Question 47 – The least number of temporary variables required to create a three-address code in static single assignment form for the expression q + r/3 + s - t *…
- Question 48 – Consider an Entity-Relationship (ER) model in which entity sets E 1 and E 2 are connected by an m : n relationship R 12. E 1 and E 3 are connected by…
- Question 49 – [Two DFAs, each with two states. DFA M: the start state loops on b, reads a to move to the final state, the final state loops on a and reads b to…
- Question 50 – Consider the NPDA Q = \q 0, q 1, q 2\, = \0, 1\, = \0, 1, \, , q 0, , F = \q 2\ , where (as per usual convention) Q is the set of states, is the input…
- Question 51 – Let G = (V, E) be a simple undirected graph, and s be a particular vertex in it called the source. For x V, let d(x) denote the shortest distance in G…
- Question 52 – Consider a uniprocessor system executing three tasks T 1, T 2 and T 3, each of which is composed of an infinite sequence of jobs (or instances) which…
- Question 53 – A positive edge-triggered D flip-flop is connected to a positive edge-triggered JK flip-flop as follows. The Q output of the D flip-flop is connected…
- Question 54 – Consider a disk pack with a seek time of 4 milliseconds and rotational speed of 10000 rotations per minute (RPM). It has 600 sectors per track and…
- Question 55 – Consider a non-pipelined processor with a clock rate of 2.5 gigahertz and average cycles per instruction of four. The same processor is upgraded to a…
- Question 56 – Suppose the following disk request sequence (track numbers) for a disk with 100 tracks is given: 45, 20, 90, 10, 50, 60, 80, 25, 70. Assume that the…
- Question 57 – Consider a main memory with five page frames and the following sequence of page references: 3, 8, 2, 3, 9, 1, 6, 3, 8, 9, 3, 6, 2, 1, 3. Which one of…
- Question 58 – 1/2/ (1/x)x2 \, dx = .
- Question 59 – Consider the following 2 2 matrix A where two elements are unknown and are marked by a and b. The eigenvalues of this matrix are -1 and 7. What are…
- Question 60 – An algorithm performs ( N)1/2 find operations, N insert operations, ( N)1/2 delete operations, and ( N)1/2 decrease-key operations on a set of data…
- Question 61 – Consider the following relations: Student Roll No Student Name --- --- 1 Raj 2 Rohit 3 Raj Performance Roll No Course Marks --- --- --- 1 Math 80 1…
- Question 62 – What is the output of the following C code? Assume that the address of x is 2000 (in decimal) and an integer requires four bytes of memory.
- Question 63 – The graph shown below has 8 edges with distinct integer edge weights. The minimum spanning tree (MST) is of weight 36 and contains the edges: \(A, C),…
- Question 64 – Consider the following C function. Which one of the following most closely approximates the return value of the function `fun1`?
- Question 65 – Consider the following pseudo code, where x and y are positive integers. The post condition that needs to be satisfied after the program terminates is