GateAI

GATE CSE 2018 Question Paper with Solutions & Answer Key

All 26 questions of the GATE CSE 2018 paper (27 marks: 25 one-mark and 1 two-mark; 15 MCQ, 0 MSQ, 11 NAT), with the answer key and a verified solution for each. See more GATE CSE question papers or all GATE CSE PYQs.

Questions
26
Total marks
27
MCQ / MSQ / NAT
15 / 0 / 11
Topics
23

GATE CSE 2018 paper analysis

Engineering Mathematics and Programming and Data Structures together made up 12 of 27 marks, down 14 from GATE CSE 2017 Set 1. 11 of 26 questions were NAT, the most since 2017. Linear Algebra was the heaviest single topic with 3 marks across 2 questions. Theory of Computation moved the most against GATE CSE 2017 Set 1: down 8 marks.

All GATE CSE 2018 questions

Each question opens its full verified solution.

  1. Q1 · MCQ · 1 mark · CombinatoricsWhich one of the following is a closed form expression for the generating function of the sequence {an}, where an = 2n + 3 for all n = 0, 1, 2, ?
  2. Q2 · MCQ · 1 mark · Programming in CConsider the following C program. #include struct Ournode{ char x,y,z; }; int main() { struct Ournode p = {'1', '0', 'a'+2}; struct Ournode *q = &p; printf ("%c, %c", *(…
  3. Q3 · MCQ · 1 mark · Linear Structures, Trees and HeapsA queue is implemented using a non-circular singly linked list. The queue has a head pointer and a tail pointer, as shown in the figure. Let n denote the number of nodes…
  4. Q4 · MCQ · 1 mark · Boolean Algebra and MinimizationLet ⊕ and denote the Exclusive OR and Exclusive NOR operations, respectively. Which one of the following is NOT CORRECT?
  5. Q5 · MCQ · 1 mark · Instruction Set and Addressing ModesConsider the following processor design characteristics. I. Register-to-register arithmetic operations only II. Fixed-length instruction format III. Hardwired control un…
  6. Q6 · MCQ · 1 mark · Regular Expressions and Finite AutomataLet N be an NFA with n states. Let k be the number of states of a minimal DFA which is equivalent to N. Which one of the following is necessarily true?
  7. Q7 · MCQ · 1 mark · Turing Machines and UndecidabilityThe set of all recursively enumerable languages is
  8. Q8 · MCQ · 1 mark · Lexical Analysis, Parsing and SDTWhich one of the following statements is FALSE?
  9. Q9 · MCQ · 1 mark · I/O Interface, Interrupts and DMAThe following are some events that occur after a device controller issues an interrupt while process L is under execution. (P) The processor pushes the process status of…
  10. Q10 · MCQ · 1 mark · Memory Management and Virtual MemoryConsider a process executing on an operating system that uses demand paging. The average time for a memory access in the system is M units if the corresponding memory pa…
  11. Q11 · MCQ · 1 mark · ER ModelIn an Entity-Relationship (ER) model, suppose R is a many-to-one relationship from entity set E1 to entity set E2. Assume that E1 and E2 participate totally in R and tha…
  12. Q12 · MCQ · 1 mark · SQLConsider the following two tables and four queries in SQL. Book ( isbn, bname), Stock ( isbn, copies) Query 1: SELECT B.isbn, S.copies FROM Book B INNER JOIN Stock S ON…
  13. Q13 · MCQ · 1 mark · Principles of LayeringMatch the following:
  14. Q14 · MCQ · 1 mark · TCP Flow and Congestion ControlConsider the following statements regarding the slow start phase of the TCP congestion control algorithm. Note that cwnd stands for the TCP congestion window and MSS den…
  15. Q15 · NAT · 1 mark · Probability and StatisticsTwo people, P and Q, decide to independently roll two identical dice, each with 6 faces, numbered 1 to 6. The person with the lower number wins. In case of a tie, they r…
  16. Q16 · NAT · 1 mark · CalculusThe value of 0 /4 x cos(x2)dx correct to three decimal places (assuming that = 3.14 ) is …
  17. Q17 · NAT · 1 mark · Linear AlgebraConsider a matrix A = uvT where u = 1 2 , v = 1 1 . Note that vT denotes the transpose of v. The largest eigenvalue of A is …
  18. Q18 · NAT · 1 mark · Discrete MathematicsThe chromatic number of the following graph is …
  19. Q19 · NAT · 1 mark · Sets, Relations, Lattices and GroupsLet G be a finite group on 84 elements. The size of a largest possible proper subgroup of G is …
  20. Q20 · NAT · 1 mark · TreesThe postorder traversal of a binary tree is 8,9,6,7,4,5,2,3,1. The inorder traversal of the same tree is 8,6,9,4,7,2,5,1,3. The height of a tree is the length of the lon…
  21. Q21 · NAT · 1 mark · Programming in CConsider the following C program: #include int counter = 0; int calc (int a, int b) { int c; counter++; if (b==3) return (a*a*a); else { c = calc(a, b/3); return (c*c*c)…
  22. Q22 · NAT · 1 mark · Combinational and Sequential CircuitsConsider the sequential circuit shown in the figure, where both flip-flops used are positive edge-triggered D flip-flops. The number of states in the state transition di…
  23. Q23 · NAT · 1 mark · Cache Memory and HierarchyA 32-bit wide main memory unit with a capacity of 1 GB is built using 256M × 4-bit DRAM chips. The number of rows of memory cells in the DRAM chip is 214. The time taken…
  24. Q24 · NAT · 1 mark · DeadlockConsider a system with 3 processes that share 4 instances of the same resource type. Each process can request a maximum of K instances. Resource instances can be request…
  25. Q25 · NAT · 1 mark · TCP Flow and Congestion ControlConsider a long-lived TCP session with an end-to-end bandwidth of 1 Gbps (= 109 bits-per-second). The session starts with a sequence number of 1234. The minimum time (in…
  26. Q26 · MCQ · 2 marks · Linear AlgebraConsider a matrix P whose only eigenvectors are the multiples of 1 4 . Consider the following statements. (I) P does not have an inverse (II) P has a repeated eigenvalue…

GATE CSE 2018 answer key

Official answers. Open a question for the full solution.

QTypeMarksAnswerTopic
Q1MCQ1DCombinatorics
Q2MCQ1AProgramming in C
Q3MCQ1BLinear Structures, Trees and Heaps
Q4MCQ1DBoolean Algebra and Minimization
Q5MCQ1DInstruction Set and Addressing Modes
Q6MCQ1DRegular Expressions and Finite Automata
Q7MCQ1BTuring Machines and Undecidability
Q8MCQ1BLexical Analysis, Parsing and SDT
Q9MCQ1AI/O Interface, Interrupts and DMA
Q10MCQ1BMemory Management and Virtual Memory
Q11MCQ1AER Model
Q12MCQ1DSQL
Q13MCQ1CPrinciples of Layering
Q14MCQ1CTCP Flow and Congestion Control
Q15NAT10.023Probability and Statistics
Q16NAT10.289Calculus
Q17NAT13Linear Algebra
Q18NAT13Discrete Mathematics
Q19NAT142Sets, Relations, Lattices and Groups
Q20NAT14Trees
Q21NAT14Programming in C
Q22NAT12Combinational and Sequential Circuits
Q23NAT159Cache Memory and Hierarchy
Q24NAT12Deadlock
Q25NAT134TCP Flow and Congestion Control
Q26MCQ2DLinear Algebra

Subject-wise weightage

Where the marks came from in GATE CSE 2018, against GATE CSE 2017 Set 1 and the average paper.

GATE CSE 2018 FAQ

How many questions were in GATE CSE 2018?
GATE CSE 2018 had 26 questions for 27 marks: 15 MCQ, 0 MSQ and 11 NAT.
Which subject carried the most marks in GATE CSE 2018?
Engineering Mathematics carried the most marks (8 of 27). The top three were Engineering Mathematics (8), Programming and Data Structures (4), Computer Organization and Architecture (3).
Where can I find the GATE CSE 2018 answer key?
The answer key table on this page lists the answer to every question of GATE CSE 2018. Open any question for its full verified solution.
Is the GATE CSE 2018 paper useful for GATE 2027 preparation?
Yes. Solving past GATE CSE papers shows how marks are spread across subjects and which topics repeat. Compare it with other GATE CSE question papers and the topic-wise GATE CSE PYQs.

Explore more GATE CSE papers