GATE 2019: Analysis and review of Computer Science (CS) Exam

GATE 2019: Analysis and review of Computer Science (CS) Exam

Gate 2019: Detailed analysis and review of Computer Science (CS) Exam

The Graduate Aptitude Test in Engineering popularly known as GATE, has finally begun from February 2. This year, the exam is being organized by the Indian Institute of Technology (IIT) Madras in two shifts i.e., First Shift (9:30 AM to 12:30 PM) and Second Shift (2:30 PM to 5:30 PM). The Computer Science (CS) exam was held between 9:30 AM and 12:30 PM on 3rd February 2019. Here, we are providing you the detailed analysis of GATE CSE 2019. Various teams from Jagranjosh.com which were present at different Gate centres have collected the feedback from appeared students about the difficulty level of the exam. Students who are going to appear on 9th and 10th February can check the detailed analysis and boost their score. The analysis is prepared thorugh feedback and memory based topics/questions shared by students who appeared for GATE 2019.

Gate 2019: Check few last minute tips shared by experts

Gate CSE 2019: Section-wise analysis

Sections

Type of Questions and Numbers

Difficulty level

General Aptitude

Multiple Choice Questions (10)

Easy

Computer Science and Information Technology

Multiple Choice Questions (31)

Easy to moderate

Numerical Answer Type (24)

Moderate and time consuming

The important highlights of Gate CSE Analysis are given below:

  • The general aptitude section was easy and high scoring as well.
  • The Numerical Answer Type (NAT) questions were very time consuming.
  • The multiple choice questions (MCQs) were not time taking.
  • Questions from Database topic were tricky.

Students can go through the table given below in order to check how many questions were asked from different topics.

Subject

Topics

Marks (1 + 2)

Total Marks (100)

General Aptitude

Venn Diagrams, Speed-Time

10(5+5)

15

Engineering Mathematics

Matrices, Eigen Values, Vectors

5 (3+2)

7

Discrete Mathematics

Hamiltotorian, Mode

8(5+3)

11

Programming & Data Structures

Array, C Programming(Value based)

9(4+5)

14

Algorithms

Quick sort, Time complexity

4(2+2)

6

Computer Organization

Cache full associations

3(2+1)

4

Theory of Computation

Regular, Non Regular

4(2+2)

6

Databases

B+ tree, Functional dependency

5(1+4)

9

Operating Systems

Synchronization, SRTF, fork, deadlock

5(2+3)

8

Computer Networks

Application layer, layered application

5(1+4)

9

Compiler Design

First follow

3(1+2)

5

Digital Logic

Number System

4(2+2)

6

Total

65

100

[“source=jagranjosh”]