GATE SYLLABUS FOR CS COMPUTER SCIENCE & INFORMATION TECHNOLOGY 2019

           CS Computer Science and Information Technology 2019

Section 1: Engineering Mathematics

Discrete Mathematics: Propositional and first order logic. Sets, relations, functions, partialorders and lattices. Groups. Graphs: connectivity, matching, coloring. Combinatorics:counting, recurrence relations, generating functions.Linear Algebra: Matrices, determinants, system of linear equations, eigenvalues andeigenvectors, LU decomposition.Calculus: Limits, continuity and differentiability. Maxima and minima. Mean valuetheorem. Integration.Probability: Random variables. Uniform, normal, exponential, poisson and binomialdistributions. Mean, median, mode and standard deviation. Conditional probability andBayes theorem.Computer Science and Information Technology

Section 2: Digital Logic

Boolean algebra. Combinational and sequential circuits. Minimization. Numberrepresentations and computer arithmetic (fixed and floating point).

Section 3: Computer Organization and Architecture

Machine instructions and addressing modes. ALU, data‐path and control unit. Instructionpipelining. Memory hierarchy: cache, main memory and secondary storage; I/Ointerface (interrupt and DMA mode).

Section 4: Programming and Data Structures

Programming in C. Recursion. Arrays, stacks, queues, linked lists, trees, binary searchtrees, 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 ComputationRegular expressions and finite automata. Context-free grammars and push-downautomata. Regular and contex-free languages, pumping lemma. Turing machines andundecidability.

Section 7: Compiler Design

Lexical analysis, parsing, syntax-directed translation. Runtime environments. Intermediatecode 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 andconcurrency 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/UDPand sockets, congestion control. Application layer protocols (DNS, SMTP, POP, FTP, HTTP).Basics of Wi-Fi. Network security: authentication, basics of public key and private keycryptography, digital signatures and certificates, firewalls.

 

For study materials contact us on email vivekkapadia451@gmail.com

Both soft copy and hard copies  of best institute for GATE , PSU ,IAS &IES are available........ 

Solved paper of GATE Mathematics 

Practice and check your score with solution and download it free....

https://drive.google.com/file/d/1pFqW7OGWRxRG8727RZykmLQK3ML_UTBW/view?usp=drivesdk

For more pdf with solved questions and answers of various subject OF GATE CS connect on vivekkapadia451@gmail.com

           CLICK HERE FOR SYLLABUS OF VARIOUS BRANCHES

                GATE MECHANICAL ENGINEERING SYLLABUS