GATE 2020 Computer Science & Information Technology Syllabus (Released) – Get (CS) PDF Here

Latest Applications Open 2020:

   

GATE 2020 Syllabus of Computer Science & Information Technology PDf has been Released. Graduate Aptitude Test in Engineering (GATE 2020) is an examination that primarily tests the comprehensive understanding of the candidates in various undergraduate subjects in Engineering/Technology/Architecture and postgraduate level subjects in Science.

From this year 2020, Examination is Conducted by IIT DELHI. The GATE 2020 score of a candidate reflects a relative performance level in a particular subject in the examination across several years. The score is used for admissions to post-graduate programs (e.g., M.E./M.Tech/ Direct Ph.D.) in centrally funded Indian Institutes of higher education (i.e., Institutes which are provided with financial assistance by MHRD and other Government agencies).

GATE 2020 Computer Science Syllabus – PDF Released

New GATE 2020 Computer Science & Information Technology Syllabus PDf has been Released. Click Here to Download.

Sectional: Engineering Mathematics

Latest Applications For Various UG & PG Courses Open 2020:

    1. Manipal University 2020 Admission Open For UG & PG Courses. Apply Now
    2. UPES, Dehradun – Enroll Yourself for the Academic Year 2020. Apply Now
    3. Pearl Academy No.1 Fashion School – Admissions Open for 2020 batch. Apply Now

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, the 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 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

The 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 the public key and private key cryptography, digital signatures and certificates, firewalls.

If you any query regarding GATE 2020 Computer Science & Information Technology Syllabus, you can ask your query leave comments below.



Leave a comment

XHTML: You can use these html tags: <a href="" title=""> <abbr title=""> <acronym title=""> <b> <blockquote cite=""> <cite> <code> <del datetime=""> <em> <i> <q cite=""> <s> <strike> <strong>


🔔 Manipal University 2020 Admission OpenApply Now
+
×
×