Previous Years’ Solved Question Papers GATE 2018 | Computer Science and Information Technology | First Edition | By Pearson

This book is one-stop solution for GATE aspirants to crack the GATE exam. The book includes previous years GATE questions segregated topic-wise along with exam analysis at the beginning of every unit. It will help the GATE aspirants to get an idea about the pattern and weightage of questions asked in GATE examination. The book also contains one free online mock test based on GATE examination pattern for practice.

Features

Includes more than 27 years GATE questions arranged chapter-wise

Detailed solutions for better understanding

Includes latest GATE solved question paper with detailed analysis

Free Online Mock test based on GATE examination pattern for practice

Table of Contents

Preface

Syllabus: Computer Science and Information Technology vii

Important Tips for GATE Preparation viii

Detailed Analysis of GATE 2017

Solved Paper GATE 2017

Detailed Analysis of GATE 2016

Solved Paper GATE 2016

Detailed Analysis of GATE 2015

Solved Paper GATE 2015

Unit 1: Theory of Computation

Chapter 1: RL, FA, RE and RG 1.3

Chapter 2: CFL and PDA 1.18

Chapter 3: CSL, RS, RES, LBA and TM 1.28

Chapter 4: Undecidability 1.33

Unit 2: Compiler Design 2.1

Chapter 1: Lexical Analysis 2.3

Chapter 2: Parsing Techniques 2.6

Chapter 3: Syntax Directed Translation 2.17

Chapter 4: Code Generate d and Optimization 2.20

Unit 3: Database Management System 3.1

Chapter 1 ER Diagrams 3.3

Chapter 2 Functional Dependencies and Normalization 3.6

Chapter 3 Structure Query Language 3.13

Chapter 4 Relational Algebra and Relational Calculus 3.24

Chapter 5 Transactional and Concurrency Control 3.31

Chapter 6 File Structure an Indexing 3.37

Unit 4: Computer Networks 4.1

Chapter 1: Fundamental and SWP 4.3

Chapter 2: Local Area Network 4.6

Chapter 3: TCP/IP 4.9

Chapter 4: Application Layer and Routing Algorithm 4.17

Unit 5: Operating System 5.1

Chapter 1: Process Management–I 5.3

Chapter 2: Process Management–II 5.13

Chapter 3: Deadlock 5.28

Chapter 4: Memory Management 5.33

Chapter 5: File System and Device Management 5.46

Unit 6: Design and Analysis of Algorithms 6.1

Chapter 1 Algorithm Analysis and Asymptotic Notations 6.3

Chapter 2: Divide and Conquer 6.13

Chapter 3: Greedy Method 6.22

Chapter 4: Dynamic Programming 6.32

Chapter 5: P and NP Concepts 6.36

Chapter 6: Optimal Binary Search Tree 6.40

Chapter 7: Miscellaneous Topics 6.42

Unit 7: Data Structures 7.1

Chapter 1: Array 7.3

Chapter 2: Stacks and Queues 7.6

Chapter 3: Linked List 7.14

Chapter 4: Trees 7.18

Chapter 5: Graphs 7.36

Chapter 6: Hashing 7.40

Unit 8: Programming Languages 8.1

Chapter 1: Programming Language Concepts 8.3

Chapter 2: Programming in C (Part I) 8.15

Chapter 3: Programming in C (Part II) 8.24

Unit 9: Digital Logic 9.1

Chapter 1: Number Systems 9.3

Chapter 2: Boolean Algebra 9.6

Chapter 3: K-Maps 9.15

Chapter 4: Combinational Circuits 9.19

Chapter 5: Sequential Circuits 9.23

Unit 10: Computer Organization 10.1

Chapter 1: Computer Arithmetic 10.3

Chapter 2: Memory Organization 10.8

Chapter 3: Pipeline 10.17

Chapter 4: CPU Organization 10.23

Chapter 5: Control Unit Design 10.30

Chapter 6: I/O Organization 10.32

Chapter 7: Secondary Memories 10.36

Chapter 8: Register Allocation 10.39

Unit 11: Software Engineering 11.1

Chapter 1: Software Engineering 11.3

Unit 12: Web Technologies 12.1

Chapter 1: Web Technologies 12.3.