GATE CSE Weightage Analysis for Algorithms

By Himanshu Bajpai|Updated : August 23rd, 2021

Important Topics

  • Topics covered in 2021:  Complexity Selections Sort, Greedy Algorithms
  • Topics covered in 2020: Hashing, Analysis of algorithm
  • Topics covered in 2019: Graphs, Time Complexity, Minimum Spanning Tree, Heap.
  • Topics covered in 2018: Heap, Matrix, Greedy Algorithms, graphs.
  • Topics covered in 2017: Searching, Algorithms matching, Asymptotic analysis, greedy algorithms
  • Topics covered in 2016: Sorting Algorithms; Complexity Selections Sort; merge sort
  • Topics covered in 2015: Algorithm Analysis, Heaps, Sorting Algorithm, Graph Algorithm

Algorithms Analysis  

  • GATE Computer Science Engineering 2021
  • Paper Analysis: 8 Marks
  • GATE Computer Science Engineering 2020
    • Paper Analysis: 4 Marks
  • GATE Computer Science Engineering 2019
    • Paper Analysis: 6 Marks
  • GATE Computer Science Engineering 2018
    • Paper Analysis: 7 Marks
  • GATE Computer Science Engineering 2017
    • Paper-1 Analysis: 4 Marks
    • Paper-2 Analysis: 7 Marks
  • GATE Computer Science Engineering 2016
    • Paper-1 Analysis: 6 Marks
    • Paper-2 Analysis: 9 Marks
  • GATE Computer Science Engineering 2015
    • Paper-1 Analysis: 7 Marks
    • Paper-2 Analysis: 6 Marks
    • Paper-3 Analysis: 7 Marks

We hope this analysis will be useful to prepare Algorithms. You can analyze frequently asked topics in GATE from the given analysis to crack the GATE 2021 Exam.

Candidates can also practice 110+ Mock tests for exams like GATE, NIELIT with BYJU'S Exam Prep Test Series check the following link:

Click Here to Avail GATE CSE Test Series!

Thanks

Sahi prep Life Set !!!

Comments

write a comment

Follow us for latest updates