GATE 2019 NEWS

NATIONAL LEVEL ONLINE TEST

Computer Science and Information Technology is one of the popular stream among engineering aspirants which focuses on the basic elements of computer programming and networking. Every year lakhs of students give GATE Computer Science and Information Technology exam for pursuing admission in the Postgraduate program in well-known Engineering Colleges of India. GATE CS exam is also a gateway for the students to get a job in Public Sector Unit under the Information Technology domain.

GATE Exam Pattern | GATE Syllabus | GATE Paper Analysis |

The Syllabus is based on the topics of graduation level. 85% of Exam have Core Engineering Syllabus. From Which 72% is of basic CS Syllabus and 13% Engineering Mathematics. The paper consists of **65 questions** worth **100 marks**.

**GATE 2019**will take place from February 02, 03, 09 and 10, 2019 in multiple sessions.- GATE Syllabus is comprised of three parts namely
**General Aptitude, Engineering Mathematics**and**Engineering Core Syllabus**. - One must note that GATE papers will have General Aptitude as a compulsory section.

Candidates who appear for the exam must go through the GATE Computer Science and Information Technology syllabus to score better in the exam. CS syllabus is divided into 10 section as given below:

Main Topics | Sub Topics |
---|---|

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 |

It deals with logical structure of digital circuits. How the circuits will be made. What the output we will get on joining the circuits.

__ The Topics are:__ Boolean algebra. Combinational and sequential circuits. Minimization. Number representations and computer arithmetic (fixed and floating point).

It deals with set of rules for microarchitecture of computer.

__ The topics are:__ 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).

It is studied to know how the information is stored in the computer and how it will be retrieved back efficiently.

**The Topics **__ are:__ Programming in C. Recursion. Arrays, stacks, queues, linked lists, trees, binary search trees, binary heaps, graphs.

The algorithms are studied to learn how the problems are solved in computer science.It will teach you patterns how can use to solve the problems

__The topics __** are:** 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.

Theory of computation (alluded to as TOC here on) establishes a solid framework for a great deal of dynamic territories of computer science. In the event that you take a gander at it from a separation, theory of computation is a nearby cousin of Artificial Intelligence than say Probability or Computer vision

**The topics **__ are:__ Regular expressions and finite automata. Context-free grammars and pushdown automata. Regular and contex-free languages, pumping lemma. Turing machines and undecidability.

It is useful for the improvement software by hiding low level languages and how to detect errors in softwares.

__The topics __** are:** Lexical analysis, parsing, syntax-directed translation. Runtime environments. Intermediate code generation.

It is deals with the organisational structure of Operating system, types of operating system and how the operating system works.

** The topics are:** Processes, threads, inter-process communication, concurrency and synchronization. Deadlock. CPU scheduling. Memory management and virtual memory. File systems.

It deals with how the data is stored, what is database, types of database and how database are useful.

**The topics **__ are:__ 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.

It deals with types of networks, how the networking is done, how the information is transferred from one point to other.

__The topics __** are:** 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.

**Also Check GATE Previous Question Papers**

GATE is held for **24 different disciplines**. The paper is held in **online mode**. Candidates have to attempt **65 questions** in the duration of **3 hours**. Questions are of 2 types- Multiple Choice types (MCQ) and Numerical Answer Type (NAT)

The total Marks for 65 questions is **100**. Candidate has to use Virtual Calculator during exam as any other physical calculator is prohibited in GATE exam center. There is also Negative Marking included for giving wrong answer:

- There is no provision of negative marking in NAT questions.
- MCQs carrying 1 marks each, 1/3 marks would be deducted as a penalty of marking the wrong answer.
- For questions carrying 2 marks, 2/3 marks would be deducted for marking an incorrect answer.

**Check Complete GATE Exam Pattern**

Books | Authos/Publisher |
---|---|

GATE Computer Science & Information Technology | GKP, G.K. Pub |

TRB Lecturers ( Computer Science & Engineering ) Exam | A panel of Authors, Sura College of Competition |

A Handbook for Computer Science /IT Engineering | Made Easy Editorial Board, Made Easy Publications |

Graph Theory with Applications to Engineering and Computer Science | Deo and Narsingh, Prentice Hall India Learning Private Limited |

GATE 2017: Computer Science and IT Engineering Solved Papers | ME Team, Made Easy Publications |

We are providing you previous year analysis to be familiar with the type of questions and their level. Check the complete **paper analysis of GATE** from the table given below:

Topics | Number of Question |
---|---|

Mathematics | 5 |

TOC | 3 |

CD | 1 |

Data Structures | 4 |

Algorithms | 2 |

OS | 1 |

Computer Architecture and Organisation | 1 |

Digital Logic | 3 |

Database | 3 |

CN | 2 |

Mathematics | 6 |

TOC | 3 |

CD | 2 |

Data structures | 4 |

Algo | 2 |

OS | 4 |

Computer Architecture and Organisation | 2 |

Digital Logic | 2 |

Database | 1 |

CN | 4 |

October 04, 2018GATE 2019### GATE Mathematics Preparation ..

Read the article to check GATE mathematics prepara ...

October 04, 2018GATE 2019### GATE MN: Mining Engineering P ..

Mining Engineering is a domain which deals with sc ...

September 25, 2018GATE 2019### GATE EY: Ecology and Evolutio ..

GATE EY: Ecology and Evolution Preparation Tips

apply now

## Comments

## Comments

No Comments To Show