Algorithms

Easy

Medium

Difficult

2020

—

1. Recurrences

2. Hashing

3. MST(2)

—

2019

—

1.Divide and Conquer

2.Sorting

1.Heap

2.Time Complexity

3.Spanning tree

2018

—

1.Spanning Tree

1.Dynamic Programming(2)

2.Heap Tree

2017 Set-1

1.Time Complexity

2.Design Paradigms

1.Spanning Trees

2.Search Methods

—

2017 Set-2

1.Time Complexity

1.Time complexity(2)

2.Huffman Coding

—

2016 Set-1

1.Sorting

1.Minimum Spanning Tree(2)

—

2016 Set-2

1.Sorting

2.Floyd warshall

1.Min Heap

1.Matrix Chain Multiplication

2.Time Complexity

2015 Set-1

1. Quick sort 

2. Match the following 

1. Time complexity 

2. Minimum spanning Tree 

—

2015 Set-2

1. Time complexity 

2. P & NP 

3. Algorithms paradigms 

—

1. Divide and Conquer 

2015 Set-3

—

1. Merge sort 

2. Minimum spanning tree 

—

2014 Set-1

—

1. Comparisons

1. P & NP 

2014 Set-2

1. Time complexity 

1. Dynamic programming 

2. Greedy Algorithm 

3. Minimum spanning tree 

—

2014 Set-3

1. Sorting

1. Recursion

2. Searching

1. P & NP 

2013

1. Sorting

2. Greedy Algorithm 

1. P & NP 

2. Sorting

—

2012

1. P & NP 

1. Time complexity 

2. Merge sort 

3. Greedy Algorithms 

1. Minimum spanning tree 

2011

—

1. Dynamic Programming (2)

2. Asymptotic Complexity 

3. Minimum spanning tree(2)

—

2010

—

1. Time complexity 

1. Minimum spanning tree