Scribd
Upload
68 views4 pages

Syllabus For Computer Science and Information Technology (CS)

The document provides information about the GATE (Graduate Aptitude Test in Engineering) exam, including important dates, the syllabus for the Computer Science exam, how to access the applicant interface online, and browser settings. It lists topics like algorithms, theory of computation, databases, computer networks, and more that will be included in the CS exam syllabus. It also outlines the application process and important deadlines like submitting the application by September 30th and obtaining the admit card by November 20th.

Uploaded by

Akshara Raj
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
68 views4 pages

Syllabus For Computer Science and Information Technology (CS)

The document provides information about the GATE (Graduate Aptitude Test in Engineering) exam, including important dates, the syllabus for the Computer Science exam, how to access the applicant interface online, and browser settings. It lists topics like algorithms, theory of computation, databases, computer networks, and more that will be included in the CS exam syllabus. It also outlines the application process and important deadlines like submitting the application by September 30th and obtaining the admit card by November 20th.

Uploaded by

Akshara Raj
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 4

Home News Pre-Exam Exam Post-Exam FAQ About GATE Contact Us

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 non-linear algebraic equations by Secant, Bisection and Newton-Raphson 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 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.

Home News Pre-Exam Exam Post-Exam FAQ About GATE Contact Us

GATE Online Applicant Interface


Application website will close in 5 days
An online interface is provided for most of applicants interaction with the GATE office. With this interface the applicant can 1. 2. 3. 4. Apply for the examination online Upload photograph, signature, and supporting documents. Make application fee payment through netbanking. Check the status of your application form: Received, Under Scrutiny, Rejected after Scrutiny failed, Accepted after Successful Scrutiny, Admit Card Ready for Download, etc. Contact the GATE office in case of any queries/problems (Grievance Redressal). Download Admit Card. View your answers, marks and GATE score.

5. 6. 7.

The login to this interface is through your chosen email address and a password. Keep this information safe and do not disclose the email id and password to anyone. All users already registered should follow these instructions to ensure receipt of future emails.

Browser Settings

Home News Pre-Exam Exam Post-Exam FAQ About GATE Contact Us

Important Dates
1 September 2012 (00:00 Hrs)

GATE Online Applicant Interface (website) Opens

Saturday

Last date for Submission of Online Application (website closure)

Sunday

30 September 2012 (23:00 Hrs)

Last date for the receipt of printed version of ONLINE Application at the respective zonal GATE Office

Monday

8 October 2012

Last date for request of change of city

Tuesday

20 November 2012

Availability of admit card on Online Application Interface

Wednesday

5 December, 2012

GATE 2013 Online Examination for Papers: AR, CE, GG, MA, MT, PH and TF

Sunday

20 January 2013 (09:00 Hrs to 12:00 Hrs)

GATE 2013 Online Examination for Papers: AE, AG, BT, CH, CY, MN, XE and XL

Sunday

20 January 2013 (14:00 Hrs to 17:00 Hrs)

GATE 2013 Offline Examination for Papers: CS, ME and PI

Sunday

10 February 2013 (09:00 Hrs to 12:00 Hrs)

GATE 2013 Offline Examination for Papers: EC, EE and IN

Sunday

10 February 2013 (14:00 Hrs to 17:00 Hrs)

Announcement of results on Online Applicant Interface

Friday

15 March 2013 (10:00 Hrs)

You might also like