GATE 2017 CS Question Paper and Answer Key PDFs for Slot 1 are available for GATE CS aspirants. GATE 2017 CS Slot 1 was conducted by IIT Roorkee on 11th February, 2017. IIT Roorkee listed 65 questions, carrying a total of 100 marks, and allocated 180 minutes to solve the question paper. GATE 2017 Slot 1 was held 9:00 AM to 12:00 PM. The overall difficulty level of GATE 2017 CS was rated moderate.
GATE 2017 CS Question Paper with Answer Key PDFs - February 11 (Forenoon Session)
| GATE 2017 CS question Paper | GATE 2017 CS Answer Key |
|---|---|
| Download PDF | Download PDF |
Quick Links:
GATE 2017 CS Paper Analysis
- Questions related to Programming and Data Structure were the toughest questions in the exam
- The remaining questions related to core Computer Science were rated between easy and moderate
- There were more number of easy level questions than moderate level questions in GATE 2017 CE Slot 1
Please refer to the below-mentioned table, showing the details of listed questions appeared in the question paper of GATE 2017 CS Slot 1-
| Sections | Questions 1 + 2 marks | Topics Appeared | Difficulty Level | Carried Marks |
|---|---|---|---|---|
| Engineering Mathematics | 4 (1+3) | Linear algebra; Calculus | Medium | 7 |
| Operating System | 7 (2+5) | Threads; CPU Scheduling; Memory management; Deadlock/Thread | Easy | 12 |
| Programming And Data Structure | 9 (4+5) | Trees; Linked List; C-programming; Graph | Tough | 14 |
| Theory of Computation | 6 (2+4) | Context Free Grammar; Regular Expressions; Turing machine | Easy | 10 |
| Computer Organization and Architecture | 6 (3+3) | Introduction; Instruction Set and Addressing Mode; Memory Hierarchy; Pipelining and Vector Processing | Medium | 9 |
| Digital Logic | 3 (2+1) | Introduction; Boolean Algebra and Karnaugh Maps; Combinational and Sequential Digital Circuits | Easy | 4 |
| Theory of Computation | 5 (2+3) | Regular language, Pumping DFA, CFL,Countability | Medium | 8 |
| Discrete Mathematics and Graph theory | 5 (3+2) | D-RAM, 2SCompliments, Logic gates,Boolean Functions | Easy | 7 |
| Data Base Management | 4 (2+2) | Functional Dependencies and Normalization; SQL; Relational Algebra & Relational Calculus; Transactions and Concurrency Control | Easy | 6 |
| Computer Networks | 5 (2+3) | Network Security; TCP/IP, UDP and Sockets, IP(V4; Data link layer; Network Security | Easy | 8 |
| Compiler Design | 3 (2+1) | Parsing; Intermediate Code Generation | Easy | 4 |
| Design And Analysis of Algorithm | 3 (2+1) | Algorithm analysis; Sorting Algorithm/Divide and conquer; Hashing | Medium | 4 |
| General Aptitude | 10 (5+5) | Numerical Ability; Verbal Abilit | Medium | 15 |
| Total | 65 | - | - | 100 |
Also Check:
GATE Previous Year Question Papers:
| GATE 2022 Question Papers | GATE 2021 Question Papers | GATE 2020 Question Papers |
| GATE 2019 Question Papers | GATE 2018 Question Papers | GATE 2017 Question Papers |
Comments