Gate 2024
Gate 2024
Graduate
Aptitude Test in Engineering (GATE)
Graduate Aptitude Test in
Engineering (GATE) is a national level exam that primarily tests the
comprehensive understanding of various undergraduate subjects in Engineering/
Technology/ Architecture/ Science/ Commerce/ Arts.
GATE Exam will be a computer-based
test (CBT) which is being organized by the different IIT’s. The exam will be
conducted by IISc Bangalore and seven IITs such as IIT Bombay, IIT Delhi, IIT
Guwahati, IIT Kanpur, IIT Kharagpur, IIT Madras and IIT Roorkee on behalf of
the National Coordination Board–GATE, Department of Higher Education,
Ministry of Education and Government of India.
Qualified GATE candidate can be used
for seeking admission and research scholarship to Master’s programs and Doctoral
programs in Engineering/ Technology/ Architecture/ Science/ Commerce/ Arts and
Doctoral programs in relevant branches of Arts and Science in the
institutions supported by the Ministry of Education and other Government Department.
GATE score is also used by private institutions
for giving admission to students without Ministry of Education scholarship/assistantship.
Many Public Sector Undertakings (PSUs) have been using the GATE score in
their recruitment process.
SYLLABUS
CS
SUBJECT:
Computer Science and Information Technology
Section
1:
Engineering Mathematics
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
and Statistics: 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, pipeline hazards. 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 traversals, 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 undesirability.
Section
7:
Compiler Design
Lexical analysis, parsing,
syntax-directed translation. Runtime environments. Intermediate code
generation. Local optimization, Data flow analyses: constant propagation,
liveness analysis, common sub expression elimination.
Section
8:
Operating System
System calls, processes, threads,
inter‐process communication,
concurrency and synchronization. Deadlock. CPU and I/O 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: OSI and TCP/IP
Protocol Stacks; Basics of packet, circuit and virtual circuit switching;
Data link layer: framing, error detection, Medium Access Control, Ethernet
bridging; Routing protocols: shortest path, flooding, distance vector and
link state routing; Fragmentation and IP addressing, IPv4, CIDR notation,
Basics of IP support protocols (ARP, DHCP, ICMP), Network Address Translation
(NAT); Transport layer: flow control and congestion control, UDP, TCP,
sockets; Application layer protocols: DNS, SMTP, HTTP, FTP, Email.
If you need to know any more information do contact us-
Thank you so much for your
consideration.
We will respond to your request as soon as possible.
Our C programming tutorials will guide you to learn C programming one step at a time.
|
|
||
|
Graduate
Aptitude Test in Engineering (GATE) |
||
|
Graduate Aptitude Test in Engineering (GATE) is a national level exam that primarily tests the comprehensive understanding of various undergraduate subjects in Engineering/ Technology/ Architecture/ Science/ Commerce/ Arts. GATE Exam will be a computer-based test (CBT) which is being organized by the different IIT’s. The exam will be conducted by IISc Bangalore and seven IITs such as IIT Bombay, IIT Delhi, IIT Guwahati, IIT Kanpur, IIT Kharagpur, IIT Madras and IIT Roorkee on behalf of the National Coordination Board–GATE, Department of Higher Education, Ministry of Education and Government of India. Qualified GATE candidate can be used for seeking admission and research scholarship to Master’s programs and Doctoral programs in Engineering/ Technology/ Architecture/ Science/ Commerce/ Arts and Doctoral programs in relevant branches of Arts and Science in the institutions supported by the Ministry of Education and other Government Department. GATE score is also used by private institutions for giving admission to students without Ministry of Education scholarship/assistantship. Many Public Sector Undertakings (PSUs) have been using the GATE score in their recruitment process.
|
||
|
SYLLABUS |
||
|
CS |
SUBJECT:
Computer Science and Information Technology |
|
|
|
|
|
|
Section
1: |
Engineering Mathematics |
|
|
|
||
|
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
and Statistics: 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, pipeline hazards. 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 traversals, 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 undesirability. |
||
|
|
||
|
Section
7: |
Compiler Design |
|
|
|
||
|
Lexical analysis, parsing,
syntax-directed translation. Runtime environments. Intermediate code
generation. Local optimization, Data flow analyses: constant propagation,
liveness analysis, common sub expression elimination. |
||
|
|
||
|
Section
8: |
Operating System |
|
|
|
||
|
System calls, processes, threads,
inter‐process communication,
concurrency and synchronization. Deadlock. CPU and I/O 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: OSI and TCP/IP Protocol Stacks; Basics of packet, circuit and virtual circuit switching; Data link layer: framing, error detection, Medium Access Control, Ethernet bridging; Routing protocols: shortest path, flooding, distance vector and link state routing; Fragmentation and IP addressing, IPv4, CIDR notation, Basics of IP support protocols (ARP, DHCP, ICMP), Network Address Translation (NAT); Transport layer: flow control and congestion control, UDP, TCP, sockets; Application layer protocols: DNS, SMTP, HTTP, FTP, Email. |
||
|
If you need to know any more information do contact us-
Thank you so much for your
consideration. We will respond to your request as soon as possible. |
||
Comments
Post a Comment