Algorithms: Analysis, Asymptotic notation, Notions of space and time complexity, Worst and average case analysis; Design: Greedy approach, Dynamic. Computer Science and Information Technology. Section1: Engineering Mathematics. Discrete Mathematics: Propositional and first order logic. Sets, relations. GATE CSE and syllabus are no change from GATE changes given below were for GATE syllabus compared to

Author: | NORA JASPER |

Language: | English, Spanish, Indonesian |

Country: | Botswana |

Genre: | Science & Research |

Pages: | 486 |

Published (Last): | 11.02.2016 |

ISBN: | 297-5-33029-632-6 |

ePub File Size: | 20.70 MB |

PDF File Size: | 15.59 MB |

Distribution: | Free* [*Regsitration Required] |

Downloads: | 45931 |

Uploaded by: | HARRIETT |

GATE Syllabus- Candidates can download the paper wise GATE candidates can download the corresponding syllabus in PDF format below. Zone-Wise List of Cities in which GATE will be held. .. Computer Science and Information Technology (CS). will receive a. “ Certificate from Principal” section printed on the bottom part of the PDF file. Before you . The syllabus for each of the papers is given separately. Making a. GATE Syllabi. The syllabus for each of the papers can be found by clicking on the subject papers below. Computer Science and Information Technology. CS.

Conditional probability and Bayes theorem. Consider failure as next stepping step. In front of the question write the Page Number and Name of the book referred and in the book referred underline or highlight the concept. In these questions, the candidate is presented with data, diagrams, images, etc. Take tests in examination environment and make note of areas of difficulty and make a roadmap to improve these before the next test. Stay away from incompetent and non-achievers. The following are type of Questions:

If you are fresher and preparing first time then I would suggest you the following approach to be adopted-. You should examine closely the examination pattern, syllabus and the level of difficulty.

You are not advised to read too many books for each subject; practically it is not possible in limited time frame. Make an overall plan of your career; define immediate and ultimate goals of your career, then make a roadmap to execute in most effective manner.

Being an engineer you should understand the importance of planning and execution of the plan. Divide months for different subjects and plan it so as to complete the entire syllabus in the left over time. For each subject, study should be exam oriented, i. Every subject requires different approach.

For example in mathematics you may be required to focus on practicing problems where as in English altogether different approach, similarly in technical subjects the approach may differ from subject to subject. If only self study is your style of preparing without coaching, then also notes making is advisable. This is basically for effective time management. Plan and freeze the study hours and abstain from using mobile phones, social media, what's app etc during these hours.

Do not postpone it for later, topic that is covered in class or studied on your own, finish the previous years' questions on priority basis.

While solving questions, mark the questions which you were not able to solve. Refer the reference book for the clarity of concepts, and solve again. In front of the question write the Page Number and Name of the book referred and in the book referred underline or highlight the concept. This above methodology is to be followed for all workbook and other materials also.

After a few months while doing revision you should re-attempt these marked questions only and no need to solve other questions.

And, towards months closer to exam, increase the revision time for proper retention of concepts till exam day.

Review of class notes. Then attempt only the marked questions once more. If time permits, then start with new set of questions.

Then, once this is done, take a snapshot and store in your mobile gallery. These will be your Digital Micro Notes, which can be revised anywhere and everywhere, while travelling, gap between two classes, free time. Be loquacious and discussion oriented with friends and seniors and keep on clearing your doubts, don't allow to accumulate the doubts which may result in mental stress. Take tests in examination environment and make note of areas of difficulty and make a roadmap to improve these before the next test.

Stay away from incompetent and non-achievers. Programming and Data Structures Programming in C. 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: Graph search, minimum spanning trees, shortest paths. Section 6: Theory of Computation Regular expressions and finite automata.

Context-free grammars and pushdown automata. Regular and context-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 synchronisation. CPU Scheduling.

Memory management and virtual memory. File Systems. Section 9: Databases ER-model. Relational model: Integrity constraints, normals forms. File organisation, indexing e. Transactions and concurrency control.

Section Computer Networks Concept of Layering. LAN technologies Ethernet. Flow and error control techniques, switching. Basics of Wi-Fi.

Network Security: Sc Engg. Post your Comment! Your Email address will not be disclosed. To post a comment, Please Login Log in. Ansari General Studies History by Md.

Select Exam s you are interested in. But most of these are part of runtime environments in compilers see Draggon book Runtime Environments chapter anyway.

Graphs added here. Algorithms Searching , sorting , hashing. Asymptotic worst case time and space complexity. Algorithm design techniques: Graph search , minimum spanning trees , shortest paths. Theory of Computation Regular expressions and finite automata. Context-free grammars and push-down automata. Regular and context-free languages , pumping lemma.

Turing machines and undecidability. Compiler Design Lexical analysis , parsing , syntax-directed translation. Runtime environments. Intermediate code generation.

CPU scheduling. Memory management and virtual memory. File systems. Rarely questions like size of graphic card required etc have been asked. Relational model: Integrity constraints , normal forms. File organization , indexing e. Transactions and concurrency control. No change Computer Networks Concept of layering.

LAN technologies Ethernet. Flow and error control techniques, switching.