Scribd
Upload
499 views2 pages

Gate 2016 Cse Syllabus

The document provides an overview of topics covered in computer science and information technology including mathematics, algorithms, theory of computation, computer architecture, programming, databases, operating systems, computer networks, and web technologies. Key areas discussed are logic, probability, algorithms, data structures, automata theory, compiler design, computer organization, OS concepts like processes and memory management, database design, software engineering principles, network protocols, and basic web technologies.

Uploaded by

rahulrixx
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as TXT, PDF, TXT or read online on Scribd
499 views2 pages

Gate 2016 Cse Syllabus

The document provides an overview of topics covered in computer science and information technology including mathematics, algorithms, theory of computation, computer architecture, programming, databases, operating systems, computer networks, and web technologies. Key areas discussed are logic, probability, algorithms, data structures, automata theory, compiler design, computer organization, OS concepts like processes and memory management, database design, software engineering principles, network protocols, and basic web technologies.

Uploaded by

rahulrixx
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as TXT, PDF, TXT or read online on Scribd
You are on page 1/ 2

1.

COMPUTER SCIENCE AND INFORMATION TECHNOLOGY


Engineering Mathematics

CS & IT

Mathematical Logic: Propositional Logic; First Order Logic.


Probability: Conditional Probability; Mean, Median, Mode and Standard Deviation;
Random Variables; Distributions; uniform, normal, exponential, Poisson, Binomia
l.
Set Theory & Algebra: Sets; Relations; Functions; Groups; Partial Orders; Lattic
e; Boolean Algebra.
Combinatorics: Permutations; Combinations; Counting; Summation; generating funct
ions; recurrence relations; asymptotics.
Graph Theory: Connectivity; spanning trees; Cut vertices & edges; covering; matc
hing; 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 s
olutions of non-linear algebraic equations by Secant, Bisection and Newton-Raphs
on Methods; Numerical integration by trapezoidal and Simpson's rules.
Calculus: Limit, Continuity & differentiability, Mean value Theorems, Theorems o
f integral calculus, evaluation of definite & improper integrals, Partial deriva
tives, Total derivatives, maxima & minima.
GENERAL APTITUDE(GA):
Verbal Ability: English grammar, sentence completion, verbal analogies, word gro
ups, instructions, critical reasoning and verbal deduction.
Computer Science and Information Technology
Digital Logic: Logic functions, Minimization, Design and synthesis of combinatio
nal and sequential circuits; Number representation and computer arithmetic (fixe
d and floating point).
Computer Organization and Architecture: Machine instructions and addressing mode
s, ALU and data-path, CPU control design, Memory interface, I/O interface (Inter
rupt and DMA mode), Instruction pipelining, Cache and main memory, Secondary sto
rage.
Programming and Data Structures: Programming in C; Functions, Recursion, Paramet
er 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 tr
ees, Shortest paths; Hashing, Sorting, Searching. Asymptotic analysis (best, wor
st, 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 langu
ages and Push-down automata, Recursively enumerable sets and Turing machines, Un
decidability.
Compiler Design: Lexical analysis, Parsing, Syntax directed translation, Runtime
environments, Intermediate and target code generation, Basics of code optimizat

ion.
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), Data
base design (integrity constraints, normal forms), Query languages (SQL), File s
tructures (sequential files, indexing, B and B+ trees), Transactions and concurr
ency control.
Information Systems and Software Engineering: information gathering, requirement
and feasibility analysis, data flow diagrams, process specifications, input/out
put design, process life cycle, planning and managing the project, design, codin
g, testing, implementation, maintenance.
Computer Networks: ISO/OSI stack, LAN technologies (Ethernet, Token ring), Flow
and error control techniques, Routing algorithms, Congestion control, TCP/UDP an
d sockets, IP(v4), Application layer protocols (icmp, dns, smtp, pop, ftp, http)
; Basic concepts of hubs, switches, gateways, and routers. Network security basi
c concepts of public key and private key cryptography, digital signature, firewa
lls.
Web technologies: HTML, XML, basic concepts of client-server computing.

You might also like