GATE Syllabus for Computer Engineering 2018

Gate Preparation Strategy for CSE Computer Engineerinng.

GATE Syllabus for Computer Engineering 2018

GATE (Graduate Aptitude Test in Engineering)  is considered to be the standard examination conducted not only for post graduation admissions but also get opportunities to be placed in PSUs and research organizations. Based on the score achieved in GATE, admissions are offered in IITs, IISc, and NITs. Here we are giving you detailed GATE Syllabus for Computer Engineering 2018. If you want to crack GATE in one attempt you must have to prepare atleast 85% of Syllabus.

GATE Syllabus for Computer Engineering 2018 – Subject Specialization Priority

At the time of starting preparation for GATE 2018 you have consider Subject Specialization Priority for Study plan. If you are select main Subjects which has more weightage in paper, you can eeasily set your study plan. Here we are giving Subject Specialization Priority for your reference.

  • Computer Science
  • Information Technology
  • Information Security
  • Software Engineering
  • Distributed Computing
  • Image Processing
  • Computer Systems and Hardware
  • Database and Information Systems
  • Programming languages
  • Computer Networks and Distributed Systems
  • Artificial Intelligence
  • Advanced Computing

GATE Syllabus for Computer Engineering 2018

If you want to crack GATE 2018 in first attempt you have to prepare maximum part of Syllabus. Atleast 85% part of Syllabus is mandatory to crack the GATE in first attempt. Detailed GATE Syllabus for Computer Engineering 2018 is given below.

Section1: Engineering Mathematics

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. Computer Science and Information Technology.

Section 2 : Digital Logic

Boolean algebra : Combinational and sequential circuits. Minimization. Number representations and computer arithmetic (fixed and floating point).

Section 3 : 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).

Section 4 : Programming and Data Structures

Programming in C. Recursion. 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: greedy, dynamic programming and divide‐and‐conquer. Graph search, minimum spanning trees, shortest paths.

Section 6 : 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.

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 synchronization. Deadlock. CPU scheduling. Memory management and virtual memory. File systems.

Section 9 : Databases

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.

Section 10 : Computer Networks

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.

Important Links : 

 

GATE previous papers for Computer Engineering                                                 Preparation Tips for Computer Engineering

All The Best !!!

Be the first to comment

Leave a Reply

Your email address will not be published.


*