GATE CSE 2017 Set 1 Question Paper with Solutions & Answer Key
All 65 questions of the GATE CSE 2017 Set 1 paper (100 marks: 30 one-mark and 35 two-mark; 45 MCQ, 0 MSQ, 20 NAT), with the answer key and a verified solution for each. See more GATE CSE question papers or all GATE CSE PYQs.
- Questions
- 65
- Total marks
- 100
- MCQ / MSQ / NAT
- 45 / 0 / 20
- Topics
- 38
GATE CSE 2017 Set 1 paper analysis
Engineering Mathematics and General Aptitude together made up 30 of 100 marks, up 17 from GATE CSE 2016 Set 1. 20 of 65 questions were NAT, the most since 2016. Programming in C was the heaviest single topic with 6 marks across 4 questions. General Aptitude moved the most against GATE CSE 2016 Set 1: up 15 marks.
All GATE CSE 2017 Set 1 questions
Each question opens its full verified solution.
- Q1 · MCQ · 1 mark · Discrete MathematicsThe statement ( eg p) ⇒ ( eg q) is logically equivalent to which of the statements below? I. p ⇒ q II. q ⇒ p III. ( eg q) p IV. ( eg p) q
- Q2 · MCQ · 1 mark · Discrete MathematicsConsider the first-order logic sentence F: ∀ x(∃ y R(x, y)). Assuming non-empty logical domains, which of the sentences below are *implied* by F? I. ∃ y(∃ x R(x, y)) II.…
- Q3 · MCQ · 1 mark · Linear AlgebraLet c1, , cn be scalars, not all zero, such that Σi=1n ci ai = 0 where ai are column vectors in Rn. Consider the set of linear equations Ax = b where A = [a1, , an] and…
- Q4 · MCQ · 1 mark · Asymptotic AnalysisConsider the following functions from positive integers to real numbers: 10, √(n), n, log2 n, (100)/(n) The CORRECT arrangement of the above functions in increasing orde…
- Q5 · MCQ · 1 mark · Algorithm Design TechniquesConsider the following table: Match the algorithms to the design paradigms they are based on.
- Q6 · MCQ · 1 mark · Binary Search TreesLet T be a binary search tree with 15 nodes. The minimum and maximum possible heights of T are: Note: The height of a tree with a single node is 0.
- Q7 · MCQ · 1 mark · Number Representation and ArithmeticThe n-bit fixed-point representation of an unsigned real number X uses f bits for the fraction part. Let i = n - f. The range of decimal values for X in this representat…
- Q8 · MCQ · 1 mark · Programming in CConsider the C code fragment given below. typedef struct node { int data; node* next; } node; void join(node* m, node* n){ node* p = n; while(p->next != NULL) { p = p->n…
- Q9 · MCQ · 1 mark · Number Representation and ArithmeticWhen two 8-bit numbers A7 A0 and B7 B0 in 2's complement representation (with A0 and B0 as the least significant bits) are added using a ripple-carry adder, the sum bits…
- Q10 · MCQ · 1 mark · Context-Free Grammars and PDAsConsider the following context-free grammar over the alphabet = {a, b, c} with S as the start symbol: S → abScT abcT T → bT b Which one of the following represents the l…
- Q11 · MCQ · 1 mark · Instruction Set and Addressing ModesConsider the C struct defined below: struct data { int marks [100]; char grade; int cnumber; }; struct data student; The base address of student is available in register…
- Q12 · MCQ · 1 mark · Intermediate Code GenerationConsider the following intermediate program in three address code p = a - b q = p * c p = u * v q = p + q Which one of the following corresponds to a static single assig…
- Q13 · MCQ · 1 mark · Programming in CConsider the following C code: #include int *assignval(int *x, int val) { *x = val; return x; } void main () { int *x = malloc(sizeof(int)); if(NULL == x) return; x = as…
- Q14 · MCQ · 1 mark · TCP Flow and Congestion ControlConsider a TCP client and a TCP server running on two different machines. After completing data transfer, the TCP client calls close to terminate the connection and a FI…
- Q15 · MCQ · 1 mark · Network SecurityA sender S sends a message m to receiver R, which is digitally signed by S with its private key. In this scenario, one or more of the following security violations can t…
- Q16 · MCQ · 1 mark · Integrity Constraints and Normal FormsThe following functional dependencies hold true for the relational schema R{V, W, X, Y, Z}: V &→ W VW &→ X Y &→ VX Y &→ Z Which of the following is irreducible equivalen…
- Q17 · MCQ · 1 mark · Lexical Analysis, Parsing and SDTConsider the following grammar: What is FOLLOW(Q)?
- Q18 · MCQ · 1 mark · Processes, Threads and IPCThreads of a process share
- Q19 · NAT · 1 mark · Probability and StatisticsLet X be a Gaussian random variable with mean 0 and variance 2. Let Y = max(X, 0) where max(a,b) is the maximum of a and b. The median of Y is …
- Q20 · NAT · 1 mark · Discrete MathematicsLet T be a tree with 10 vertices. The sum of the degrees of all the vertices in T is …
- Q21 · NAT · 1 mark · Boolean Algebra and MinimizationConsider the Karnaugh map given below, where X represents “don't care” and blank represents 0. Assume for all inputs (a, b, c, d) , the respective complements ( a, b, c,…
- Q22 · NAT · 1 mark · Regular Expressions and Finite AutomataConsider the language L given by the regular expression (a+b)*b(a+b) over the alphabet {a,b} . The smallest number of states needed in a deterministic finite-state autom…
- Q23 · NAT · 1 mark · Relational Model and SQLConsider a database that has the relation schema EMP (EmpId, EmpName, and DeptName). An instance of the schema EMP and a SQL query on it are given below. The output of e…
- Q24 · NAT · 1 mark · CPU and I/O SchedulingConsider the following CPU processes with arrival times (in milliseconds) and length of CPU bursts (in milliseconds) as given below : If the pre-emptive shortest remaini…
- Q25 · NAT · 1 mark · Cache Memory and HierarchyConsider a two-level cache hierarchy with L1 and L2 caches. An application incurs 1.4 memory accesses per instruction on average. For this application, the miss rate of…
- Q26 · MCQ · 2 marks · Graph Traversals, MSTs and Shortest PathsLet G = (V, E) be *any* connected undirected edge-weighted graph. The weights of the edges in E are positive and distinct. Consider the following statements: (I) Minimum…
- Q27 · MCQ · 2 marks · DeadlockA multithreaded program P executes with x number of threads and uses y number of locks for ensuring mutual exclusion while operating on shared memory locations. All lock…
- Q28 · MCQ · 2 marks · CalculusThe value of limx → 1 (x7 - 2x5 + 1)/(x3 - 3x2 + 2)
- Q29 · MCQ · 2 marks · Discrete MathematicsLet p, q, and r be propositions and the expression (p → q) → r be a contradiction. Then, the expression (r → p) → q is
- Q30 · MCQ · 2 marks · Linear AlgebraLet u and v be two vectors in R2 whose Euclidean norms satisfy \|u\| = 2\|v\|. What is the value of such that w = u + v bisects the angle between u and v?
- Q31 · MCQ · 2 marks · Linear AlgebraLet A be n × n real valued square symmetric matrix of rank 2 with Σi=1n Σj=1n Aij2 = 50. Consider the following statements. (I) One eigenvalue must be in [-5, 5] (II) Th…
- Q32 · MCQ · 2 marks · Data Link LayerA computer network uses polynomials over GF(2) for error checking with 8 bits as information bits and uses x3 + x + 1 as the generator polynomial to generate the check b…
- Q33 · MCQ · 2 marks · Combinational and Sequential CircuitsConsider a combination of T and D flip-flops connected as shown below. The output of the D flip-flop is connected to the input of the T flip-flop and the output of the T…
- Q34 · MCQ · 2 marks · Context-Free Grammars and PDAsIf G is a grammar with productions S → SaS aSb bSa SS where S is the start variable, then which one of the following strings is not generated by G?
- Q35 · MCQ · 2 marks · RecursionConsider the following two functions. void fun1(int n) { if(n == 0) return; printf("%d", n); fun2(n - 2); printf("%d", n); } void fun2(int n) { if(n == 0) return; printf…
- Q36 · MCQ · 2 marks · RecursionConsider the C functions foo and bar given below: int foo(int val) { int x = 0; while(val > 0) { x = x + foo(val--); } return val; } int bar(int val) { int x = 0; while(…
- Q37 · MCQ · 2 marks · Context-Free Grammars and PDAsConsider the context-free grammars over the alphabet {a,b,c} given below. S and T are non-terminals. G1: S → aSb | T, T → cT | G2: S → bSa | T, T → cT | The language L(G…
- Q38 · MCQ · 2 marks · Regular and Context-Free LanguagesConsider the following languages over the alphabet = {a, b, c}. Let L1 = { an bn cm m, n ≥ 0 } and L2 = { am bn cn m, n ≥ 0 }. Which of the following are context-free la…
- Q39 · MCQ · 2 marks · Turing Machines and UndecidabilityLet A and B be finite alphabets and let \# be a symbol outside both A and B. Let f be a total function from A* to B*. We say f is computable if there exists a Turing mac…
- Q40 · MCQ · 2 marks · Memory Management and Virtual MemoryRecall that Belady's anomaly is that the page-fault rate may increase as the number of allocated frames increases. Now, consider the following statements: S1: Random pag…
- Q41 · MCQ · 2 marks · Relational Model and SQLConsider a database that has the relation schemas EMP(EmpId, EmpName, DeptId), and DEPT(DeptName, DeptId). Note that the DeptId can be permitted to be NULL in the relati…
- Q42 · MCQ · 2 marks · Transactions and Concurrency ControlIn a database system, unique timestamps are assigned to each transaction using Lamport's logical clock. Let TS(T1) and TS(T2) be the timestamps of transactions T1 and T2…
- Q43 · NAT · 2 marks · Intermediate Code GenerationConsider the following grammar: stmt -> if expr then expr else expr; stmt | ò expr -> term relop term | term term -> id | number id -> a | b | c number -> [0-9] where re…
- Q44 · NAT · 2 marks · Network SecurityIn a RSA cryptosystem, a participant A uses two prime numbers p = 13 and q = 17 to generate her public and private keys. If the public key of A is 35, then the private k…
- Q45 · NAT · 2 marks · Data Link LayerThe values of parameters for the Stop-and-Wait ARQ protocol are as given below: Bit rate of the transmission channel = 1 Mbps. Propagation delay from sender to receiver…
- Q46 · NAT · 2 marks · Relational Model and SQLConsider a database that has the relation schema CR(StudentName, CourseName). An instance of the schema CR is as given below. The following query is made on the database…
- Q47 · NAT · 2 marks · CombinatoricsThe number of integers between 1 and 500 (both inclusive) that are divisible by 3 or 5 or 7 is …
- Q48 · NAT · 2 marks · Searching, Sorting and HashingLet A be an array of 31 numbers consisting of a sequence of 0's followed by a sequence of 1's. The problem is to find the smallest index i such that A[i] is 1 by probing…
- Q49 · NAT · 2 marks · Instruction Set and Addressing ModesConsider a RISC machine where each instruction is exactly 4 bytes long. Conditional and unconditional branch instructions use PC-relative addressing mode with Offset spe…
- Q50 · NAT · 2 marks · Instruction PipeliningInstruction execution in a processor is divided into 5 stages, Instruction Fetch (IF), Instruction Decode (ID), Operand Fetch (OF), Execute (EX), and Write Back (WB). Th…
- Q51 · NAT · 2 marks · Cache Memory and HierarchyConsider a 2-way set associative cache with 256 blocks and uses LRU replacement. Initially the cache is empty. Conflict misses are those misses which occur due to conten…
- Q52 · NAT · 2 marks · Intermediate Code GenerationConsider the expression (a - 1) * (((b + c) / 3) + d). Let X be the minimum number of registers required by an optimal code generation (without any register spill) algor…
- Q53 · NAT · 2 marks · Programming in CConsider the following C program. #include #include void printlength(char *s, char *t) { unsigned int c = 0; int len = ((strlen(s) - strlen(t)) > c) ? strlen(s): strlen(…
- Q54 · NAT · 2 marks · Cache Memory and HierarchyA cache memory unit with capacity of N words and block size of B words is to be designed. If it is designed as a direct mapped cache, the length of the TAG field is 10 b…
- Q55 · NAT · 2 marks · Programming in CThe output of executing the following C program is … #include int total(int v) { static int count = 0; while(v) { count += v&1; v >>= 1; } return count; } void main() {…
- Q56 · MCQ · 1 mark · Verbal AptitudeAfter Rajendra Chola returned from his voyage to Indonesia, he … to visit the temple in Thanjavur.
- Q57 · MCQ · 1 mark · Verbal AptitudeResearch in the workplace reveals that people work for many reasons …
- Q58 · MCQ · 1 mark · Analytical AptitudeRahul, Murali, Srinivas and Arul are seated around a square table. Rahul is sitting to the left of Murali. Srinivas is sitting to the right of Arul. Which of the followi…
- Q59 · MCQ · 1 mark · Quantitative AptitudeFind the smallest number y such that y × 162 is a perfect cube.
- Q60 · MCQ · 1 mark · Quantitative AptitudeThe probability that a k-digit number does NOT contain the digits 0, 5, or 9 is
- Q61 · MCQ · 2 marks · Verbal Aptitude“The hold of the nationalist imagination on our colonial past is such that anything inadequately or improperly nationalist is just not history.” Which of the following s…
- Q62 · MCQ · 2 marks · Analytical AptitudeSix people are seated around a circular table. There are at least two men and two women. There are at least three right-handed persons. Every woman has a left-handed per…
- Q63 · MCQ · 2 marks · Quantitative AptitudeThe expression ((x+y)-|x-y|)/(2) is equal to
- Q64 · MCQ · 2 marks · Quantitative AptitudeArun, Gulab, Neel and Shweta must choose one shirt each from a pile of four shirts coloured red, pink, blue and white respectively. Arun dislikes the colour red and Shwe…
- Q65 · MCQ · 2 marks · Spatial AptitudeA contour line joins locations having the same height above the mean sea level. The following is a contour plot of a geographical region. Contour lines are shown at 25 m…
GATE CSE 2017 Set 1 answer key
Official answers. Open a question for the full solution.
| Q | Type | Marks | Answer | Topic |
|---|---|---|---|---|
| Q1 | MCQ | 1 | D | Discrete Mathematics |
| Q2 | MCQ | 1 | B | Discrete Mathematics |
| Q3 | MCQ | 1 | C | Linear Algebra |
| Q4 | MCQ | 1 | B | Asymptotic Analysis |
| Q5 | MCQ | 1 | C | Algorithm Design Techniques |
| Q6 | MCQ | 1 | B | Binary Search Trees |
| Q7 | MCQ | 1 | D | Number Representation and Arithmetic |
| Q8 | MCQ | 1 | B | Programming in C |
| Q9 | MCQ | 1 | C | Number Representation and Arithmetic |
| Q10 | MCQ | 1 | B | Context-Free Grammars and PDAs |
| Q11 | MCQ | 1 | D | Instruction Set and Addressing Modes |
| Q12 | MCQ | 1 | B | Intermediate Code Generation |
| Q13 | MCQ | 1 | D | Programming in C |
| Q14 | MCQ | 1 | D | TCP Flow and Congestion Control |
| Q15 | MCQ | 1 | B | Network Security |
| Q16 | MCQ | 1 | A | Integrity Constraints and Normal Forms |
| Q17 | MCQ | 1 | C | Lexical Analysis, Parsing and SDT |
| Q18 | MCQ | 1 | D | Processes, Threads and IPC |
| Q19 | NAT | 1 | 0 | Probability and Statistics |
| Q20 | NAT | 1 | 18 | Discrete Mathematics |
| Q21 | NAT | 1 | 1 | Boolean Algebra and Minimization |
| Q22 | NAT | 1 | 4 | Regular Expressions and Finite Automata |
| Q23 | NAT | 1 | 2.6 | Relational Model and SQL |
| Q24 | NAT | 1 | 3 | CPU and I/O Scheduling |
| Q25 | NAT | 1 | 0.05 | Cache Memory and Hierarchy |
| Q26 | MCQ | 2 | A | Graph Traversals, MSTs and Shortest Paths |
| Q27 | MCQ | 2 | D | Deadlock |
| Q28 | MCQ | 2 | C | Calculus |
| Q29 | MCQ | 2 | D | Discrete Mathematics |
| Q30 | MCQ | 2 | A | Linear Algebra |
| Q31 | MCQ | 2 | B | Linear Algebra |
| Q32 | MCQ | 2 | C | Data Link Layer |
| Q33 | MCQ | 2 | B | Combinational and Sequential Circuits |
| Q34 | MCQ | 2 | D | Context-Free Grammars and PDAs |
| Q35 | MCQ | 2 | A | Recursion |
| Q36 | MCQ | 2 | C | Recursion |
| Q37 | MCQ | 2 | B | Context-Free Grammars and PDAs |
| Q38 | MCQ | 2 | A | Regular and Context-Free Languages |
| Q39 | MCQ | 2 | A | Turing Machines and Undecidability |
| Q40 | MCQ | 2 | B | Memory Management and Virtual Memory |
| Q41 | MCQ | 2 | D | Relational Model and SQL |
| Q42 | MCQ | 2 | A | Transactions and Concurrency Control |
| Q43 | NAT | 2 | 1024 | Intermediate Code Generation |
| Q44 | NAT | 2 | 11 | Network Security |
| Q45 | NAT | 2 | 88.34 | Data Link Layer |
| Q46 | NAT | 2 | 4 | Relational Model and SQL |
| Q47 | NAT | 2 | 271 | Combinatorics |
| Q48 | NAT | 2 | 5 | Searching, Sorting and Hashing |
| Q49 | NAT | 2 | -16 | Instruction Set and Addressing Modes |
| Q50 | NAT | 2 | 1.51 | Instruction Pipelining |
| Q51 | NAT | 2 | 76 | Cache Memory and Hierarchy |
| Q52 | NAT | 2 | 2 | Intermediate Code Generation |
| Q53 | NAT | 2 | 3 | Programming in C |
| Q54 | NAT | 2 | 14 | Cache Memory and Hierarchy |
| Q55 | NAT | 2 | 23 | Programming in C |
| Q56 | MCQ | 1 | C | Verbal Aptitude |
| Q57 | MCQ | 1 | D | Verbal Aptitude |
| Q58 | MCQ | 1 | C | Analytical Aptitude |
| Q59 | MCQ | 1 | D | Quantitative Aptitude |
| Q60 | MCQ | 1 | C | Quantitative Aptitude |
| Q61 | MCQ | 2 | B | Verbal Aptitude |
| Q62 | MCQ | 2 | A | Analytical Aptitude |
| Q63 | MCQ | 2 | B | Quantitative Aptitude |
| Q64 | MCQ | 2 | D | Quantitative Aptitude |
| Q65 | MCQ | 2 | C | Spatial Aptitude |
Subject-wise weightage
Where the marks came from in GATE CSE 2017 Set 1, against GATE CSE 2016 Set 1 and the average paper.
| Subject | Qs | Marks | Share | vs previous year | Avg marks / paper |
|---|---|---|---|---|---|
| GATE CSE Engineering Mathematics PYQs | 10 | 15 | 15% | +2 | 14.8 |
| GATE CSE General Aptitude PYQs | 10 | 15 | 15% | +15 | 7.4 |
| GATE CSE Programming and Data Structures PYQs | 7 | 11 | 11% | 0 | 9.5 |
| GATE CSE Theory of Computation PYQs | 6 | 10 | 10% | +1 | 6.9 |
| GATE CSE Computer Organization and Architecture PYQs | 6 | 10 | 10% | +3 | 6.8 |
| GATE CSE Computer Networks PYQs | 5 | 8 | 8% | -2 | 7.6 |
| GATE CSE Databases PYQs | 5 | 8 | 8% | +3 | 6.8 |
| GATE CSE Algorithms PYQs | 4 | 6 | 6% | -3 | 7.2 |
| GATE CSE Compiler Design PYQs | 4 | 6 | 6% | -1 | 5.2 |
| GATE CSE Operating Systems PYQs | 4 | 6 | 6% | -3 | 7.4 |
| GATE CSE Digital Logic PYQs | 4 | 5 | 5% | 0 | 5.5 |
GATE CSE 2017 Set 1 FAQ
- How many questions were in GATE CSE 2017 Set 1?
- GATE CSE 2017 Set 1 had 65 questions for 100 marks: 45 MCQ, 0 MSQ and 20 NAT.
- Which subject carried the most marks in GATE CSE 2017 Set 1?
- Engineering Mathematics carried the most marks (15 of 100). The top three were Engineering Mathematics (15), General Aptitude (15), Programming and Data Structures (11).
- Where can I find the GATE CSE 2017 Set 1 answer key?
- The answer key table on this page lists the answer to every question of GATE CSE 2017 Set 1. Open any question for its full verified solution.
- Is the GATE CSE 2017 Set 1 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.