Is GATE syllabus same for CSE and IT? If yes, Give the detailed syllabus for GATE 2012? Suggest me some prescribed books for it.

Related:

• How often does the syllabus of GATE changes?
• Suggest good study material for GATE(Aeronautical engineering) exam? What is the syllabus for GATE Aeronautical engineering?
• Reference books for GATE exam (Computer Science).
• Can anyone tell me about Masters in Tele Communication engineering after completing BCS course?
• Suggest the best book for GATE Exam? Leave your comment about RK Jain's and RS Agarwal's GATE Study Materials?
• What is the procedure to get admission in IIT through GATE?What is the GATE syllabus for Computer Science students? How to get admission after scoring above 96%ile in GATE? How to prepare for GATE to get good Percentile? Important dates of GATE Exam?
• Syllabus for GATE(ECE)?
• I attempted GATE this year but secured 17K rank I wish to attempt GATE once again, meanwhile I would also like to attempt IES exam. Should I join GATE coaching or IES coaching?
• Suggest good books for GATE preparation?
• Can one do M.Tech in petroleum engineering after B.Tech in Petroleum Engineering? Why there is no syllabus prescribed for Petroleum engineers separately in GATE notification?
• Is it possible to crack GATE without coaching and be eligible for admissions in IITs? Is 6 months of time sufficient to crack GATE?
• When to start preparation for GATE -14? Suggest few books related to GATE.
• What is the syllabus for GATE - 2013?
• What is the the syllabus of GATE examination for a M.Sc Mathematics student?
• Is it sufficient to stick with only the syllabus of GATE in order to surely crack this exam? If not. Should I brush up all the topics in that particular paper?
• Complete reference for Manufacturing engineering syllabus of GATE.
• Syllabus for GATE(Mechanical)?
• Am I eligible for M.Tech in IIT after completing MCA from Pune? Tell the required criterion for GATE? Suggest good books for GATE preparation.
• When the exam notification for M.Tech course will get released?
• Best option between GATE and Bank PO exam after B.Tech (CSE)?

yes both have same syllabus.some important books for computer science for GATE preparation-

1 introduction to algorithm by cormen.
2 Data structure and algorithm analysis in c++by Allen weiss
3 computer simulation by Roger Mchaney
4 An introduction to relational data base theory by Hugh drwen
5 computer architecture by william.
6 computer network by Andrew ST.
7 engineering mathematics by BS Grewal.

these books are refered by an coaching institute,you can choose different books according to your convenience . according to me you should prefer those books which are text books in your college.it will help you in preparation+you will get good marks in your engineering.

Yes, the syllabus is same for both streams.

GATE Syllabus for CSE/IT:

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.

Best books for GATE:

Mathematical Logic: Discrete Mathematics by Tremblay Manohar, Probability , statistics and queuing theory by S.C.Gupta & V.K.Kapoor

Linear Algebra: Higher Engineering Mathematics by B.S. Grewal

Numerical Methods: S.S. Sastry

Analysis of Algorithms and Computational Complexity: Introduction to algorithms - Cormen etal

Computer Algorithms - Horowitz and Sahani

Hello Friend

Yes, the syllabus for the Computer Science Engineering and Information Technology is same as one for the GATE (Graduate Aptitude Test in Engineering) exam.

According to the GATE 2012 the syllabus for the Computer Science Engineering and Information Technology includes :

1. Digital Logic :
Logic functions, Minimization, Design and Synthesis of Combinational and Sequential Circuits, Number representation and Computer Arithmetic.

2. Computer Organization and Architecture :
Machine instructions and addressing modes, ALU and data-path, CPU control Design, Memory interface, I/O interface, Instruction pipelining and main memory, Secondary storage.

3. 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.

4. Algorithms :
Analysis, Asymptotic notation, Worst and average case analysis, Design : Greedy approach, Dynamic programming, Divide and Conquer, Tree and Graph traversals, connected components, spanning trees, shortest paths, NP-Complete.

5. Theory of Computation :
Regular languages and finite automata, Context free languages and Push down automata, Recursively enumerable sets and turning machines, Undecidability.

6. Compiler Design :
Lexical analysis, Parsing, Syntax directed translation, Runtime environments, Intermediate and Target code generation, Basics of code optimization.

7. Operating System :
Processes, Threads, Inter-process, Communication, Concurrency, Synchronization, Deadlock, CPU scheduling, Memory management and Virtual memory, File systems.

8. Databases :
ER-model, Relational model, Query languages, File structure, Transactions and Concurrency control.

9. Information systems and Software Engineering :
Information gathering, requirement and feasibility analysis, data flow diagrams, process specifications, planning and managing the project, design, coding, testing,maintenance.

10. Web Technologies :
HTML, XML, basics concepts of client server computing.

11. Computer Networks :
ISO/OSI stack, LAN technologies flow and error control technologies, Routing algorithms, Congestion control, TCP/UDP and Sockets, Firewalls, Gateways and Routers, Network security basic concepts of public key and private key cryptography, Digital signature.


So these are the total syllabus for GATE exam, dude you go through and start your preparation for the next GATE exam, and there are many authors publications where you will be getting the best concepts like

1. Arihant publications
2. Made Easy publications
3. G.K.publications

So dude for any further information you can leave your message here.

Regards.

Originally Posted by leheri

is gate syallbus same for CSE and IT? if so please send me the detail syallabus for gate 2012..and please suggest me some prescribed books for it

hello friend...

YES..... the GATE syllabus is same for CSE and IT


GATE syllabus for CSE and IT

**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


**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

**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

**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


**Web technologies**

HTML

XML

basic concepts of client-server computing.


all the best...!!!

GATE eligibility criteria:-

To give the GATE exam you need to have a degree in technology, engineering or architecture. Even final year students can apply for this exam.
Its important to have minimum 55-60% marks at graduation level.

Master degree holder with a degree in science, mathematics, computer science or statistics are also eligible to give this exam.

There is no age bar for giving this exam and your GATE score will be valid for two years.

At the most you can give this exam for three times.

Here i have attached the pdf containing the full syllabus of the computer science for GATE entrance exam. Please go through it properly.

HELLO DEAR!!!!!!
YES!! The syllabus is common but not same fo both cse and it branches

To give the GATE exam you need to have a degree in technology, engineering or architecture. Even final year students can apply for this exam.
Its important to have minimum 55-60% marks at graduation level.

Master degree holder with a degree in science, mathematics, computer science or statistics are also eligible to give this exam.

There is no age bar for giving this exam and your GATE score will be valid for two years.

At the most you can give this exam for three times.
The syllabus includres:
1. Digital Logic :

2. Computer Organization and Architecture :


3. Programming and Data Structures :

4. Algorithms :


5. Theory of Computation :


6. Compiler Design :


7. Operating System :


8. Databases :


9. Information systems and Software Engineering :


10. Web Technologies :


11. Computer Networks :

Hello friend,
GATE syllabus is different for both branches CSE and IT.

GATE syllabus for CSE

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 ENGINEERING

Theory of Computation: Regular languages and finite automata, Context free languages and Push-down automata, Recursively enumerable sets and Turing machines, Undecidability; NPcompleteness.
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.
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.
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.

yes cse and IT are same.The best book for GATE is GK publications..The syllabus is attached to this..

List of the Best Books name for GATE exam :-


GATE 2012: Computer Science & Information Technology (With CD)
Author: Gk


GATE 2012: Computer Science & IT Topicwise Previous Solved Papers & Practice Papers
Author: Made Easy Team


GATE Computer Science & Information Technology
Author: S. Jaiswal


GATE Computer Science & Engineering
Author. P. Nagpal

I have attached the Syllabus so please check it now........

.

hi,friend
No.Computer science engineering and IT engineering syllabus is not same for GATE.
you can download the syllabus for any branch for GATE from site:
www.gateforum.com
If you want to prepare nicely ,then 1st of all,you should have to read the syllabus clearly and clear the topic by topic from your engineering refrence book.After the reading topic you should have practice from gate preparation book which is available in market.you can also do practice from some tution material.it will help to learn very nicely.
If you prepare such a way,then you can prepare very nicely and clear the topic entirely.then you can very nicely attend any quastion in the GATE exam.
If you prepare directly from Gate preparation book,then in the Gate exam if question is littele twist,then you have trouble that question to attend.so 1st prepare from referance book and the practice from gate preparation book.it will be more comfortable for you to prepare for GATE very nicely.

best of luck....

DEAR FRIEND,
THE GATE SYLLABUS IS SAME FOR BOTH CSE AND IT DISIPLINES.THE GATE 2012 HAD ALREADY FINISHED AND NOW ITS TIME TO MOVE ON FOR GATE-2013, PREPARE FROM NOW ONWARDS TO SECURE GOOD RANK.
REGARDS

dear,
yes the CSE and IT courses are same in GATE exam. course is as following,

1. Digital Logic
2. Computer Organization and Architecture
3. Programming and Data Structures
4. Algorithms
5. Theory of Computation
6. Compiler Design
7. Operating System
8. Databases
9. Information systems and Software Engineering
10. Web Technologies
11. Computer Networks.

hi,
Gate syllabus for cse and it is same.
introduction to algorithm by cormen.
2 Data structure and algorithm analysis in c++by Allen weiss
3 computer simulation by Roger Mchaney
4 An introduction to relational data base theory by Hugh drwen
5 computer architecture by william.
6 computer network by Andrew ST.
7 engineering mathematics by BS Grewal.
Thanks

Yes it is true that the syllabus for computer science and information technology is same.

The detailed syllabus for this is as follows:-

>>ENGINEERING MATHEMATICS

@Mathematical Logic
@Probability
@Set theory and Algebra
@Combinations and Permutations
@Graph Theory
@Calculus

>>COMPUTER SCIENCE AND INFORMATION TECHNOLOGY

@Digital Logic
@Computer Organization and Architecture
@Programming and Data structure
@Algorithms
@Theory of Computation
@Compiler Design
@Operating System
@Databases
@Information systems and software Engineering
@Computer Networks
@Web Technologies


BOOKS RELATED TO TOPICS ARE:-

>>Introduction to Algorithms - Cormen
>>Data structure and Algorithm Analysis In C++ - Allen Weiss
>>Understanding Computer simulation - Roger McHaney
>>Database - Dr S.K.Singh
>>Computer Architecture - Dr William Schildt(pearson edition)
>>Computer Networks - Tanenbaum
>>Data Structure Using C and C++ - Allen Weiss
>>Operating system - D.M.Dhamdhere

dear friend,

If you want to prepare nicely ,then 1st of all,you should have to read the syllabus clearly and clear the topic by topic from your engineering refrence book.After the reading topic you should have practice from gate preparation book which is available in market.you can also do practice from some tution material.it will help to learn very nicely.
If you prepare such a way,then you can prepare very nicely and clear the topic entirely.then you can very nicely attend any quastion in the GATE exam.

GATE eligibility criteria:-

To give the GATE exam you need to have a degree in technology, engineering or architecture. Even final year students can apply for this exam.
Its important to have minimum 55-60% marks at graduation level.
Master degree holder with a degree in science, mathematics, computer science or statistics are also eligible to give this exam.
There is no age bar for giving this exam and your GATE score will be valid for two years.
At the most you can give this exam for three times.

The syllabus includres:
Digital Logic

Computer Organization and Architecture


Programming and Data Structures


Compiler Design


Operating System


Databases


Information systems and Software Engineering


Web Technologies


Algorithms


Theory of Computation

best of luck

No friend, syllabus of GATE for CSE and IT is not same.

Syllabus of GATE for IT-

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.

FORMAL LANGUAGES AND AUTOMATA

Regular Languages: finite automata, regular expressions, regular grammar.
Context free languages: push down automata, context free grammars

COMPUTER HARDWARE

Digital Logic: Logic functions, minimization, design and synthesis of combinatorial and
sequential circuits, number representation and computer arithmetic (fixed and floating point)
Computer organization: Machine instructions and addressing modes, ALU and data path,
hardwired and microprogrammed control, memory interface, I/O interface (interrupt and DMA
mode), serial communication interface, instruction pipelining, cache, main and secondary storage

SOFTWARE SYSTEMS

Data structures and Algorithms: the notion of abstract data types, stack, queue, list, set, string,
tree, binary search tree, heap, graph, tree and graph traversals, connected components,
spanning trees, shortest paths, hashing, sorting, searching, design techniques (greedy, dynamic,
divide and conquer, Algorithm design by induction), 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.
Programming Methodology: Scope, binding, parameter passing, recursion, C programming –
data types and declarations, assignment and control flow statements, 1-d and 2-d arrays,
functions, pointers, concepts of object-oriented programming - classes, objects, inheritance,
polymorphism, operator overloading.
Operating Systems (in the context of Unix): classical concepts (concurrency, synchronization,
deadlock), processes, threads and interprocess communication, CPU scheduling, memory
management, file systems, I/O systems, protection and security, shell programming.
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.
Databases: E-R diagrams, relational model, database design, integrity constraints, normal forms,
query languages (SQL), file structures (sequential, indexed), b-trees, transaction and concurrency
control.
Data Communication and Networks: ISO/OSI stack, transmission media, data encoding,
multiplexing, flow and error control, LAN technologies (Ethernet, token ring), network devices –
switches, gateways, routers, ICMP, application layer protocols – SMTP, POP3, HTTP, DNS, FTP,
Telnet, network security – basic concepts of public key and private key cryptography, digital
signature, firewalls
Web technologies: Proxy, HTML, XML, basic concepts of cgi-bin programming.

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.