GATE CS 2019 (Forenoon)
65 questions · 100 marks · 180 minutes
GENERAL APTITUDE (GA)
- Q1The expenditure on the project as follows; equipments Rs. 20 lakhs, salaries Rs. 12 lakhs, and contingency Rs.3 lakhs.Verbal Aptitude · Basic Vocabulary (Words, Idioms, Phrases in Context) · MCQ · 1 mark
- Q2The search engine’s business model around the fulcrum of trust.Verbal Aptitude · Basic Vocabulary (Words, Idioms, Phrases in Context) · MCQ · 1 mark
- Q3Two cars start at the same time from the same location and go in the same direction. The speed of the first car is 50 km/h and the speed of the second car is 60 km/h. The number o…Analytical Aptitude · Numerical Relations & Arithmetic Logic · MCQ · 1 mark
- Q4Ten friends planned to share equally the cost of buying a gift for their teacher. When two of them decided not to contribute, each of the other friends had to pay Rs. 150 more. Th…Analytical Aptitude · Numerical Relations & Arithmetic Logic · MCQ · 1 mark
- Q5A court is to a judge as is to a teacher.Analytical Aptitude · Analogy and Relationship Matching · MCQ · 1 mark
- Q6The police arrested four criminals – P, Q, R and S. The criminals knew each other. They made the following statements: P says “Q committed the crime.” Q says “S committed the crim…Analytical Aptitude · Logic Deduction and Induction Frameworks · MCQ · 2 marks
- Q7In the given diagram, teachers are represented in the triangle, researchers in the circle and administrators in the rectangle. Out of the total number of the people, the percentag…Analytical Aptitude · Logic Deduction and Induction Frameworks · MCQ · 2 marks
- Q8“A recent High Court judgement has sought to dispel the idea of begging as a disease — which leads to its stigmatization and criminalization — and to regard it as a symptom. The u…Verbal Aptitude · Reading Comprehension · MCQ · 2 marks
- Q9In a college, there are three student clubs. Sixty students are only in the Drama club. 80 students are only in the Dance club, 30 students are only in the Maths club. 40 students…Analytical Aptitude · Logic Deduction and Induction Frameworks · MCQ · 2 marks
- Q10Three of the five students allocated to a hostel put in special requests to the warden. Given the floor plan of the vacant rooms, select the allocation plan that will accommodate…Analytical Aptitude · Operational Puzzles and Systemic Reasoning · MCQ · 2 marks
CORE CS
- Q11A certain processor uses a fully associative cache of size 16 kB. The cache block size is 16 bytes. Assume that the main memory is byte addressable and uses a 32-bit address. How…Computer Organization and Architecture (COA) · Memory Hierarchy (Direct/Associative Cache Mapping) · MCQ · 1 mark
- Q12The chip selects logic for a certain DRAM chip in memory system design is shown below. Assume that memory has 16 address lines denoted by A 15 to A 0 . What is the range of addres…Digital Logic · Combinational Logic (Multiplexers, Decoders, Adders) · MCQ · 1 mark
- Q13Which one of the following kinds of derivation is used by LR parsers?Compiler Design · Lexical Analysis & Parsing Architectures (LL(1), LR(1), LALR) · MCQ · 1 mark
- Q14In 16-bit 2’s complement representation, the decimal number –28 is:Digital Logic · Number Representations & Fixed/Floating Point Math · MCQ · 1 mark
- Q16Which one of the following is NOT a valid identity?Digital Logic · Boolean Algebra, Minimization, K-Maps · MCQ · 1 mark
- Q17If L is a regular language over = \ a, b\ , which one of the following languages is NOT regular?Theory of Computation (TOC) · Regular and Context-Free Languages & Pumping Lemma · MCQ · 1 mark
- Q18Consider Z = X – Y, where X, Y and Z are all in sign-magnitude form. X and Y are each represented in n bits. To avoid overflow, the representation of Z would require a minimum of:Digital Logic · Number Representations & Fixed/Floating Point Math · MCQ · 1 mark
- Q21Consider the following two statements about database transaction schedules: I. Strict two-phase locking protocol generates conflict serializable schedules that are also recoverabl…Database Management Systems (DBMS) · Transactions, Concurrency Control, Conflict Serializability · MCQ · 1 mark
- Q24Which one of the following statements is NOT correct about the B+ tree data structure used for creating an index of a relational database table?Database Management Systems (DBMS) · File Organization & Indexing (e.g., B and B+ Trees) · MCQ · 1 mark
- Q25For = \ a, b\ , let us consider the regular language L = \ x x = a 2+3k or x = b 10+12k , k 0\ . Which one of the following can be a pumping length (the constant guaranteed by the…Theory of Computation (TOC) · Regular and Context-Free Languages & Pumping Lemma · MCQ · 1 mark
- Q26Which of the following protocol pairs can be used to send and retrieve e-mails (in that order)?Computer Networks (CN) · Application Layer (DNS, SMTP, HTTP, FTP, Email) & Security · MCQ · 1 mark
- Q27Consider the following C program is executed on a Unix/Linux system: c include<unistd.h> int main( ) int i; for (i = 0; i < 10; i++) if (i % 2 == 0) fork( ); return 0; The total n…Operating Systems (OS) · System Calls, Processes, Threads, InterProcess Communication · NAT · 1 mark
- Q28Consider the following C program: c include <stdio.h> int jumble(int x, int y) x = 2 x + y; return x; int main ( ) int x = 2, y = 5; y = jumble(y, x); x = jumble(y, x); printf("%d…Programming in C · Functions, Parameter Passing, Scope Rules, Recursion · NAT · 1 mark
- Q29Consider the grammar given below: S Aa A BD B b D d Let a, b, d and be indexed as follows: Compute the FOLLOW set of the non-terminal B and write the index values for the symbols…Compiler Design · Lexical Analysis & Parsing Architectures (LL(1), LR(1), LALR) · NAT · 1 mark
- Q30An array of 25 distinct elements is to be sorted using quicksort. Assume that the pivot element is chosen uniformly at random. The probability that the pivot element gets placed i…Algorithms · Searching, Sorting, Hashing Mechanisms · NAT · 1 mark
- Q33Consider three concurrent processes P1, P2 and P3 as shown below, which access a shared variable D that has been initialized to 100. The processes are executed on a uniprocessor s…Operating Systems (OS) · Concurrency & Synchronization (Semaphores, Mutex, Monitors, Locks) · NAT · 1 mark
- Q34Consider the following C program: c include <stdio.h> int main ( ) int arr[ ] = 1, 2, 3, 4, 5, 6, 7, 8, 9, 0, 1, 2, 5 , ip = arr + 4; printf ("%d ", ip[1]); return 0; The number t…Programming in C · Pointers, Multi-Dimensional Arrays, Structures · NAT · 1 mark
- Q35Consider a sequence of 14 elements: A = [–5, –10, 6, 3, –1, –2, 13, 4, –9, –1, 4, 12, –3, 0]. The subsequence sum S(i, j) = k=i j A[k] . Determine the maximum of S(i, j) , where 0…Algorithms · Divide-and-Conquer Designs · NAT · 1 mark
- Q36Consider the following C function: c void convert (int n) if (n < 0) printf("%d", n); else convert (n/2); printf("%d", n % 2); Which one of the following will happen when the func…Programming in C · Functions, Parameter Passing, Scope Rules, Recursion · MCQ · 2 marks
- Q37Consider the following C program: c include<stdio.h> int r( ) static int num = 7; return num--; int main( ) for ( r( ); r( ); r( ) ) printf("%d", r( ) ); return 0; Which one of th…Programming in C · Functions, Parameter Passing, Scope Rules, Recursion · MCQ · 2 marks
- Q38Consider three machines M, N and P with IP addresses 100.10.5.2, 100.10.5.5 and 100.10.5.6 respectively. The subnet mask is set to 255.255.255.252 for all the three machines. Whic…Computer Networks (CN) · Fragmentation and IP Addressing (IPv4, IPv6, CIDR, Basics of IP support Protocols (ARP, DHCP, ICMP), NAT) · MCQ · 2 marks
- Q39Suppose that in an IP-over-Ethernet network, a machine X wishes to find the MAC address of another machine Y in its subnet. Which one of the following techniques can be used for t…Computer Networks (CN) · Fragmentation and IP Addressing (IPv4, IPv6, CIDR, Basics of IP support Protocols (ARP, DHCP, ICMP), NAT) · MCQ · 2 marks
- Q40Consider three 4-variable functions f 1 , f 2 and f 3 , which are expressed in sum-of-minterms as f 1 = (0, 2, 5, 8, 14) f 2 = (2, 3, 6, 8, 14, 15) f 3 = (2, 7, 11, 14) For the fo…Digital Logic · Combinational Logic (Multiplexers, Decoders, Adders) · MCQ · 2 marks
- Q41Which one of the following languages over = \ a, b\ is NOT context-free?Theory of Computation (TOC) · Regular and Context-Free Languages & Pumping Lemma · MCQ · 2 marks
- Q42Let the set of functional dependencies F = \ QR S, R P, S Q\ hold on a relation schema X = (PQRS) . X is not in BCNF. Suppose X is decomposed into two schemas Y and Z where Y = (P…Database Management Systems (DBMS) · Normalization Schemes (1NF, 2NF, 3NF, BCNF Boundaries) · MCQ · 2 marks
- Q43Assume that in a certain computer, the virtual addresses are 64 bits long and the physical addresses are 48 bits long. The memory is word addressable. The page size is 8 kB and th…Operating Systems (OS) · Memory Management and Virtual Memory · MCQ · 2 marks
- Q44Consider the following sets: S 1 : Set of all recursively enumerable languages over the alphabet \ 0, 1\ . S 2 : Set of all syntactically valid C programs. S 3 : Set of all langua…Theory of Computation (TOC) · Turing Machines & Undecidability · MCQ · 2 marks
- Q46Consider the following grammar and the semantic actions to support the inherited type declaration attributes. Let X 1, X 2, X 3, X 4, X 5 and X 6 be the place holders for the non-…Compiler Design · Syntax-Directed Translation & Runtime Environments · MCQ · 2 marks
- Q47There are n unsorted arrays: A 1, A 2, ...., A n . Assume that n is odd. Each of A 1, A 2, ...., A n contains n distinct elements. There are no common elements between any two arr…Algorithms · Searching, Sorting, Hashing Mechanisms · MCQ · 2 marks
- Q48Let G be any connected, weighted, undirected graph: I. G has a unique minimum spanning tree, if no two edges of G have the same weight. II. G has a unique minimum spanning tree, i…Algorithms · Minimum Spanning Trees (Prim/Kruskal Algorithms) · MCQ · 2 marks
- Q49Consider the following snapshot of a system running n concurrent processes. Process i is holding X i instances of a resource R, 1 i n . Assume that all instances of R are currentl…Operating Systems (OS) · Deadlock Prevention, Avoidance, Detection, Recovery · MCQ · 2 marks
- Q50Consider the following statements: I. The smallest element in a max-heap is always at a leaf node. II. The second largest element in a max-heap is always a child of the root node.…Data Structures · Binary Search Trees (BSTs) & Binary Heaps · MCQ · 2 marks
- Q51Consider the following four processes with arrival times (in milliseconds) and their length of CPU burst (in milliseconds) as shown below: These processes are run on a single proc…Operating Systems (OS) · CPU and I/O Scheduling · NAT · 2 marks
- Q52The index node (inode) of a Unix-like file system has 12 direct, one single-indirect and one double-indirect pointers. The disk block size is 4 kB and the disk block address is 32…Operating Systems (OS) · File Systems Operations & Disk Scheduling Optimization · NAT · 2 marks
- Q53Consider the augmented grammar given below: S' S S (L) id L L, S S Let I 0 = CLOSURE (\ [S' S]\ ) . The number of items in the set GOTO ( I 0 , ( ) is .Compiler Design · Lexical Analysis & Parsing Architectures (LL(1), LR(1), LALR) · NAT · 2 marks
- Q55A certain processor deploys a single-level cache. The cache block size is 8 words and the word size is 4 bytes. The memory system uses a 60 MHz clock. To service a cache miss, the…Computer Organization and Architecture (COA) · Memory Hierarchy (Direct/Associative Cache Mapping) · NAT · 2 marks
- Q58Let be the set of all bijections from \ 1, ..., 5\ to \ 1, ..., 5\ , where id denotes the identity function, i.e. id(j) = j, j . Let denote composition on functions. For a string…Theory of Computation (TOC) · Regular Expressions & Finite Automata (DFA/NFA Min) · NAT · 2 marks
- Q59Consider that 15 machines need to be connected in a LAN using 8-port Ethernet switches. Assume that these switches do not have any separate uplink ports. The minimum number of swi…Computer Networks (CN) · Data Link Layer (Framing, Error Detection, MAC, Ethernet Bridging) · NAT · 2 marks
- Q60What is the minimum number of 2-input NOR gates required to implement 4-variable function expressed in sum-of-minterms form as f = (0, 2, 5, 7, 8, 10, 13, 15) ? Assume that all th…Digital Logic · Boolean Algebra, Minimization, K-Maps · NAT · 2 marks
- Q61A relational database contains two tables Student and Performance as shown below: The primary key of the Student table is Roll no. For the Performance table, the columns Roll no.…Database Management Systems (DBMS) · SQL Queries (DDL/DML, Joins, Aggregations) · NAT · 2 marks
- Q62Consider the following C program: c include <stdio.h> int main ( ) float sum = 0.0, j = 1.0, i = 2.0; while (i / j > 0.0625) j = j + j; sum = sum + i / j; printf("%f ", sum); retu…Programming in C · Data Types, Syntax, Control Structures, Loops · NAT · 2 marks
- Q63Consider the following C program: c include <stdio.h> int main ( ) int a[ ] = 2, 4, 6, 8, 10 ; int i, sum = 0, b = a + 4; for (i = 0; i < 5; i++) sum = sum + ( b - i) - (b - i); p…Programming in C · Pointers, Multi-Dimensional Arrays, Structures · NAT · 2 marks
- Q64In an RSA cryptosystem, the value of the public modulus parameter n is 3007. If it is also known that (n) = 2880 , where () denotes Euler’s Totient Function, then the prime factor…Computer Networks (CN) · Application Layer (DNS, SMTP, HTTP, FTP, Email) & Security · NAT · 2 marks
- Q65Consider the following relations P(X, Y, Z), Q(X, Y, T) and R(Y, V). How many tuples will be returned by the following relational algebra query? x ( (P.Y = R.Y R.V = V2) (P R)) -…Database Management Systems (DBMS) · Relational Models, Relational Algebra, Tuple Calculus · NAT · 2 marks
MATHEMATICAL FOUNDATIONS
- Q15Let U = \ 1, 2, ..., n\ and A = \ (x, X), x X and X U\ . Consider the following two statements on A . I. A = n.2 n - 1 II. A = k=1 n k n k Which of the following is correct?Discrete Mathematics · Combinatorics (Counting Rules, Summation Formulas) · MCQ · 1 mark
- Q19Let X be a square matrix. Consider the following two statements on X. I. X is invertible. II. Determinant of X is non-zero. Which one of the following is TRUE?Linear Algebra · Matrices, Determinants, & Linear Equation Systems · MCQ · 1 mark
- Q20Let G be an arbitrary group. Consider the following relations on G : R 1: a, b G, aR 1b , if and only if g G such that a = g -1 bg R 2: a, b G, aR 2b , if and only if a = b -1 Whi…Discrete Mathematics · Algebraic Structures (Monoids, Groups) · MCQ · 1 mark
- Q22Let G be an undirected complete graph on n vertices, where n > 2 . Then, the number of different Hamiltonian cycles in G is equal toDiscrete Mathematics · Graph Theory (Connectivity, Paths, Cycles, Trees) · MCQ · 1 mark
- Q23Compute x 3 x 4 - 81 2x 2 - 5x - 3Calculus · Limits, Continuity, and Differentiability · MCQ · 1 mark
- Q31The value of 3 51 5 is .Discrete Mathematics · Algebraic Structures (Monoids, Groups) · NAT · 1 mark
- Q32Two numbers are chosen independently and uniformly at random from the set 1, 2, ...,13 . The probability (rounded off to 3 decimal places) that their 4-bit (unsigned) binary repre…Probability & Statistics · Random Variables & Sampling Rules · NAT · 1 mark
- Q45Consider the first order predicate formula: x[( z \; z x ((z = x) (z = 1))) w (w > x) ( z \; z w ((w = z) (z = 1)))] Here ‘ a b ’ denotes that ‘ a divides b ’, where a and b are i…Discrete Mathematics · Propositional and First-Order Quantifier Logic · MCQ · 2 marks
- Q54Consider the following matrix: R = bmatrix 1 & 2 & 4 & 8 \\ 1 & 3 & 9 & 27 \\ 1 & 4 & 16 & 64 \\ 1 & 5 & 25 & 125 bmatrix The absolute value of the product of Eigen values of R is…Linear Algebra · Eigenvalues and Eigenvectors · NAT · 2 marks
- Q56Let T be a full binary tree with 8 leaves. (A full binary tree has every level full.) Suppose two leaves a and b of T are chosen uniformly and independently at random. The expecte…Probability & Statistics · Random Variables & Sampling Rules · NAT · 2 marks
- Q57Suppose Y is distributed uniformly in the open interval (1,6). The probability that the polynomial 3x 2 + 6xY + 3Y + 6 has only real roots is (rounded off to 1 decimal place) .Probability & Statistics · Continuous/Discrete Distributions (Uniform, Normal, Exponential) · NAT · 2 marks

