1. #1
    Unregistered

    Tell the syllabus for 2013 GATE entrance exam for Computer Science Engineering branch? Give your valuable guidelines to appear in GATE exam in the year 2k13?

    Tell the syllabus for 2013 GATE entrance exam for Computer Science Engineering branch? Give your valuable guidelines to appear in GATE exam in the year 2k13?





  2. Related:
  3. #2
    Pooja.Raj
    Join Date
    Dec 2011
    Posts
    60

    Re: Tell the syllabus for 2013 GATE entrance exam for Computer Science Engineering branch? Give your valuable guidelines to appear in GATE exam in the year 2k13?

    Hi,

    2013 GATE entrance has not yet been announced. Still GATE 2012 is not yet over. If you have applied just give a try for it to know where you stand. But GATE 2013 will be announced during September or October 2012. The syllabus also will be announced during that time. But you can start preparing for GATE 2013 using GATE 2012 syllabus only as there wont be many changes in the syllabus. If in case, there is any difference, then you can prepare for it within the exam as the exam will be held on 2nd sunday on february every year. All the best.




  4. #3
    dineshkvcod
    Join Date
    Dec 2011
    Posts
    12

    Re: Tell the syllabus for 2013 GATE entrance exam for Computer Science Engineering branch? Give your valuable guidelines to appear in GATE exam in the year 2k13?

    The GATE examination for Computer Science & Engineering Students is comprises of two subjects i.e Engineering Mathematics and Computer Science & Information Technology.
    The Syllabus under Engineering Mathematics are as follows:
    1.Mathematical Logic:
    Propositional Logic; First Order Logic.
    2.Probability:
    Conditional Probability; Mean, Median, Mode and Standard Deviation; Random
    Variables; Distributions; uniform, normal, exponential, Poisson, Binomial.
    3.Set Theory & Algebra:
    Sets; Relations; Functions; Groups; Partial Orders; Lattice; Boolean Algebra.
    4.Combinatorics:
    Permutations; Combinations; Counting; Summation; generating functions; recurrence
    relations; asymptotics.
    5.Graph Theory:
    Connectivity; spanning trees; Cut vertices & edges; covering; matching; independent
    sets; Colouring; Planarity; Isomorphism.
    6.Linear Algebra:
    Algebra of matrices, determinants, systems of linear equations, Eigen values and Eigen
    vectors.
    7.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.
    8.Calculus:
    Limit, Continuity & differentiability, Mean value Theorems, Theorems of integral
    calculus, evaluation of definite & improper integrals, Partial derivatives, Total
    derivatives, maxima & minima.
    The Syllabus under Computer Science & Technology are as follows:
    1.Digital Logic:
    Logic functions, Minimization, Design and synthesis of combinational and sequential
    circuits; Number representation and computer arithmetic (fixed and floating point).
    2.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.
    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, Notions of space and time complexity, Worst and
    average case analysis; Design: Greedy approach, Dynamic programming, Divide-andconquer;
    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.
    5.Theory of Computation:
    Regular languages and finite automata, Context free languages and Push-down
    automata, Recursively enumerable sets and Turing 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, I/O
    systems, Protection and security.
    8.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.
    9.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.
    10.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.
    11.Web technologies:
    HTML, XML, basic concepts of client-server computing.

  5. #4
    neha rawal
    Join Date
    Nov 2011
    Location
    new delhi
    Posts
    137

    Re: Tell the syllabus for 2013 GATE entrance exam for Computer Science Engineering branch? Give your valuable guidelines to appear in GATE exam in the year 2k13?

    GATE syllabus is same for CSE and IT students.

    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.

    goodluck prepare well!!!!!!!!!!!!!!

  6. #5
    Register
    Join Date
    Dec 2011
    Posts
    191

    Re: Tell the syllabus for 2013 GATE entrance exam for Computer Science Engineering branch? Give your valuable guidelines to appear in GATE exam in the year 2k13?

    dear friend,



    The Graduate Aptitude Test in Engineering (GATE) is an all-India examination administered and conducted in eight zones such that One Indian Institute of Science(IISc),Bangalore and the Seven IITs(Bombay,Kharagpur,Kanpur,Guahati,Roorkee,Madra s,Delhi)

    The most important news in GATE-2012 is that Pre-final year student ca not appear in GATE 2012 exam.

    According to the Eligibility of the GATE:


    1:You should have a Bachelor's degree holder in Engineering or Technology or Architecture or Pharmacy of 4 years after 10+2.

    2:You can also apply if you are in the final year examination of the Bachelor Degree.
    or
    3:You have to be a Master degree holders in any branch of Science like Physics,Chemistry, Mathematics, Statistics, Computer Applications etc....

    4:You can also apply if you are in the final year examination of the Master Degree.

    In this year 2012,the GATE 2012 is organized by Indian Institute of Technology,Delhi

    1. Last date for Submission of Online Application (website closure at 23:00 Hrs): 21 October 2011 (Friday).

    2. Last date for the receipt of printed version of ONLINE Application at the respective zonal GATE Office: 28 October 2011 (Friday)



    Date of Online Examination: 29-01-2012 (Sunday)

    Date of Offline Examination: 12-02-2012 (Sunday)

    Some Important Tips:


    1:According to me,maintain a time table to allow yourself to devote minimum 6-8hrs per day for the GATE.

    2:Then try to collect the base or main material of any subject.

    3:.Study the Syllabus

    4:Try to solve the Previous questions papers

    5:Try to Solve more and more problems,

    6:Try to discover more and more new own tricks by which you can easily solve any problem in a less time .

    7:You can go for self tests.


    for any tips click on :[COLOR="Navy"]http://www.onestopgate.com/gate-prep...ps-n-trics.asp[/COLOR

    side by side you can try on-line mock test:-

    1.>http://www.gateforum.com/
    2.>http://www.tcyonline.com/
    3.>http://www.wiziq.com/


    for more visit:http://www.iitk.ac.in/gate/gate2012/

    See the attachment for the Study Material For GATE.

    best of luck.
    Attached Files

  7. #6
    ashok.ch
    Join Date
    May 2011
    Posts
    760

    Re: Tell the syllabus for 2013 GATE entrance exam for Computer Science Engineering branch? Give your valuable guidelines to appear in GATE exam in the year 2k13?

    GATE stands for Graduate Aptitude Test in Engineering.This exam is conducted by IIT's to take qualified students for post graduation course in Engineering/Architecture/Statistical.

    Eligibility criteria for GATE Exam:
    You should have complete graduation degree in Engineering/Architecture/Statistical course.
    Appearing for final exam of above mentioned course can also appear for GATE exam.

    Exam score will be valid for 2 years.

    Exam is going to held in this year is on 29th Jan 2012.And results will be out on 25th March 2012.

    And notification released for this year is from 12th Sep 2011 to 21st Oct 2011.
    So you can also expect notification for next year in this months.

    See this attachment for syllabus of GATE(CSE).
    Attached Files

  8. #7
    Unregistered

    Re: Tell the syllabus for 2013 GATE entrance exam for Computer Science Engineering branch? Give your valuable guidelines to appear in GATE exam in the year 2k13?

    Tell the effective authors of course material for GATE. Please give alloted marks for each concerned subjects.

  9. #8
    MOUNICA
    Join Date
    Dec 2011
    Posts
    1

    Re: Tell the syllabus for 2013 GATE entrance exam for Computer Science Engineering branch? Give your valuable guidelines to appear in GATE exam in the year 2k13?

    Tell the effective books for GATE preparation. please give the alloted marks for each concerned subject.

  10. #9
    Sumitra
    Join Date
    Dec 2011
    Posts
    178

    Re: Tell the syllabus for 2013 GATE entrance exam for Computer Science Engineering branch? Give your valuable guidelines to appear in GATE exam in the year 2k13?

    Eligibility For GATE 2013

    A candidate is eligible for appearing in GATE 2013 if he/she is a final year B.Tech student in any stream or already is a B.Tech degree holder

    Candidates possessing dual degrees and M.Sc. degree are also eligible for appearing in GATE

    Note :- Pre-final year candidates are not eligible for appearing in GATE

    There is no age limit or any restrictions on the number of attempts for appearing in GATE

    For any further information on GATE just Click Here

    Enclosed within is the syllabus for Computer Science and IT for GATE
    Attached Files

  11. #10
    empty
    Join Date
    Dec 2011
    Posts
    99

    Re: Tell the syllabus for 2013 GATE entrance exam for Computer Science Engineering branch? Give your valuable guidelines to appear in GATE exam in the year 2k13?

    GATE = Graduate Aptitude Test In Engineering it means it is the examination to became master of your department or course.

    Eligibility Criteria :
    1. Candidate have to pass or in final year of the graduation degree.
    2. Pre final year student are not eligible for appearing to GATE as per new rule.
    3. Masterís degree holders in any branch of Science/Mathematics/ Statistics/Computer Applications or equivalent and those who are in the final year of such programmes

    Application Fee :
    Application fee is 1000 foe general and obc student. for sc/st/ph fee is 500 .

    A candidate can apply for only ONE of the 21 papers. In GATE exam there are65 question of 100 marks and time is 3 hrs.

    Syllabus and Information Brochure is attached here.
    Attached Files

  12. #11
    Unregistered

    Re: Tell the syllabus for 2013 GATE entrance exam for Computer Science Engineering branch? Give your valuable guidelines to appear in GATE exam in the year 2k13?

    i have done my b.tech in mechanical engineering, 2011 passout and currently working in automobile field. am i eligible to take up computer science and information technology as my paper in gate 2013, or is it mandatory for me to take up mechanical engineering?? i wanna change my field as CS n IT is my personal area of interest..
    please clarify ASAP..

    -thanx in advance..!!

  13. #12
    sureshyadav
    Join Date
    Jan 2012
    Location
    teegapur
    Posts
    523

    Re: Tell the syllabus for 2013 GATE entrance exam for Computer Science Engineering branch? Give your valuable guidelines to appear in GATE exam in the year 2k13?

    The GATE examination for Computer Science & Engineering Students is comprises of two subjects i.e Engineering Mathematics and Computer Science & Information Technology.
    The Syllabus under Engineering Mathematics are as follows:
    1.Mathematical Logic:
    Propositional Logic; First Order Logic.
    2.Probability:
    Conditional Probability; Mean, Median, Mode and Standard Deviation; Random
    Variables; Distributions; uniform, normal, exponential, Poisson, Binomial.
    3.Set Theory & Algebra:
    Sets; Relations; Functions; Groups; Partial Orders; Lattice; Boolean Algebra.
    4.Combinatorics:
    Permutations; Combinations; Counting; Summation; generating functions; recurrence
    relations; asymptotics.
    5.Graph Theory:
    Connectivity; spanning trees; Cut vertices & edges; covering; matching; independent
    sets; Colouring; Planarity; Isomorphism.
    6.Linear Algebra:
    Algebra of matrices, determinants, systems of linear equations, Eigen values and Eigen
    vectors.
    7.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.

  14. #13
    sitarama
    Join Date
    Sep 2011
    Location
    Hyderabad, ECIL
    Posts
    1,336

    Re: Tell the syllabus for 2013 GATE entrance exam for Computer Science Engineering branch? Give your valuable guidelines to appear in GATE exam in the year 2k13?

    Quote Originally Posted by Unregistered View Post
    i have done my b.tech in mechanical engineering, 2011 passout and currently working in automobile field. am i eligible to take up computer science and information technology as my paper in gate 2013, or is it mandatory for me to take up mechanical engineering?? i wanna change my field as CS n IT is my personal area of interest..
    please clarify ASAP..

    -thanx in advance..!!
    well,friend;....

    >> Now you are completing the b.tech and doing job in automobile this is good for you ,after completing the graduation interested to do postgraduate in computer science field,for that you are writing the GATE entrance exam,you don't worry you can chose any course in gate entrance exam.

    >> For that you want syllabus of 2013 GATE entrance exam for Computer Science Engineering branch,you don't worry i am providing the syllabus follow it;........

    >> GATE i.e Graduate Aptitude Test in Engineering this is the entrance exam for admission in postgraduate course in various field and this is all india entrance test.

    >> For this exam required educational qualifications are you must study the B.Tech/B.E /B.Arch course.And who are in the third or fourth years also apply for this exam.

    Important Dates :

    >> This exam conducted every year in month of February. And the applications forms are available online on September 4th week until October 3rd week. And application forms submitted online until October last week and offline before November 1st week. The results released in March mid week.

    >> For this exam the selection processor based on the written test ,for this teat the syllabus is follow bellow;................

    For Computer Science and Information Technology Branch :

    Common for all candidates aptitude test syllabus:
    • General Aptitude
    • Verbal Ability
    • Numerical Ability
    • Engineering Mathematics :Mathematical Logic,Probability,Set Theory & Algebra,Combinatorics,Graph Theory,Linear Algebra,Numerical Methods,Calculus.
    Computer Science and Information Technology Branch :
    • Digital Logic
    • Computer Organization and Architecture
    • Programming and Data Structures
    • Algorithms
    • Theory of Computation
    • Compiler Design
    • Operating System
    • Databases
    • Information Systems and Software Engineering
    • Computer Networks
    • Web technologies
    Preparation Plan :

    >> For this exam you need to go for coaching center there are providing the best coaching material. And you can collect the your option subject and practice previous questions papers and read minimum 5 books,and daily solving problems for maths.

    Coaching Institutions:
    • Vani Institute of Engineering & Technology
    • Gateforum
    • Brilliant Tutorials
    • Vidyalankar
    all the best;...

  15. #14
    teamleader
    Join Date
    Jan 2012
    Posts
    191

    Re: Tell the syllabus for 2013 GATE entrance exam for Computer Science Engineering branch? Give your valuable guidelines to appear in GATE exam in the year 2k13?

    Hi aspirant
    Graduate Aptitude Test in Engineering (GATE) is an all-India examination conducted in eight zones across the country by the GATE Committee
    GATE entrnce exam use ful for getting admission into 7 IITs and in INDIA ITUTE OF SCIENCE,BANGALORE EXAM PATTERN FOR GATE EXAM:
    >>Multiple choice questions carrying 1 or 2 marks each.
    >Common data questions,
    >>Linked answer questions.
    ENGINEERING MATHEMATICS SYLLABUS
    >>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.
    >>Graph Theory:
    Connectivity; spanning trees; Cut vertices & edges;
    covering; matching; independent sets; Coloring; Planarity; Isomorphism.
    >>Numerical Methods:
    LU decomposition for systems of linear equations; Numerical integration by trapezoidal and Simpson's rules.
    numerical solutions of non-linear algebraic equations by Secant, Bisection and Newton-Raphson Methods;
    >>Calculus:
    Limit, Continuity & differentiability, Mean value Theorems, Theorems of integral calculus,
    evaluation of definite & improper integrals, Partial derivatives, Total derivatives, maxi ma & mini ma
    >>Linear Algebra:
    Algebra of matrices, determinants, systems of linear equations, Eigen values and Eigen vectors.
    >>Combinatorics:
    Permutations; Combinations; Counting; Summation;
    generating functions; recurrence relations; asymptotics.
    In GATE EXAM NO AGE LIMIT,
    **ALL THE BEST*

  16. #15
    Unregistered

    Re: Tell the syllabus for 2013 GATE entrance exam for Computer Science Engineering branch? Give your valuable guidelines to appear in GATE exam in the year 2k13?

    is gate syllabus same for cse and it?

  17. #16
    Unregistered

    Re: Tell the syllabus for 2013 GATE entrance exam for Computer Science Engineering branch? Give your valuable guidelines to appear in GATE exam in the year 2k13?

    please provide me gate 2013 syllabus for ece

  18. #17
    puppy
    Join Date
    Feb 2012
    Posts
    239

    Re: Tell the syllabus for 2013 GATE entrance exam for Computer Science Engineering branch? Give your valuable guidelines to appear in GATE exam in the year 2k13?

    Quote Originally Posted by Unregistered View Post
    Tell the syllabus for 2013 GATE entrance exam for Computer Science Engineering branch? Give your valuable guidelines to appear in GATE exam in the year 2k13?
    HELLO FRIEND,
    THERE WILL BE NO SPECIFIC SYLLABUS FOR GATE EXAM.
    IT IS COMPLETELY BASED ON YOUR ENGINEERING 4 YEARS SYLLABUS.
    BUT TRY TO DEVELOP KNOWLEDGE AND BASIC KEY POINTS ABOUT EACH TOPIC OF YOUR SYLLABUS.
    THERE IS NEGATIVE MARKING.
    THANK YOU

  19. #18
    Unregistered

    Re: Tell the syllabus for 2013 GATE entrance exam for Computer Science Engineering branch? Give your valuable guidelines to appear in GATE exam in the year 2k13?

    how many backlogs are allowed in GATE exam?

  20. #19
    Unregistered

    Re: Tell the syllabus for 2013 GATE entrance exam for Computer Science Engineering branch? Give your valuable guidelines to appear in GATE exam in the year 2k13?

    tell the syllabus for 2013 gate exam for ee branch.please give me some important tips for gate exam

  21. #20
    Just Guesss?
    Join Date
    Jul 2011
    Location
    A.S.Rao Nagar - Hyderabad
    Posts
    1,687

    Re: Tell the syllabus for 2013 GATE entrance exam for Computer Science Engineering branch? Give your valuable guidelines to appear in GATE exam in the year 2k13?

    Hello friend !!

    GATE -- Graduate Aptitude Test in Engineering .

    This is an Entrance Examination conducted all over India.

    Through the Score of this Exam you can get into the Post Graduation Course like M'tech i.e Master of Technology.

    The Eligibility for this is you must be Graduate in B'tech either in Final Year or must have completed the course.


    Important Tentative Dates of GATE 2013 :

    The GATE exam carried out in the month of February.
    The application forms can collected online on September 4th week.
    The forms are available until October 3rd week.
    The application forms can be collected from the GATE office counters at the end of October.
    Filled forms can submitted online until October last week and offline before November 1st week.
    The results come out by March mid week.


    About the Examination :

    In the GATE Paper, there will be a total of 65 questions carrying 100 marks.

    Mathematics will carry 15 % ,
    The General Aptitude section will carry 15 % and
    The remaining 70 % marks is devoted to the subject of the paper.


    Suggestions to Crack the Examination :

    Improve your Aptitude Skills.

    You must be highly familiar with the Short Cuts in Problem Solving.

    Concentrate more on the subjects in which you are good enough, so that you can get into it completely.

    Start you preparation before 1 year of the Examination Commencement.

    Remember GATE Examination is not an Easy one to compete with, since there is also negative marking for the Wrong Answers.


    Syllabus for GATE 2013 :

    Download the PDF File for the Entire Syllabus of Computer Science and it also common for Information Technology aspirants.
    Attached Files

  22. #21
    Unregistered

    Re: Tell the syllabus for 2013 GATE entrance exam for Computer Science Engineering branch? Give your valuable guidelines to appear in GATE exam in the year 2k13?

    how to prepare for gate exam

  23. #22
    Unregistered

    Re: Tell the syllabus for 2013 GATE entrance exam for Computer Science Engineering branch? Give your valuable guidelines to appear in GATE exam in the year 2k13?

    SHOW THE 2012 GATES EXAM QUESTION PAPER

  24. #23
    siddjain93
    Join Date
    May 2012
    Location
    Kanpur
    Posts
    630

    Re: Tell the syllabus for 2013 GATE entrance exam for Computer Science Engineering branch? Give your valuable guidelines to appear in GATE exam in the year 2k13?

    Commencement of Online Application submission - 2nd week of September 2012

    Submission of Online Application Form - 3rd week of October 2012

    Receipt of printed version of ONLINE Application -
    Last week of October 2012

    GATE 2013 EXAM Date - OFFLINE Examination- Sunday, 10th February 29, 2013

    Announcement of GATE 2013 Results - March 15, 2013

    Syllabus of GATE for CSE branch-


    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.

  25. #24
    BISWARUP
    Join Date
    May 2011
    Location
    PURULIA
    Posts
    3,998

    Re: Tell the syllabus for 2013 GATE entrance exam for Computer Science Engineering branch? Give your valuable guidelines to appear in GATE exam in the year 2k13?

    ~~~SYLLABUS FOR GATE EXAM FOR COMPUTER SCIENCE~~~

    Its basically an entrance exam which is conducted by the IIT's to select candidates for the M.Tech/M.E courses in various colleges across India.


    I have attached the syllabus GATE exam for Computer Science .So please check it out.


    .
    Attached Files

  26. #25
    venkataprakash
    Join Date
    Apr 2011
    Location
    chennai.
    Posts
    1,275

    Re: Tell the syllabus for 2013 GATE entrance exam for Computer Science Engineering branch? Give your valuable guidelines to appear in GATE exam in the year 2k13?

    Syllabus for GATE Computer Science Syllabus :-
    • Mathematical Logic
    • Probability
    • Set Theory & Algebra
    • Combinatorics
    • Graph Theory
    • Linear Algebra
    • Numerical Methods
    • Calculus
    • Digital Logic
    • Computer Organization and Architecture
    • Programming and Data Structures
    • Algorithms
    • Theory of Computation
    • Compiler Design
    • Operating System
    • Databases
    • Information Systems and Software Engineering
    • Computer Network
    • Web technologies

    GATE Full form is Graduate Aptitude Test in Engineering and conducted jointly by the Indian Institute of Science and Seven Indian Institute of Technology .

    The GATE Examination is conducted through the constitution of eight Zones ::
    • Indian Institute of Science Bengaluru
    • Indian Institute of Technology Bombay
    • Indian Institute of Technology Delhi
    • Indian Institute of Technology Guwahati
    • Indian Institute of Technology Kanpur
    • Indian Institute of Technology Kharagpur
    • Indian Institute of Technology Madras
    • Indian Institute of Technology Roorkee


    ~ Candidate must holding the graduate degree in Engineering / Technology / Architecture of a recognized University .

    ~ Candidate must have a completed master degree with any branch of Statistics / Computer Science / Mathematics from a recognized University .

    ~ No minimum marks required for GATE Examination .

    ~ Final year of degree course may also eligible to apply .

    ~ Upto Valid 2 years .

    ~ Third year of degree may not eligible to apply .

    GATE notification will be publish in the month of Oct or Sept in the official website of GATE / Employment news papers .


    Attached Files

+ Reply to Thread

Quick Reply Any Question?