Difference between revisions of "Changes to GATE CSE Syllabus in 2016"

(Created page with " ==Discrete Mathematics== *Propositional and first order logic. *Sets, relations, functions, partial orders and lattices. Groups. * Graphs: connectivity, matching, coloring....")
 
Line 23: Line 23:
 
*Conditional probability and Bayes theorem.
 
*Conditional probability and Bayes theorem.
  
−
Section 2: Digital Logic
+
==Digital Logic==
−
Boolean algebra. Combinational and sequential circuits. Minimization. Number
+
 
−
representations and computer arithmetic (fixed and floating point).
+
*Boolean algebra.  
−
Section 3: Computer Organization and Architecture
+
*Combinational and sequential circuits. Minimization.  
−
Machine instructions and addressing modes. ALU, data‐path and control unit. Instruction
+
*Number representations and computer arithmetic (fixed and floating point).
−
pipelining. Memory hierarchy: cache, main memory and secondary storage; I/O
+
 
−
interface (interrupt and DMA mode).
+
==Computer Organization and Architecture==
−
Section 4: Programming and Data Structures
+
 
−
Programming in C. Recursion. Arrays, stacks, queues, linked lists, trees, binary search
+
*Machine instructions and addressing modes.  
−
trees, binary heaps, graphs.
+
*ALU, data‐path and control unit.  
−
Section 5: Algorithms
+
*Instruction pipelining.  
−
Searching, sorting, hashing. Asymptotic worst case time and space complexity.
+
* Memory hierarchy: cache, main memory and secondary storage;
−
Algorithm design techniques: greedy, dynamic programming and divide‐and‐conquer.
+
* I/O interface (interrupt and DMA mode).
−
Graph search, minimum spanning trees, shortest paths.
+
 
−
Section 6: Theory of Computation
+
==Programming and Data Structures==
−
Regular expressions and finite automata. Context-free grammars and push-down
+
*Programming in C. Recursion.  
−
automata. Regular and contex-free languages, pumping lemma. Turing machines and
+
*Arrays, stacks, queues, linked lists, trees, binary search trees, binary heaps, graphs.
−
undecidability.
+
 
−
Section 7: Compiler Design
+
==Algorithms==
−
Lexical analysis, parsing, syntax-directed translation. Runtime environments. Intermediate
+
*Searching, sorting, hashing.  
−
code generation.
+
*Asymptotic worst case time and space complexity.
−
Section 8: Operating System
+
*Algorithm design techniques: greedy, dynamic programming and divide‐and‐conquer.
−
Processes, threads, inter‐process communication, concurrency and synchronization.
+
*Graph search, minimum spanning trees, shortest paths.
−
Deadlock. CPU scheduling. Memory management and virtual memory. File systems.
+
 
−
Section 9: Databases
+
==Theory of Computation==
−
ER‐model. Relational model: relational algebra, tuple calculus, SQL. Integrity constraints,
+
*Regular expressions and finite automata.  
−
normal forms. File organization, indexing (e.g., B and B+ trees). Transactions and
+
*Context-free grammars and push-down automata.  
−
concurrency control.
+
*Regular and contex-free languages, pumping lemma.  
−
Section 10: Computer Networks
+
*Turing machines and undecidability.
−
Concept of layering. LAN technologies (Ethernet). Flow and error control techniques,
+
 
−
switching. IPv4/IPv6, routers and routing algorithms (distance vector, link state). TCP/UDP
+
==Compiler Design==
−
and sockets, congestion control. Application layer protocols (DNS, SMTP, POP, FTP, HTTP).
+
*Lexical analysis, parsing, syntax-directed translation.  
−
Basics of Wi-Fi. Network security: authentication, basics of public key and private key
+
*Runtime environments.  
−
cryptography, digital signatures and certificates, firewalls.  
+
*Intermediate code generation.
 +
 
 +
==Operating System==
 +
*Processes, threads, inter‐process communication, concurrency and synchronization.
 +
*Deadlock.  
 +
*CPU scheduling.  
 +
*Memory management and virtual memory.  
 +
*File systems.
 +
 
 +
==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.
 +
 
 +
==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.  
  
  
  
 
[[Category:GATE]]
 
[[Category:GATE]]

Revision as of 13:37, 1 August 2015

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.

Digital Logic

  • 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.

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.

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.

Compiler Design

  • Lexical analysis, parsing, syntax-directed translation.
  • Runtime environments.
  • Intermediate code generation.

Operating System

  • Processes, threads, inter‐process communication, concurrency and synchronization.
  • Deadlock.
  • CPU scheduling.
  • Memory management and virtual memory.
  • File systems.

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.

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.
Retrieved from "https://gatecse.in/w/index.php?title=Changes_to_GATE_CSE_Syllabus_in_2016&oldid=5159"

Discrete Mathematics[edit]

  • 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[edit]

  • Matrices, determinants
  • System of linear equations
  • Eigenvalues and eigenvectors
  • LU decomposition

Calculus[edit]

  • Limits, continuity and differentiability.
  • Maxima and minima. Mean value theorem.
  • Integration.

Probability[edit]

  • Random variables.
  • Uniform, normal, exponential, poisson and binomial distributions.
  • Mean, median, mode and standard deviation.
  • Conditional probability and Bayes theorem.

Digital Logic[edit]

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

Computer Organization and Architecture[edit]

  • 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[edit]

  • Programming in C. Recursion.
  • Arrays, stacks, queues, linked lists, trees, binary search trees, binary heaps, graphs.

Algorithms[edit]

  • 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[edit]

  • Regular expressions and finite automata.
  • Context-free grammars and push-down automata.
  • Regular and contex-free languages, pumping lemma.
  • Turing machines and undecidability.

Compiler Design[edit]

  • Lexical analysis, parsing, syntax-directed translation.
  • Runtime environments.
  • Intermediate code generation.

Operating System[edit]

  • Processes, threads, inter‐process communication, concurrency and synchronization.
  • Deadlock.
  • CPU scheduling.
  • Memory management and virtual memory.
  • File systems.

Databases[edit]

  • 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.

Computer Networks[edit]

  • 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.