#1
17th January 2011, 05:23 PM




Syllabus of GATE for CSE and IT stream?
What is the Syllabus of GATE for computer science and enginnering(IT)?

#2
17th January 2011, 06:22 PM




Re: Syllabus of GATE for CSE and IT stream?
Hi,
Plz find the attachment. Wish you best of luck. 
#3
17th January 2011, 06:31 PM




Re: Syllabus of GATE for CSE and IT stream?
HI THIS THE GATE SYLLABUS FOR CS AND IT.AND I WISH I HAVE Helped you out with your query

#4
17th January 2011, 07:00 PM




Re: Syllabus of GATE for CSE and IT stream?
Well friend,
Preparing for Gate Exam and searching for Syllabus for Computer science and Engineering. Structure of the Gate paper consists of 3 hrs duration with 60 questions. You have to opt for your own paper which is selected through Gate Application form This year On 13 february Gate Exam is there. I have attached a file which is having Syllabus for CSE. Note: Try to answer only those questions which you are confident enough because There is negative marking for wrong answers. 
#5
17th January 2011, 07:21 PM




Re: Syllabus of GATE for CSE and IT stream?
Quote:
i am attached the syllabus of computer science.study the according to the syllabus and prepare for the exam.don't study last minute.it's not good. And see the previous papers also it is very useful to you. all the best......... 
#6
17th January 2011, 07:31 PM




Re: Syllabus of GATE for CSE and IT stream?
Graduate Aptitude Test for Engineering(GATE) For Computer Science Engineering Syllabus
It consists of *Mathematic *Aptitude *English Grammar *Technical Question Totally it consists of 65 question and total mark is 100 Upload Syllabus for CSE All the Best 
#7
17th January 2011, 08:33 PM




Re: Syllabus of GATE for CSE and IT stream?
Syllabus for Computer Science And Engineering GATE exam is as follows:
1) CSComputer Science and Engineering 2) ENGINEERING MATHEMATICS 3) Mathematical Logic: Propositional Logic; First Order Logic. 4) Probability: Conditional Probability; Mean, Median, Mode and Standard Deviation; 5) Random Variables; Distributions; uniform, normal, exponential, Poisson, Binomial. Also i am attaching pdf file which contains detail syllabus.So you can refer it too. 
#8
17th January 2011, 09:09 PM




Re: Syllabus of GATE for CSE and IT stream?
GATE Syllabus for Computer Science & 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. Combinatorics: ermutations; 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 nonlinear algebraic equations by Secant, Bisection and NewtonRaphson 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 datapath, 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, Divideandconquer; 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, NPhard, NPcomplete. Theory of Computation: Regular languages and finite automata, Context free languages and Pushdown 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, Interprocess communication, Concurrency, Synchronization, Deadlock, CPU scheduling, Memory management and virtual memory, File systems, I/O systems, Protection and security. Databases: ERmodel, 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 clientserver computing. 
#9
17th January 2011, 09:12 PM




Re: Syllabus of GATE for CSE and IT stream?
GATE 2011 for CSE/IT
BASIC MATHEMATICS: Elements of probability, matrix algebra, numerical methods: interpolation, root finding, differentiation and integration. Discrete mathematics: sets, relations, functions, mathematical induction, counting, groups, graphs, partial orders, lattices and boolean algebra, propostional logic. THEORY OF COMPUTATION: Regular and context free languages, finite state machines and push down automata, turing machines and undecidability. COMPUTER HARDWARE: Logic function, minimization techniques, design of combinational and sequential circuits using gates and flipflops, design with integrated circuts incuding ROM and multiplexers, microprocessor architecture: programming, interfacing with memory and I/O devices(modes of data transfer and their implementation, serial and parallel communication interface). Detailed knowledge of 8085 microprocessor will be assumed. COMPUTER ORGANIZATION: Number representation and airthmetic, functional organization, machine instructions and addressing modes, ALU, hardwired and microprogrammed control, instrucation pipelining, memory organization, input/output. PROGRAMMING AND DATA STRUCTURE: structured programmming with pascal/C including recursion; arrays, stacks, strings, queues, lists, trees, sets and graphs; algorithm for tree and graphs traversals, connected component, spanning trees, shortest paths; hashing, sorting and searching algorithm design and analysis techniques, big 'oh' notation, solution of sample recurrence relations. LANGUAGE PROCESSOR: Assembler, loader, linker, macroprocessors, text editors, programming languages, scope rules and parameter passing mechanism; compilers lexical analysis, parsing, syntax, directed translation, run time environment, machine code generation; interpreters. OPERATING SYSTEM: Batch, multiprogramming and timesharing systems; processsor, memory, device and file management, virtual memory, process scheduling, interprocess communication, process synchoronization and concurrency, deadlocks, protection. DATABASE SYSTEM: File organization techniques; indexing,Btrees, Bplus trees; relational and network datat models; normal forms; query language: SQL. 
#10
17th January 2011, 09:12 PM




Re: Syllabus of GATE for CSE and IT stream?
Quote:
i am attaching a file 'cs gate syllabus' which contains the syallabus of cs\it for the exam GATE2011. i hope you would be bonafied by this... best of luck 
#11
17th January 2011, 09:18 PM




Re: Syllabus of GATE for CSE and IT stream?
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. *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 nonlinear algebraic equations by Secant, Bisection and NewtonRaphson 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 datapath, 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, Divideandconquer; 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, NPhard, NPcomplete. *Theory of Computation: Regular languages and finite automata, Context free languages and Pushdown 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, Interprocess communication, Concurrency, Synchronization, Deadlock, CPU scheduling, Memory management and virtual memory, File systems, I/O systems, Protection and security. *Databases: ERmodel, 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 clientserver computing. 
#13
17th January 2011, 09:47 PM




Re: Syllabus of GATE for CSE and IT stream?
Syllabus for GATE exam in CSE is attached by the:
gate syll cse.doc 
#14
17th January 2011, 11:20 PM




Re: Syllabus of GATE for CSE and IT stream?
Quote:
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 nonlinear algebraic equations by Secant, Bisection and NewtonRaphson 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 Pushdown 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 datapath, 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, Divideandconquer; 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, Interprocess communication, Concurrency, Synchronization, Deadlock, CPU scheduling, Memory management and virtual memory, File systems, I/O systems, Protection and security. Databases: ERmodel, 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. 
#15
18th January 2011, 04:29 PM




Re: Syllabus of GATE for CSE and IT stream?
For CSE the syllabus is :
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 nonlinear algebraic equations by Secant, Bisection and NewtonRaphson Methods; Numerical integration by trapezoidal and Simpsons 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 datapath, 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, Divideandconquer; 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, NPhard, NPcomplete. Theory of Computation: Regular languages and finite automata, Context free languages and Pushdown 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, Interprocess communication, Concurrency, Synchronization, Deadlock, CPU scheduling, Memory management and virtual memory, File systems, I/O systems, Protection and security. Databases: ERmodel, 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. 
#16
18th January 2011, 04:45 PM




Re: Syllabus of GATE for CSE and IT stream?
Every thing will be from what you have learnt in CS engg.So,revise everything that was there for you.... most questions will be on languages & data structures available in them. Other than that operating systems & DBMS are imp as well...

#19
6th August 2011, 03:42 PM




Re: Syllabus of GATE for CSE and IT stream?
GATE is the all India entrance exam for the admission of M.tech, M.E, M.S programme.
GATE is held on every second Sunday of February, every year...GATE score is valid for two years... GATE is conducted in 21 streams. The whole GATE syllabus of Computer Science engineering and information technology is given at the link below. Just click here to get the syllabus. All the best....... 
#20
31st October 2011, 07:56 PM




Re: Syllabus of GATE for CSE and IT stream?
Backlog students also can apply for GATE exam,but the candidate should be in final year to apply for Gate2012 exam.
The candidate with backlog should attach the mark list to application form while applying for the gate entrance exam. Important date for Gate2012: Opening date for application form is 15th Sep 2011. Closing date for application form is 17th Oct 2011. Exam will held on 29th Jan 2012. To apply the application form online,then click here(Between the notification dates as mentioned above) For more details,then click here 
#21
31st October 2011, 08:35 PM




Re: Syllabus of GATE for CSE and IT stream?
Backlog students also can apply for GATE exam,but the candidate should be in final year to apply for Gate2012 exam.
The candidate with backlog should attach the mark list to application form while applying for the gate entrance exam. Important date for Gate2012: Opening date for application form is 15th Sep 2011. Closing date for application form is 17th Oct 2011. Exam will held on 29th Jan 2012. To apply the application form online,then click here(Between the notification dates as mentioned above) For more details,then click here 
Related Topics: 

Thread  Replies  Last Post 
Importance of GATE Coaching in GATE Preparation? Which is the Best Coaching Institute for GATE?  66  2nd July 2019 09:38 AM 
Tips and tricks for clearing GATE? How to score good in GATE Exam?  82  31st January 2015 12:54 PM 
Need details about GATE exam : Can I continue my higher studies with the help of the GATE score?  13  28th March 2014 10:36 AM 
