Gate 2018 Syllabus For Computer Science And Information Technology (CS)

Gate 2018 Syllabus for Computer Science And Information Technology (CS)

ENGINEERING MATHEMATICS

Mathematical Logic: Propositional Logic; First Order Logic.

Probability: Conditional Probability; Mean, Median, Mode And Standard Deviation; Random Variables; Distributions; Uniform, Normal, Exponential, Poisson, Binomial.

Set Theory & Algebra: Sets; Relations; Functions; Groups; Partial Orders; Lattice; Boolean Algebra.

Combinatory: Permutations; Combinations; Counting; Summation; Generating Functions; Recurrence Relations; Asymptotics.

Graph Theory: Connectivity; Spanning Trees; Cut Vertices & Edges; Covering; Matching; Independent Sets; Colouring; Planarity; Isomorphism.

Linear Algebra: Algebra Of Matrices, Determinants, Systems Of Linear Equations, Eigen Values And Eigen Vectors.

Numerical Methods: Lu Decomposition For Systems Of Linear Equations; Numerical Solutions Of Non-Linear Algebraic Equations By Secant, Bisection And Newton-Raphson Methods; Numerical Integration By Trapezoidal And Simpson’s Rules.

Calculus: Limit, Continuity & Differentiability, Mean Value Theorems, Theorems Of Integral Calculus, Evaluation Of Definite & Improper Integrals, Partial Derivatives, Total Derivatives, Maxima & Minima.

COMPUTER SCIENCE AND INFORMATION TECHNOLOGY

Digital Logic: Logic Functions, Minimization, Design And Synthesis Of Combinational And Sequential Circuits; Number Representation And Computer Arithmetic (Fixed And Floating Point).

Computer Organization And Architecture: Machine Instructions And Addressing Modes, ALU And Data-Path, CPU Control Design, Memory Interface, I/O Interface (Interrupt And DMA Mode), Instruction Pipelining, Cache And Main Memory, Secondary Storage.

Programming And Data Structures: Programming In C; Functions, Recursion, Parameter Passing, Scope, Binding; Abstract Data Types, Arrays, Stacks, Queues, Linked Lists, Trees, Binary Search Trees, Binary Heaps.

Algorithms: Analysis, Asymptotic Notation, Notions Of Space And Time Complexity, Worst And Average Case Analysis; Design: Greedy Approach, Dynamic Programming, Divide-And-Conquer; Tree And Graph Traversals, Connected Components, Spanning Trees, Shortest Paths; Hashing, Sorting, Searching. Asymptotic Analysis (Best, Worst, Average Cases) Of Time And Space, Upper And Lower Bounds, Basic Concepts Of Complexity Classes – P, NP, NP-Hard, NP-Complete.

Theory Of Computation: Regular Languages And Finite Automata, Context Free Languages And Push-Down Automata, Recursively Enumerable Sets And Turing Machines, Undecidability.

Compiler Design: Lexical Analysis, Parsing, Syntax Directed Translation, Runtime Environments, Intermediate And Target Code Generation, Basics Of Code Optimization.

Operating System: Processes, Threads, Inter-Process Communication, Concurrency, Synchronization, Deadlock, CPU Scheduling, Memory Management And Virtual Memory, File Systems, I/O Systems, Protection And Security.

Databases: ER-Model, Relational Model (Relational Algebra, Tuple Calculus), Database Design (Integrity Constraints, Normal Forms), Query Languages (SQL), File Structures (Sequential Files, Indexing, B And B+ Trees), Transactions And Concurrency Control.

Information Systems And Software Engineering: Information Gathering, Requirement And Feasibility Analysis, Data Flow Diagrams, Process Specifications, Input/Output Design, Process Life Cycle, Planning And Managing The Project, Design, Coding, Testing, Implementation, Maintenance.

Computer Networks: ISO/OSI Stack, LAN Technologies (Ethernet, Token Ring), Flow And Error Control Techniques, Routing Algorithms, Congestion Control, TCP/UDP And Sockets, IP(V4), Application Layer Protocols (Icmp, Dns, Smtp, Pop, Ftp, Http); Basic Concepts Of Hubs, Switches, Gateways, And Routers. Network Security – Basic Concepts Of Public Key And Private Key Cryptography, Digital Signature, Firewalls.

Web Technologies: HTML, XML, Basic Concepts Of Client-Server Computing.