Scribd
Upload
76 views

GATE CS Syllabus

The document provides an overview of the syllabus for a Computer Science and Information Technology program. It covers topics such as engineering mathematics, digital logic, computer organization and architecture, programming and data structures, algorithms, theory of computation, compiler design, operating systems, databases, information systems, computer networks, and web technologies. It also provides references for further study, recommending specific books and suggesting time frames for covering each topic.

Uploaded by

dennisfrancis
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as ODT, PDF, TXT or read online on Scribd
76 views

GATE CS Syllabus

The document provides an overview of the syllabus for a Computer Science and Information Technology program. It covers topics such as engineering mathematics, digital logic, computer organization and architecture, programming and data structures, algorithms, theory of computation, compiler design, operating systems, databases, information systems, computer networks, and web technologies. It also provides references for further study, recommending specific books and suggesting time frames for covering each topic.

Uploaded by

dennisfrancis
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as ODT, PDF, TXT or read online on Scribd
You are on page 1/ 4

COMPUTER SCIENCE AND INFORMATION TECHNOLOGY – CS

Syllabi --> Computer Science and Information Technology

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.

Combinatorics: 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.


References

Algorithms:

#Horowitz & Sahani – complete, exercise


(yellow coloured front page)

6hr a day * 10 days

Automata theory:

Cohen – quite easy & its good for theory as well as problems
#Martin – good for exercise problems & you can get the solutions over net
Ullman – good for theory & some critical problems & again u can get the ans & some exercise
really really important, get the approach for solutions

All three books


5hr * 10 days

Discrete mathematics:
(collect formulae, write them down on blank pages & go on pasting them over room walls, & read
them daily)

#Tata Mc - ROSEN solve as much as u can


This single book to solve 5hr * 10

Graph theory - douglas west (first 4 chapters)

Trembley & Manoher ( first 2 chapters are good)

Overall

15 days

Data organization & program control & structure first two points:

(from start to end)


#Tanenbaum (green colour) - complete
(doorway to ur all data structures related part)
(try to cover it parallely with data structure part from sahani)

8hr * 3 days
C:

Systems:

Compilers
#Ullman, sethi - Principles of compilers (esp parsers & its techniques)
(very detailed explanation of every theory)

10 hr * 4 days
Operating systems:

(also covers virtual memory , segmentation, paging, I/O systesm)


#Galvin – complete & very good for synchronization (but get the problems from net or try to solve
sync problems from different papers)

Tanenbaum – MOS(modern operating systems) very good for os examples ( paging,memory


management,cpu scheduling & utilization)

6 hr * 4 hr

Networking & distributed systems:

#Forouzan – Data communication & networking (do only networking part, & some algorithms are
sensibly explained in only this book eg “swith spanning tree”, execise problems, protocols)
Also covers Internet structures

8 hr * 2 days

#Tanenbaum – very interesting & critical for problems esp data link & network layer problems
(essential for net problems)

8 hr * 2 days

Databases:
#Navathe: good for SQL( & for general query languages) & normalization part ( it includes some
terrific techniques & tests to solve normalization problems)

5 hr * 2 days
#Korth: ER model & Transaction management

6 hr * 1 day

Computer Organization
#Zaki – pipelining & cache 10 hr * 1 day
Stallings – CPU design
Henssy patterson also

Digital logic 6 hr * 2days


Morris Mano – problems

You might also like