Previous year paper
GATE CS 2014 Set 2
GATE 2014 Computer Science and Information Technology (CS) Session 2
Take this paper as a mock testGATE CS 2014GATE CS 2014 Set 1GATE CS 2014 Set 3
General Aptitude
10 questions, 15 marks
Q.1 (GA Q.1)
Choose the most appropriate phrase from the options given below to complete the following sentence. India is a post-colonial country because
Verbal Ability and Grammar
Q.2 (GA Q.2)
Who ___________ was coming to see us this evening?
Verbal Ability and Grammar
Q.3 (GA Q.3)
Match the columns. Column 1 | Column 2 ---|--- 1) eradicate | P) misrepresent 2) distort | Q) soak completely 3) saturate | R) use 4) utilize | S) destroy utterly
Verbal Ability and Grammar
Q.4 (GA Q.4)
What is the average of all multiples of 10 from 2 to 198?
Quantitative Aptitude
Q.5 (GA Q.5)
The value of is
Quantitative Aptitude
Q.6 (GA Q.6)
The old city of Koenigsberg, which had a German majority population before World War 2, is now called Kaliningrad. After the events of the war, Kaliningrad is now a Russian terr...
Reading Comprehension and Verbal Deduction
Q.7 (GA Q.7)
The number of people diagnosed with dengue fever (contracted from the bite of a mosquito) in north India is twice the number diagnosed last year. Municipal authorities have conc...
Analytical and Logical Reasoning
Q.8 (GA Q.8)
If is real and , then possible values of include
Quantitative Aptitude
Q.9 (GA Q.9)
The ratio of male to female students in a college for five years is plotted in the following line graph. If the number of female students doubled in 2009, by what percent did th...
Data Interpretation and Graphs
Q.10 (GA Q.10)
At what time between 6 a.m. and 7 a.m. will the minute hand and hour hand of a clock make an angle closest to ?
Analytical and Logical Reasoning
Computer Science and Information Technology
55 questions, 85 marks
Q.11 (CS Q.1)
The security system at an IT office is composed of 10 computers of which exactly four are working. To check whether the system is functional, the officials inspect four of the c...
Probability and Statistics
Q.12 (CS Q.2)
Each of the nine words in the sentence "The quick brown fox jumps over the lazy dog" is written on a separate piece of paper. These nine pieces of paper are kept in a box. One o...
Probability and Statistics
Q.13 (CS Q.3)
The maximum number of edges in a bipartite graph on 12 vertices is _____.
Graph Theory
Q.14 (CS Q.4)
If the matrix is such that then the determinant of is equal to _____.
Linear Algebra
Q.15 (CS Q.5)
A non-zero polynomial of degree 3 has roots at and . Which one of the following must be TRUE?
Calculus
Q.16 (CS Q.6)
The dual of a Boolean function , written as , is the same expression as that of with and swapped. is said to be se...
Boolean Algebra and Logic Minimization
Q.17 (CS Q.7)
Let . A circuit is built by giving the output of an -bit binary counter as input to an -to- bit decoder. This circuit is equivalent to a
Sequential Circuits, Counters and Registers
Q.18 (CS Q.8)
Consider the equation with and as unknown. The number of possible solutions is _____.
Number Representations and Computer Arithmetic
Q.19 (CS Q.9)
A 4-way set-associative cache memory unit with a capacity of 16 KB is built using a block size of 8 words. The word length is 32 bits. The size of the physical address space is...
Memory Hierarchy: Cache, Main Memory and Secondary Storage
Q.20 (CS Q.10)
Consider the function func shown below: int func(int num) { int count = 0; while (num) { count++; num >>= 1; } return (count); } The value returned by func(435) is _____.
Data Types, Operators and Control Flow
Q.21 (CS Q.11)
Suppose n and p are unsigned int variables in a C program. We wish to set p to nC3. If n is large, which one of the following statements is most likely to set p correctly?
Data Types, Operators and Control Flow
Q.22 (CS Q.12)
A priority queue is implemented as a Max-Heap. Initially, it has 5 elements. The level-order traversal of the heap is: 10, 8, 5, 3, 2. Two new elements 1 and 7 are inserted into...
Binary Heaps and Priority Queues
Q.23 (CS Q.13)
Which one of the following correctly determines the solution of the recurrence relation with ?
Asymptotic Analysis and Time/Space Complexity
Q.24 (CS Q.14)
Consider the tree arcs of a BFS traversal from a source node in an unweighted, connected, undirected graph. The tree formed by the tree arcs is a data structure for comp...
Graph Traversals, Topological Sort and Connectivity
Q.25 (CS Q.15)
If and , consider (I) is a regular language (II) Which one of...
Regular Expressions, Finite Automata and Regular Languages
Q.26 (CS Q.16)
Let denotes that language is mapping reducible (also known as many-to-one reducible) to language . Which one of the following is FALSE?
Decidability, Reducibility and Undecidability
Q.27 (CS Q.17)
Consider the grammar defined by the following production rules, with two operators and …
Parsing and Syntax Analysis (LL and LR)
Q.28 (CS Q.18)
Which one of the following is NOT performed during compilation?
Runtime Environments and Parameter Passing
Q.29 (CS Q.19)
Which one of the following is TRUE?
Functions, Recursion, Scope and Storage Classes
Q.30 (CS Q.20)
A FAT (file allocation table) based file system is being used and the total overhead of each entry in the FAT is 4 bytes in size. Given a bytes disk on which t...
File Systems, I/O and Disk Scheduling
Q.31 (CS Q.21)
The maximum number of superkeys for the relation schema with as the key is _____.
Functional Dependencies and Normalization
Q.32 (CS Q.22)
Given an instance of the STUDENTS relation as shown below: | StudentID | StudentName | StudentEmail | StudentAge | CPI | | :--- | :--- | :--- | :--- | :--- | | 2345 | Shankar |...
ER Model and Relational Schema Design
Q.33 (CS Q.23)
Which one of the following is TRUE about the interior gateway routing protocols - Routing Information Protocol (RIP) and Open Shortest Path First (OSPF)?
Routing Algorithms (Distance Vector, Link State) and BGP/OSPF
Q.34 (CS Q.24)
Which one of the following socket API functions converts an unconnected active TCP socket into a passive socket?
Transport Layer: UDP, TCP Flow and Congestion Control, Sockets
Q.35 (CS Q.25)
In the diagram shown below, L1 is an Ethernet LAN and L2 is a Token-Ring LAN. An IP packet originates from sender S and traverses to R, as shown. The links within each ISP and a...
IPv4/IPv6 Addressing, Subnetting, CIDR, ARP, ICMP and NAT
Q.36 (CS Q.26)
Consider the store and forward packet switched network given below. Assume that the bandwidth of each link is bytes / sec. A user on host A sends a file of size by...
Data Link Layer: Framing, Error Detection and Sliding Window
Q.37 (CS Q.27)
An IP machine Q has a path to another IP machine H via three IP routers R1, R2, and R3. H acts as an HTTP server, and Q conne...
OSI/TCP-IP Layering, Physical Layer and Switching
Q.38 (CS Q.28)
A graphical HTML browser resident at a network client machine Q accesses a static HTML webpage from a HTTP server S. The static HTML page has exactly one static embedded image w...
Application Layer: DNS, HTTP, SMTP, FTP
Q.39 (CS Q.29)
Consider the following schedule S of transactions T1, T2, T3, T4: | T1 | T2 | T3 | T4 | | :--- | :--- | :--- | :--- | | | Reads(X) | | | | | | Writes(X) / Commit | | | Write...
Transactions, Serializability and Concurrency Control
Q.40 (CS Q.30)
Consider a join (relational algebra) between relations and using the nested loop method. There are 3 buffers each of size equal to disk block size, out of which on...
File Organization, B-Trees and B+ Trees Indexing
Q.41 (CS Q.31)
Consider the procedure below for the Producer-Consumer problem which uses semaphores: semaphore n = 0; semaphore s = 1; void producer() { while(true) { produce(); semWait(s...
Process Synchronization and Concurrency
Q.42 (CS Q.32)
Three processes A, B and C each execute a loop of 100 iterations. In each iteration of the loop, a process performs a single computation that requires CPU milliseconds and...
CPU Scheduling
Q.43 (CS Q.33)
A computer has twenty physical page frames which contain pages numbered 101 through 120. Now a program accesses the pages numbered 1, 2, ..., 100 in that order, and repeats the...
Memory Management and Virtual Memory
Q.44 (CS Q.34)
For a C program accessing
X[i][j][k], the following intermediate code is generated by a compiler. Assume that the size of an integer is 32 bits and the size of a character is...Intermediate Code Generation, Data Flow Analysis and Code Optimization
Q.45 (CS Q.35)
Let be the encoding of a Turing machine as a string over . Let…
Decidability, Reducibility and Undecidability
Q.46 (CS Q.36)
Let . Let…
Regular Expressions, Finite Automata and Regular Languages
Q.47 (CS Q.37)
Consider two strings and . Let be the length of the longest common subsequence (not necessarily contiguous) between and an...
Dynamic Programming
Q.48 (CS Q.38)
Suppose P, Q, R, S, T are sorted sequences having lengths 20, 24, 30, 35, 50 respectively. They are to be merged into a single sequence by merging together two sequences at a ti...
Greedy Algorithms
Q.49 (CS Q.39)
Consider the expression tree shown. Each leaf represents a numerical value, which can either be 0 or 1. Over all possible choices of the values at the leaves, the maximum possib...
Binary Trees, Binary Search Trees and Balanced Trees
Q.50 (CS Q.40)
Consider the following function: double f(double x){ if( abs(x*x - 3) < 0.01) return x; else return f(x/2 + 1.5/x); } Give a value (to 2 decimals) such that ...
Functions, Recursion, Scope and Storage Classes
Q.51 (CS Q.41)
Suppose a stack implementation supports an instruction REVERSE, which reverses the order of elements on the stack, in addition to the PUSH and POP instructions. Which one of the...
Stacks and Queues
Q.52 (CS Q.42)
Consider the C function given below: int f(int j) { static int i = 50; int k; if (i == j) { printf("something"); k = f(i); return 0; } else return 0; } Which one of the...
Functions, Recursion, Scope and Storage Classes
Q.53 (CS Q.43)
In designing a computer's cache system, the cache block (or cache line) size is an important parameter. Which one of the following statements is correct in this context?
Memory Hierarchy: Cache, Main Memory and Secondary Storage
Q.54 (CS Q.44)
If the associativity of a processor cache is doubled while keeping the capacity and block size unchanged, which one of the following is guaranteed to be NOT affected?
Memory Hierarchy: Cache, Main Memory and Secondary Storage
Q.55 (CS Q.45)
The value of a float type variable is represented using the single-precision 32-bit floating point format of IEEE-754 standard that uses 1 bit for sign, 8 bits for biased expone...
Number Representations and Computer Arithmetic
Q.56 (CS Q.46)
In the Newton-Raphson method, an initial guess of is made and the sequence is obtained for the function Consider...
Calculus
Q.57 (CS Q.47)
The product of the non-zero eigenvalues of the matrix…
Linear Algebra
Q.58 (CS Q.48)
The probability that a given positive integer lying between 1 and 100 (both inclusive) is NOT divisible by 2, 3 or 5 is _____.
Probability and Statistics
Q.59 (CS Q.49)
The number of distinct positive integral factors of 2014 is _____.
Combinatorics, Counting, Recurrence Relations and Generating Functions
Q.60 (CS Q.50)
Consider the following relation on subsets of the set of integers between 1 and 2014. For two distinct subsets and of we say if the minimum element in th...
Sets, Relations, Functions, Partial Orders and Lattices
Q.61 (CS Q.51)
A cycle on vertices is isomorphic to its complement. The value of is _____.
Graph Theory
Q.62 (CS Q.52)
The number of distinct minimum spanning trees for the weighted graph below is _____. Weighted undirected planar graph with edge weights 1 and 2 for MST enumeration Weighted grap...
Minimum Spanning Trees
Q.63 (CS Q.53)
Which one of the following Boolean expressions is NOT a tautology?
Propositional and First-Order Logic
Q.64 (CS Q.54)
SQL allows duplicate tuples in relations, and correspondingly defines the multiplicity of tuples in the result of joins. Which one of the following queries always gives the same...
SQL Queries and Integrity Constraints
Q.65 (CS Q.55)
Consider a main memory system that consists of 8 memory modules attached to the system bus, which is one word wide. When a write request is made, the bus is occupied for 100 nan...
I/O Interface, Interrupts and DMA