GATE Computer Science & Information Technology Syllabus 2018 pdf
Get details of Computer Science & Information Technology Syllabus for GATE Exam 2018. GATE 2018 examination will be commenced in second and third months of 2018.Before appearing in the examination, each candidates must be aware about the examination pattern.
In this particular article we are providing you GATE exam pattern for CSE and IT branches. You can check out GATE exam pattern for Computer Science & Information Technology from our website. A table showing GATE paper pattern for Computer Science & Information Technology is given below. In this article one can check for GATE Computer Science & Information Technology Syllabus 2018.
Graduate Aptitude Test in Engineering (GATE) is an examination that primarily tests the comprehensive understanding of the candidates in various undergraduate subjects in Engineering/Technology/Architecture and post-graduate level subjects in Science. The GATE score of a candidate reflects a relative performance level in a particular subject in the examination across several years.
GATE Computer Science & Information Technology Syllabus 2018
Here we are providing the detailed syllabus for GATE Computer Science & Information Technology for students reference purpose :
|Exam Section||Marks Weightage|
|General Aptitude||15% of total marks|
|Engineering Mathematics||15% of total marks|
|Subject questions||70% of total marks|
About GATE Computer Science & Information Technology
Computer Science engineering deals with design, implementation, and management of information system of both software & hardware processes. A computer scientist specializes in theory of computation and design of computational systems. Computer engineering or Computer Science engineering integrates several disciplines such as Information Technology, Electrical and Electronics Engineering, Software Design, etc. The engineers are mainly involved in the development of software and hardware systems of various aspects of computing. They not only focus on how computers work but also integrate into larger scheme of things
General Aptitude – GATE Syllabus 2018
General Aptitude (GA) section is common to all the papers. The General Aptitude section is designed to test your language, analytical and quantitative skills. For full details about General Aptitude Syllabus Click on General Aptitude Syllabus
- Discrete Mathematics
- Linear Algebra
Discrete Mathematics: Propositional and first order logic. Sets, relations, functions, partial orders and lattices. Groups. Graphs: connectivity, matching, coloring. Combinatorics: counting, recurrence relations, generating functions.
Linear Algebra: Matrices, determinants, system of linear equations, eigenvalues and eigenvectors, LU decomposition.
Calculus: Limits, continuity and differentiability. Maxima and minima. Mean value theorem. Integration.
Probability: Random variables. Uniform, normal, exponential, poisson and binomial distributions. Mean, median, mode and standard deviation. Conditional probability and Bayes theorem.
Subject questions (Computer Science & Information Technology)
Those who are going to appear in GATE examination 2018 with Computer Science & Information Technology subject, they are advised to check Syllabus for GATE Computer Science & Information Technology Paper from our website which is available as under:
- Digital Logic
- Computer Organization and Architecture
- Programming and Data Structures
- Theory of Computation
- Compiler Design
- Operating System
- Computer Networks
Boolean algebra. Combinational and sequential circuits. Minimization. Number representations and computer arithmetic (fixed and floating point).
Computer Organization and Architecture
Machine instructions and addressing modes. ALU, data‐path and control unit. Instruction pipelining. Memory hierarchy: cache, main memory and secondary storage; I/O interface (interrupt and DMA mode).
Programming and Data Structures
Programming in C. Recursion. Arrays, stacks, queues, linked lists, trees, binary search trees, binary heaps, graphs.
Searching, sorting, hashing. Asymptotic worst case time and space complexity. Algorithm design techniques: greedy, dynamic programming and divide‐and‐conquer. Graph search, minimum spanning trees, shortest paths.
Theory of Computation
Regular expressions and finite automata. Context-free grammars and push-down automata. Regular and contex-free languages, pumping lemma. Turing machines and undecidability.
Lexical analysis, parsing, syntax-directed translation. Runtime environments. Intermediate code generation.
Processes, threads, inter‐process communication, concurrency and synchronization. Deadlock. CPU scheduling. Memory management and virtual memory. File systems.
ER‐model. Relational model: relational algebra, tuple calculus, SQL. Integrity constraints, normal forms. File organization, indexing (e.g., B and B+ trees). Transactions and concurrency control.
Concept of layering. LAN technologies (Ethernet). Flow and error control techniques, switching. IPv4/IPv6, routers and routing algorithms (distance vector, link state). TCP/UDP and sockets, congestion control. Application layer protocols (DNS, SMTP, POP, FTP, HTTP). Basics of Wi-Fi. Network security: authentication, basics of public key and private key cryptography, digital signatures and certificates, firewalls.
So friends, if you have any doubts regarding GATE exams & any other Engineering Entrance Exams, Ask via comment box. Also share this article GATE CS: COMPUTER SCIENCE & INFORMATION TECHNOLOGY SYLLABUS 2018 pdf to your friends.