2023 2024 Student Forum > Management Forum > Main Forum

 
  #2  
23rd May 2018, 04:55 PM
Unregistered
Guest
 
Re: Is non Gate CS and Gate covers the same syllabus for CS

Can you tell me if the syllabus for GATE CS - Computer Science and Information Technology covers the same topics as non-GATE entrance examination for admission in M Tech Program?
  #3  
23rd May 2018, 04:56 PM
Super Moderator
 
Join Date: Aug 2012
Re: Is non Gate CS and Gate covers the same syllabus for CS

The syllabus of Entrance Examination for admission in M Tech Program of the concerned University/College can be different. Otherwise, maximum University/College offered admission in M Tech Program through GATE score only.

GATE CS - Computer Science and Information Technology Syllabus

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.


Quick Reply
Your Username: Click here to log in

Message:
Options

Thread Tools Search this Thread



All times are GMT +5. The time now is 06:58 PM.


Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2024, vBulletin Solutions Inc.
SEO by vBSEO 3.6.0 PL2

1 2 3 4