bySonam Rana updated Content Curator updated
GATE 2022 CS Slot 2 Question Papers and Answer Key PDFs can easily be downloaded from this page. GATE 2017 CS Slot 2 was conducted in the Afternoon Session on 11th February, 2017. The exam commenced at 2:00 PM and lasted till 5:00 PM. This year IIT Roorkee was responsible for conducting GATE 2017 CS.
GATE 2017 CS Question Paper with Answer Key PDFs - February 11 (Afternoon Session)
| GATE 2017 CS question Paper | GATE 2017 CS Answer Key |
|---|---|
| Download PDF | Download PDF |
Quick Links:
GATE 2017 CS Paper Analysis
- Like Slot 1, Programming and Data Structure was the toughest section in GATE 2017 CS Slot 2
- The weightage of easy and medium level questions was almost equivalent to each other
Below mentioned the details of GATE 2017 CS Slot 2-
| Sections | Questions 1+2 marks | Listed Topics | Difficulty Level | Carried Marks |
|---|---|---|---|---|
| Engineering Mathematics | 6 (3+3) | Linear Algebra; Probability and Distribution | Medium | 9 |
| Operating System | 5 (2+3) | Thread/Process Management; File system; Process management; CPU Scheduling; Memory management | Easy | 8 |
| Programming and Data Structure | 9 3+6) | Graph; C Programming; Stack and Queue/Linked List; C Programming; tree | Tough | 15 |
| Theory of Computation | 6 (3+3) | Context free Grammar; Regular Expression; Context free Grammar; Regular expression Finite Automata; Turing machine | Easy | 9 |
| Computer Organization and Architecture | 6 (3+3) | Introduction; Memory | Medium | 9 |
| Digital Logic | 2 (0+2) | Combinational and Sequential Digital Circuits Boolean Algebra and Karnaugh Maps | Easy | 6 |
| Theory of Computation | 5 (2+3) | Regular language, Pumping DFA, CFL,Countability | Medium | 8 |
| Discrete Mathematics and Graph theory | 5 (3+2) | Graph; Mathematical Logic; Set and Relation; Combinatorics | Easy | 7 |
| Database Management | 4 (2+2) | Transactions and Concurrency Control; ER diagrams; SQL | Medium | 6 |
| Computer Networks | 4 (3+1) | TCP/IP, UDP and Sockets, IPv4; Routing & Congestion Control; Physical Layers | Easy | 5 |
| Compiler Design | 3 (2+1) | Parsing; Introduction to Compilers | Easy | 4 |
| Design And Analysis of Algorithm | 4 (1+3) | Algorithm Analysis; Greedy Techniques | Medium | 7 |
| General Aptitude | 10 (5+5) | Numerical Ability; Verbal Ability | 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