The Gateway to Computer Science Excellence
2,467 views

CS  Computer Science and Information Technology



Section1: Engineering Mathematics   
Discrete Mathematics: Propositional and first order logic. Sets, relations, functions, partial
orders and lattices. Groups. Graphs: connectivity, matching, coloring. Combinatorics:
counting, recurrence relations, generating functions.
Linear Algebra: Matrices, determinants, system of linear equations, eigenvalues  and
eigenvectors, LU decomposition.
Calculus: Limits, continuity and differentiability. Maxima and minima. Mean value
theorem. Integration.
Probability: Random variables. Uniform, normal, exponential, poisson and binomial
distributions. Mean, median, mode and standard deviation. Conditional probability and
Bayes theorem.



Section 2: Digital Logic
Boolean  algebra. Combinational and sequential circuits. Minimization. Number
representations and computer arithmetic (fixed and floating point).



Section 3: Computer Organization and Architecture
Machine instructions and addressing modes. ALU, data‐path and control unit. Instruction
pipelining. Memory hierarchy: cache, main memory and secondary storage; I/O
interface (interrupt and DMA mode).



Section 4: Programming and Data Structures
Programming in C. Recursion. Arrays, stacks, queues, linked lists, trees, binary search
trees, binary heaps, graphs.  



Section 5: Algorithms
Searching, sorting, hashing. Asymptotic worst case time and space complexity.
Algorithm design techniques: greedy, dynamic programming and divide‐and‐conquer.
Graph search, minimum spanning trees, shortest paths.



Section 6: Theory of Computation
Regular expressions and finite automata. Context-free grammars and push-down
automata. Regular and contex-free languages, pumping lemma. Turing machines and
undecidability.  



Section 7: Compiler Design
Lexical analysis, parsing, syntax-directed translation. Runtime environments. Intermediate
code generation.



Section 8: Operating System
Processes, threads, inter‐process communication, concurrency and synchronization.
Deadlock. CPU scheduling. Memory management and virtual memory. File systems.


Section 9: Databases
ER‐model. Relational model: relational algebra, tuple calculus, SQL. Integrity constraints,
normal forms. File organization, indexing (e.g., B and B+ trees). Transactions and
concurrency control.



Section 10: Computer Networks
Concept of layering. LAN technologies (Ethernet). Flow and error control techniques,
switching. IPv4/IPv6, routers and routing algorithms (distance vector, link state). TCP/UDP
and sockets, congestion control. Application layer protocols (DNS, SMTP, POP, FTP, HTTP).
Basics of Wi-Fi. Network security: authentication, basics of public key and private key
cryptography, digital signatures and certificates, firewalls.

posted Dec 27, 2016 in Preparation Advice by Boss (32,465 points)
edited Dec 27, 2016 by | 2,467 views
0
Like
0
Love
0
Haha
0
Wow
0
Angry
0
Sad

51 Comments

btw it was removed 1 year ago.
it was not in gate2016 syllabus.
Thanks for posting syllabus nearly 1 month before exam.

Many thanks Shiva :) it is always better late than never !

read this below link to know what is in and what Not in  the syllabus. 

http://gatecse.in/gate-cse-2016-syllabus/

NO.
wow!  what a time to wake up!
The syllabus thing is mentioned through out the site also as in front page and in categories. When I gave GATE in 2010 I didn't know that it had a syllabus, so knowing even 1 month before is good :)

@shiva If you spend good time with previous year questions in next one month you can easily get to IIT. But you seem more interested in other questions which are relevant for ISRO/NET etc but not for GATE.
it's more like a satire for all those who are still asking in fb group whether software engineering is removed or not :-)
Is P-NP in syllabus?

removed from algo but present in toc @ KISHALAY DAS

 

But complexity theory is not there in the above syllabus
how to improve in CO?? i am scared of it. Any tips??
CO is always unpredictable how much you prepare it.
In databases,there were some questions on Joins implementation, like nested,block nested,merge,hash join types and numericals on it. But as per syllabus query optimization is not there.Is anyone aware if its there?There are many deep concepts on that topic.
Same doubt. so many such questions in made easy tests too. Is it in gate syllabus?

@sushmita 

Computer Architecture questions are conceptual hence unpredictable .

But you need to be prepare  for yourself , there are 2 good books 

1 Morris m mano 

2 Zaki - hamacher 

for second book chapter 2 ( instructions and addressing modes ) , 5 ( cache memory )  and 8 ( pipeline )  you must read . And try to solve these chapters exercise questions, solution manuals you can found by google them like for chapter 8  . After that solve Gate questions based on these 3 topics , there are lots of conceptual questions over pipeline that asked in Gate you can check their solutions in GO. That much you can do .

 

@surajit

In databases,the questions on Joins implementation, like nested,block nested,merge,hash join types are NOT there in syllabus.

Take Gate questions and see what they asked and from which topics they asked, Gate questions are The Standard  , Not those ME questions where to fill their slots they ( read unplaced boys) can scribe anything which is available in internet and people think that they ask some HIGHER LEVEL questions !!

Also  query optimization  is not there in syllabus.

In Joins you have to read - Cross join , Inner ( equi and natural) & outer join( left, right, full) , and self join .

thanx Bikram sir. I am doing hamacher.

 Sir can u plz tell is 4nf and 5nf worth studying for gate??  are they in syllabus?
@kishalay

you need to know basics of complexity theory like what is P, NP, Np hard , Np complete

what are meaning of these terms and how they are related with each other.

Few real world problems that comes under them etc( know the problem description and how they comes under that particular class is matter of concern).

Read peter linz last chapter for that.
Thank You
Bikram Sir in operating system in the disk based problems i am facing big problem so where should i study to know the real concepts and formulaes of disk
@ bikram sir, all problems like SAT, clique etc have to be studied??? But P and Np is removed from syllabus?? And if it is TOC, does it imply reading all this?? plzz clear sir.
4 NF and 5 NF comes uder normalization , though i have not seen any questions i think only basic idea you should have like what is the definition of 4NF and 5 NF with an example .

@madhab

operating system the disk based problems: 

Read stallings chapter 11 --> Go to page 540 in stallings and read page number 540 to 543 .

stalling have solved problems in page 508 to 510 also see stalling page number 543 for diagram of a disk.

 

Also in galvin page 452  page 452 and 453 .

Now in GO search with the tag disk scheduling  and solve those problems.

@sushmita

those problems like SAT, clique are not in syllabus so right now for gate you no need to study , later read them.

And i specify exactly what need to read in P, NP , stick to it now .
thanx sir. U mean only reduction part in that??

Read peter linz last chapter " An overview of computational complexity " page number 343 to 360

This book https://books.google.co.in/books?id=KOo4NpfTEAIC&printsec=frontcover&source=gbs_ge_summary_r&cad=0#v=onepage&q&f=false

Hope everything is clear now.

 

Vikram Sir i want to tell you i have problems with these type of problems of disk like disk block size i given and we have to find the file size http://gateoverflow.in/2149/gate2012_41

and http://gateoverflow.in/43477/gate2009-52

types of problem

Thank you

okay sir, thanx a lot.
@madhab read stallings for that , i mention chapter no 11 and page number also.

For those question solutions are given .
are triggers in sql in dbms in gate syllabus??
@ bikram sir, if  possible shed some light on what to study in file system for gate??
Yes from trigger 1 question came in CS 2014.

i have seen 1 qstn from multivalued dependency and 4NF so read it.

 

For files system read stallings , i mentioed in my above comments chapter 11 and page number also.
Hi Sir,

Are the following in syllabus?

1. Network topology

2. Horizontal and vertical microprogramming
yes in network you have to know Network topology like Bus, ring etc just overview

and in COA  Horizontal and vertical microprogramming in CPU design you have to know.
bikram sir, is concurrent programming using cobegin-coend , par-begin-end etc in syllabus??
NO it is not
thanx a lot sir.
@ Bikram sir Shall we read monitors for gate??
@ Bikram sir, which book exercise questions we should do for computer networks subject?
Bikram sir, how much marks calculus come in exam?? Is it worth spending time on tat??
aha! probably bikram sir, is having the longest interview of his life !
happy new year uddipto :D
@aushi

solve first past years gate network questions , almost same type they repeat

and for book kurose and farauzan you solve , farauzan soln manual is available...
@sushmita

Monitors you can skip

for calculus just download habib's notes and solve past year qstns :)
Thank you sir.

 

And sir for Queries in database, how to do?
for sql korth is best book , read it and solve all prev gate papers ..
@Bikram,please tell where can we get the notes
Thank you sir.
Sir where are habib's sir notes?

Plz give the link.

Sir in network I was solving Tannenbaum. It is okay? Sir especially in cryptography it's given too much and it's hard to memorize all that. Facing difficulties
I also want Habib sirs notes. He is great
Thank you..I have posted some of them in gate computer science group of fb
send the link please
Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,648 questions
56,459 answers
195,335 comments
100,190 users