Graduate Aptitude Test In Engineering.
In your way of SUCCESS in GATE Examination we will help you and following context may Be Helpful Hope so...
GATE Official Website:
http://gate.iitd.ac.in/
GATE Official Posters, Advertisements:
Poster: https://drive.google.com/open?id=1DAgoSfQdkEOM2QVYcm_4rOI1e_si7EfT
GATE Information Broucher:
https://drive.google.com/open?id=1Dd2NDh0LMQAuc6ymT3OywnNTvHHx724N
GATE Syllabus For CSE (2019):
Download (PDF)
Section - 1: 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.
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 context-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.
Other Sections:
Programming Methodologies, Software Engineering, Web Technologies.
Best Reference Books For GATE:
(Amazon & Flipkart Links and Some are Available as PDF and remaining also we will try to collect and upload them).
Higher Engineering Mathematics by B.S. Grewal
Digital Logic and Computer Design by Morris Mano
Computer Organization and Architecture by William Stallings
("Click Here for PDF File")
The C Programming Language by Brian W. Kernighan and Dennis Ritchie
The C Answer Book by Clovis L. Tondo and Scott E. Gimpel
Understanding Pointers in C by Yashwant Kanetkar
Data Structures Through C in Depth By S.K. Srivastava and Deepali Srivastava
Data Structures and Algorithms Made easy :: Data Structures and Algorithmic Puzzles by Narasimha Karumanchi
Introduction To Algorithms by Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest and Clifford Stein
An Introduction to Formal Languages and Automata Theory by Peter Linz
("Click Here for PDF File")
Introduction to Languages and the Theory of Computation by John C. Martin
("Click Here for PDF File")
Compilers by Alfred V. Aho, Monica S. Lam, Ravi Sethi and Jeffrey D. Ullman
Operating System Concepts by Abraham Silberchatz, Peter B. Galvin and Greg Gagne
DataBase Management Systems by Raghuram Krishnan and Johannes Gehrke
Data Communication and Networking by Forouzan
Computer Networks by Andrew S. Tanenbaum and David J. Wetherall
Software Engineering by Roger S. Pressman
Web Technologies by Uttam K. Roy
In your way of SUCCESS in GATE Examination we will help you and following context may Be Helpful Hope so...
GATE Official Website:
http://gate.iitd.ac.in/
GATE Official Posters, Advertisements:
Poster: https://drive.google.com/open?id=1DAgoSfQdkEOM2QVYcm_4rOI1e_si7EfT
GATE Information Broucher:
https://drive.google.com/open?id=1Dd2NDh0LMQAuc6ymT3OywnNTvHHx724N
GATE Syllabus For CSE (2019):
Download (PDF)
Section - 1: 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.
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 context-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.
Other Sections:
Programming Methodologies, Software Engineering, Web Technologies.
Best Reference Books For GATE:
(Amazon & Flipkart Links and Some are Available as PDF and remaining also we will try to collect and upload them).
Higher Engineering Mathematics by B.S. Grewal
Digital Logic and Computer Design by Morris Mano
Computer Organization and Architecture by William Stallings
("Click Here for PDF File")
The C Programming Language by Brian W. Kernighan and Dennis Ritchie
The C Answer Book by Clovis L. Tondo and Scott E. Gimpel
Understanding Pointers in C by Yashwant Kanetkar
Data Structures Through C in Depth By S.K. Srivastava and Deepali Srivastava
Data Structures and Algorithms Made easy :: Data Structures and Algorithmic Puzzles by Narasimha Karumanchi
Introduction To Algorithms by Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest and Clifford Stein
An Introduction to Formal Languages and Automata Theory by Peter Linz
("Click Here for PDF File")
Introduction to Languages and the Theory of Computation by John C. Martin
("Click Here for PDF File")
Compilers by Alfred V. Aho, Monica S. Lam, Ravi Sethi and Jeffrey D. Ullman
Operating System Concepts by Abraham Silberchatz, Peter B. Galvin and Greg Gagne
DataBase Management Systems by Raghuram Krishnan and Johannes Gehrke
Data Communication and Networking by Forouzan
Computer Networks by Andrew S. Tanenbaum and David J. Wetherall
Software Engineering by Roger S. Pressman
Web Technologies by Uttam K. Roy
0 comments:
Post a Comment