GATE CS 2023 (Forenoon)
65 questions · 100 marks · 180 minutes
GENERAL APTITUDE (GA)
- Q1We reached the station late, and missed the train.Verbal Aptitude · Basic Vocabulary (Words, Idioms, Phrases in Context) · MCQ · 1 mark
- Q2Kind : : : Often : Frequently (By word meaning)Analytical Aptitude · Analogy and Relationship Matching · MCQ · 1 mark
- Q3A series of natural numbers F 1, F 2, F 3, F 4, F 5, F 6, F 7, beys F n+1 = F n + F n-1 for all integers n 2 . If F 6 = 37 , and F 7 = 60 , then what is F 1 ?Analytical Aptitude · Numerical Relations & Arithmetic Logic · MCQ · 1 mark
- Q4A survey for a certain year found that 90% of pregnant women received medical care at least once before giving birth. Of these women, 60% received medical care from doctors, while…Analytical Aptitude · Logic Deduction and Induction Frameworks · MCQ · 1 mark
- Q5Looking at the surface of a smooth 3-dimensional object from the outside, which one of the following options is TRUE?Spatial Aptitude · Pattern Identification in 2D and 3D Spaces · MCQ · 1 mark
- Q6The country of Zombieland is in distress since more than 75% of its working population is suffering from serious health issues. Studies conducted by competent health experts concl…Analytical Aptitude · Logic Deduction and Induction Frameworks · MCQ · 2 marks
- Q7Consider two functions of time (t) , f(t) = 0.01t 2 g(t) = 4t where 0 < t < . Now consider the following two statements: (i) For some t > 0 , g(t) > f(t) (ii) There exists a T , s…Quantitative Aptitude · Mathematical Operations (Powers, Exponents, Logarithms) · MCQ · 2 marks
- Q8Which one of the following sentence sequences creates a coherent narrative? (i) Once on the terrace, on her way to her small room in the corner, she notices the man right away. (i…Verbal Aptitude · Narrative Sequencing · MCQ · 2 marks
- Q9f(x) and g(y) are functions of x and y , respectively, and f(x) = g(y) for all real values of x and y Which one of the following options is necessarily TRUE for all x and y ?Analytical Aptitude · Numerical Relations & Arithmetic Logic · MCQ · 2 marks
- Q10Which one of the options best describes the transformation of the 2-dimensional figure P to Q , and then to R , as shown?Spatial Aptitude · Shape Transformation (Translation, Rotation, Scaling) · MCQ · 2 marks
CORE CS
- Q11Consider the following statements regarding the front-end and back-end of a compiler. S1: The front-end includes phases that are independent of the target hardware. S2: The back-e…Compiler Design · Lexical Analysis & Parsing Architectures (LL(1), LR(1), LALR) · MCQ · 1 mark
- Q12Which one of the following sequences when stored in an array at locations A[1], , A[10] forms a max-heap?Data Structures · Binary Search Trees (BSTs) & Binary Heaps · MCQ · 1 mark
- Q13Let SLLdel be a function that deletes a node in a singly-linked list given a pointer to the node and a pointer to the head of the list. Similarly, let DLLdel be another function t…Data Structures · Linked Lists & Binary Trees · MCQ · 1 mark
- Q14Consider the Deterministic Finite-state Automaton (DFA) A shown below. The DFA runs on the alphabet \ 0, 1\ , and has the set of states \ s, p, q, r\ , with s being the start stat…Theory of Computation (TOC) · Regular Expressions & Finite Automata (DFA/NFA Min) · MCQ · 1 mark
- Q16Which one of the options given below refers to the degree (or arity) of a relation in relational database systems?Database Management Systems (DBMS) · Relational Models, Relational Algebra, Tuple Calculus · MCQ · 1 mark
- Q17Suppose two hosts are connected by a point-to-point link and they are configured to use Stop-and-Wait protocol for reliable data transfer. Identify in which one of the following s…Computer Networks (CN) · Data Link Layer (Framing, Error Detection, MAC, Ethernet Bridging) · MCQ · 1 mark
- Q19Consider the following definition of a lexical token id for an identifier in a programming language, using extended regular expressions: letter [A – Za – a] digit [0 – 9] id lette…Theory of Computation (TOC) · Regular Expressions & Finite Automata (DFA/NFA Min) · MCQ · 1 mark
- Q20An algorithm has to store several keys generated by an adversary in a hash table. The adversary is malicious who tries to maximize the number of collisions. Let k be the number of…Algorithms · Searching, Sorting, Hashing Mechanisms · MCQ · 1 mark
- Q21The output of a 2-input multiplexer is connected back to one of its inputs as shown in the figure. Match the functional equivalence of this circuit to one of the following options.Digital Logic · Sequential Circuits (Flip-Flops, Registers, Counters) · MCQ · 1 mark
- Q22Which one or more of the following need to be saved on a context switch from one thread (T1) of a process to another thread (T2) of the same process?Operating Systems (OS) · System Calls, Processes, Threads, InterProcess Communication · MSQ · 1 mark
- Q23Which one or more of the following options guarantee that a computer system will transition from user mode to Kernel mode?Operating Systems (OS) · System Calls, Processes, Threads, InterProcess Communication · MSQ · 1 mark
- Q24Which of the following statements is/are CORRECT?Theory of Computation (TOC) · Regular and Context-Free Languages & Pumping Lemma · MSQ · 1 mark
- Q25Which of the following statements is/are INCORRECT about the OSPF (Open Shortest Path First) routing protocol used in the Internet?Computer Networks (CN) · Routing Protocols (Shortest Path, Flooding, Distance Vector, Link State Routing) · MSQ · 1 mark
- Q27Which one or more of the following CPU scheduling algorithms can potentially cause starvation?Operating Systems (OS) · CPU and I/O Scheduling · MSQ · 1 mark
- Q29Let f and g be functions of natural numbers given by f(n) = n and g(n) = n 2 . Which of the following statements is/are TRUE?Algorithms · Asymptotic Analysis (O, Omega, Theta Complexities) · MSQ · 1 mark
- Q32A particular number is written as 132 in radix-4 representation. The same number in radix-5 representation is .Digital Logic · Number Representations & Fixed/Floating Point Math · NAT · 1 mark
- Q33Consider a 3-stage pipelined processor having a delay of 10 ns (nanoseconds), 20 ns, and 14 ns, for the first, second, and the third stages, respectively. Assume that there is no…Computer Organization and Architecture (COA) · Instruction Pipelining, Performance, Hazard Management · NAT · 1 mark
- Q34A keyboard connected to a computer is used at a rate of 1 keystroke per second. The computer system polls the keyboard every 10 ms (milli seconds) to check for a keystroke and con…Computer Organization and Architecture (COA) · I/O Interfaces (Interrupts & DMA Control Modes) · NAT · 1 mark
- Q35The integer value printed by the ANSI-C program given below is c include<stdio.h> int funcp( ) static int x = 1; x++; return x; int main( ) int x, y; x = funcp( ); y = funcp( ) +…Programming in C · Functions, Parameter Passing, Scope Rules, Recursion · NAT · 1 mark
- Q36Consider the following program: c int main( ) f1( ); f1(2); f3( ); return (0); int f1( ) return(1); int f2(int X) f3( ); if (X == 1) return f1( ); else return (X f2(X - 1)); int f…Programming in C · Functions, Parameter Passing, Scope Rules, Recursion · MCQ · 2 marks
- Q37Consider the control flow graph shown: Which one of the following choices correctly lists the set of live variables at the exit point of each basic block?Compiler Design · Data Flow Analysis: Constant Propagation, Liveliness Analysis, Common Subexpression Elimination · MCQ · 2 marks
- Q38Consider the two functions incr and decr shown below: c incr( ) wait(s); X = X + 1; signal(s); decr( ) wait(s); X = X - 1; signal(s); There are 5 threads each invoking incr once,…Operating Systems (OS) · Concurrency & Synchronization (Semaphores, Mutex, Monitors, Locks) · MCQ · 2 marks
- Q39Consider the context-free grammar G below: S aSb X X aX Xb a b where S and X are non-terminals, and a and b are terminal symbols. The starting non-terminal is S . Which one of the…Theory of Computation (TOC) · Context-Free Grammars & Push-Down Automata · MCQ · 2 marks
- Q40Consider the pushdown automaton (PDA) P below, which runs on the input alphabet \ a, b\ , has stack alphabet \ , A\ , and has three states \ s, p, q\ , with s being the start stat…Theory of Computation (TOC) · Context-Free Grammars & Push-Down Automata · MCQ · 2 marks
- Q41Consider the given C-code and its corresponding assembly code, with a few operands U1–U4 being unknown. Some useful information as well as the semantics of each unique assembly in…Computer Organization and Architecture (COA) · Machine Instructions & Addressing Modes · MCQ · 2 marks
- Q42A 4 kilobyte (KB) byte-addressable memory is realized using four 1 KB memory blocks. Two input address lines (IA4 and IA3) are connected to the chip select (CS) port of these memo…Operating Systems (OS) · Memory Management and Virtual Memory · MCQ · 2 marks
- Q43Consider a sequential digital circuit consisting of T flip-flops and D flip-flops as shown in the figure. CLKIN is the clock input to the circuit. At the beginning, Q1, Q2 and Q3…Digital Logic · Sequential Circuits (Flip-Flops, Registers, Counters) · MCQ · 2 marks
- Q44A Boolean digital circuit is composed using two 4-input multiplexers (M1 and M2) and one 2-input multiplexer (M3) as shown in the figure. X0 – X7 are the inputs of the multiplexer…Digital Logic · Combinational Logic (Multiplexers, Decoders, Adders) · MCQ · 2 marks
- Q45Consider the IEEE-754 single precision floating point numbers P = 0xC1800000 and Q = 0x3F5C2EF4 . Which one of the following corresponds to the product of these numbers (i.e., P Q…Digital Logic · Number Representations & Fixed/Floating Point Math · MCQ · 2 marks
- Q46Let A be a priority queue for maintaining a set of elements. Suppose A is implemented using a max-heap data structure. The operation Extract-Max( A ) extracts and deletes the maxi…Data Structures · Binary Search Trees (BSTs) & Binary Heaps · MCQ · 2 marks
- Q47Consider the C function foo and the binary tree shown: c typedef struct node int val; struct node left, right; node; int foo(node p) int retval; if (p == NULL) return 0; else retv…Programming in C · Functions, Parameter Passing, Scope Rules, Recursion · MCQ · 2 marks
- Q50Suppose you are asked to design a new reliable byte-stream transport protocol like TCP. This protocol, named myTCP, runs over a 100 Mbps network with Round Trip Time of 150 millis…Computer Networks (CN) · Transport Layer (Flow Control and Congestion Control, TCP, UDP, Sockets) · MSQ · 2 marks
- Q52Suppose in a web browser, you click on the www.gate-2023.in URL. The browser cache is empty. The IP address for this URL is not cached in your local host, so a DNS lookup is trigg…Computer Networks (CN) · Application Layer (DNS, SMTP, HTTP, FTP, Email) & Security · MSQ · 2 marks
- Q54Consider functions Function 1 and Function 2 expressed in pseudocode as follows: Function 1 while n > 1 do for i = 1 to n do x = x + 1; end for n = n/2 ; end while Function 2 for…Algorithms · Asymptotic Analysis (O, Omega, Theta Complexities) · MSQ · 2 marks
- Q57Consider the following two-dimensional array D in the C programming language, which is stored in row-major order: c int D[128][128]; Demand paging is used for allocating memory an…Operating Systems (OS) · Memory Management and Virtual Memory · NAT · 2 marks
- Q58Consider a computer system with 57-bit virtual addressing using multi-level tree-structured page tables with L levels for virtual to physical address translation. The page size is…Operating Systems (OS) · Memory Management and Virtual Memory · NAT · 2 marks
- Q59Consider a sequence a of elements a 0 = 1, a 1 = 5, a 2 = 7, a 3 = 8, a 4 = 9, and a 5 = 2. The following operations are performed on a stack S and a queue Q, both of which are in…Data Structures · Abstract Data Types (ADTs), Stacks, Queues · NAT · 2 marks
- Q60Consider the syntax directed translation given by the following grammar and semantic rules. Here N, I, F and B are non-terminals. N is the starting non-terminal, and , 0 and 1 are…Compiler Design · Syntax-Directed Translation & Runtime Environments · NAT · 2 marks
- Q61Consider the following table named Student in a relational database. The primary key of this table is rollNum. The SQL query below is executed on this database. sql SELECT FROM St…Database Management Systems (DBMS) · SQL Queries (DDL/DML, Joins, Aggregations) · NAT · 2 marks
- Q62Consider a database of fixed-length records, stored as an ordered file. The database has 25,000 records, with each record being 100 bytes, of which the primary key occupies 15 byt…Database Management Systems (DBMS) · File Organization & Indexing (e.g., B and B+ Trees) · NAT · 2 marks
- Q63Consider the language L over the alphabet \ 0, 1\ , given below: L = \ w \ 0, 1\ w does not contain three or more consecutive 1's \ . The minimum number of states in a Determinist…Theory of Computation (TOC) · Regular Expressions & Finite Automata (DFA/NFA Min) · NAT · 2 marks
- Q64An 8-way set associative cache of size 64 KB (1 KB = 1024 bytes) is used in a system with 32-bit address. The address is sub-divided into TAG, INDEX, and BLOCK OFFSET. The number…Computer Organization and Architecture (COA) · Memory Hierarchy (Direct/Associative Cache Mapping) · NAT · 2 marks
- Q65The forwarding table of a router is shown below: A packet addressed to a destination address 200.150.68.118 arrives at the router. It will be forwarded to the interface with ID .Computer Networks (CN) · Routing Protocols (Shortest Path, Flooding, Distance Vector, Link State Routing) · NAT · 2 marks
MATHEMATICAL FOUNDATIONS
- Q15The Lucas sequence L n is defined by the recurrence relation: L n = L n-1 + L n-2 , for n 3, with L 1 = 1 and L 2 = 3 . Which one of the options given is TRUE?Discrete Mathematics · Recurrence Relations and Generating Functions · MCQ · 1 mark
- Q18Let and A = bmatrix 1 & 2 & 3 & 4 \\ 4 & 1 & 2 & 3 \\ 3 & 4 & 1 & 2 \\ 2 & 3 & 4 & 1 bmatrix and B = bmatrix 3 & 4 & 1 & 2 \\ 4 & 1 & 2 & 3 \\ 1 & 2 & 3 & 4 \\ 2 & 3 & 4 & 1 bmatr…Linear Algebra · Matrices, Determinants, & Linear Equation Systems · MCQ · 1 mark
- Q26Geetha has a conjecture about integers, which is of the form x (P(x) y Q(x, y)) , where P is a statement about integers, and Q is a statement about pairs of integers. Which of the…Discrete Mathematics · Propositional and First-Order Quantifier Logic · MSQ · 1 mark
- Q28Let f(x) = x 3 + 15x 2 - 33x - 36 be a real-valued function. Which of the following statements is/are TRUE?Calculus · Maxima and Minima Optimization Bounds · MSQ · 1 mark
- Q30Let A be the adjacency matrix of the graph with vertices \ 1, 2, 3, 4, 5\ . Let 1, 2, 3, 4 and 5 be the five eigenvalues of A . Note that these eigenvalues need not be distinct. T…Linear Algebra · Eigenvalues and Eigenvectors · NAT · 1 mark
- Q31The value of the definite integral -3 3 -2 2 -1 1 (4x 2y - z 3) dz \, dy \, dx is . (Rounded off to the nearest integer)Calculus · Mean Value Theorems & Definite Integration · NAT · 1 mark
- Q48Let U = \ 1, 2, , n\ , where n is a large positive integer greater than 1000. Let k be a positive integer less than n . Let A, B be subsets of U with A = B = k and A B = . We say…Discrete Mathematics · Combinatorics (Counting Rules, Summation Formulas) · MCQ · 2 marks
- Q49Let f : A B be an onto (or surjective) function, where A and B are non-empty sets. Define an equivalence relation on the set A as a 1 a 2 if f(a 1) = f(a 2), where a 1, a 2 A. Let…Discrete Mathematics · Sets, Relations, Functions, Partial Orders, Lattices · MSQ · 2 marks
- Q51Let X be a set and 2 X denote the powerset of X. Define a binary operation on 2 X as follows: A B = (A - B) (B - A) Let H = (2 X, ). Which of the following statements about H is/a…Discrete Mathematics · Algebraic Structures (Monoids, Groups) · MSQ · 2 marks
- Q53Consider a random experiment where two fair coins are tossed. Let A be the event that denotes HEAD on both the throws, B be the event that denotes HEAD on the first throw, and C b…Probability & Statistics · Conditional Probability & Bayes Theorem · MSQ · 2 marks
- Q55Let G be a simple, finite, undirected graph with vertex set \ v 1, , v n\ . Let (G) denote the maximum degree of G and let N = \ 1, 2, \ denote the set of all possible colors. Col…Discrete Mathematics · Advanced Graph Bounds (Matching, Coloring Theorems) · MSQ · 2 marks
- Q56Let U = \ 1, 2, 3\ . Let 2 U denote the powerset of U. Consider an undirected graph G whose vertex set is 2 U. For any A, B 2 U, (A, B) is an edge in G if and only if (i) A B, and…Discrete Mathematics · Graph Theory (Connectivity, Paths, Cycles, Trees) · NAT · 2 marks

