Data Structures and Algorithms (CSE2003)

Credits : 4

NOTE:

This subject will not leave you for the rest of your life, till you are there in the Tech industry. The level of difficulty asked in VIT exams is fairly easy, provided you practice the concepts regularly. If you do this subject right, and build the right foundation, it will help you a lot in the long run.

This subject is like Mathematics, there is no limit to the questions solved, you will find a plethora of great DSA questions.

The god of all the material is GeeksforGeeks (GFG) – Fundamentals-of-algorithm Data-structures

The playlists which we will be using are : 1.Jenny’s Lectures 2.Abdul Bari (Personal Favorite)

MODULE 1

Module 1 - Introduction to Data structures and Algorithms

Overview and importance of algorithms and data structures, Stages of algorithm development for solving a problem: Describing the problem, identifying a suitable technique, Design of an Algorithm, Proof of Correctness of the Algorithm, Computing the time complexity of the Algorithm.

Faculty’s slides will do wonders for this module

Abdul Bari lectures – 1.0 to 1.5.3

MODULE 2

Module 2 - Analysis of Algorithms

Asymptotic notations and their significance, Running time of an algorithm, Time-complexity of an algorithm, Performance analysis of an algorithm, Analysis of iterative and recursive algorithms, Master theorem (without proof).

Abdul Bari – 1.8.1 to 2.5

MODULE 3

Module 3 - Data Structures (VVVVVVV. IMP. and HUGE MODULE)

Importance of data structures, Arrays, Stacks, Queues, Linked list, Trees, Hashing table, Binary Search Tree, Heaps.

Jenny’s Lectures - 1.1 to 5.12

MODULE 4

Module 4 - Algorithm Design Paradigms

Divide and Conquer, Brute force, Greedy, Recursive Backtracking and Dynamic programming.

Divide and Conquer already covered in Module 2

Jenny’s Lectures – 7.1 to 8.3 (Greedy Covered)

Brute force-Algorithm Classification-Brute Force

Dynamic Programming- Video 28 and 29

Backtracking – Abdul Bari - Lec 6.1 to 6.4

MODULE 5

Module 5 - Graph Algorithms

Breadth First Search (BFS), Depth First Search (DFS), Minimum Spanning Tree (MST), Single Source Shortest Paths

Jenny’s Lectures – 6.1 to 6.15

MODULE 6

Module 6 - Computational Complexity classes

Tractable and Intractable Problems, Decidable and Undecidable problems, Computational complexity Classes: P, NP and NP complete - Cooks Theorem ( without proof),3-CNF-SAT Problem, Reduction of 3-CNF-SAT to Clique Problem, Reduction of 3-CNF-SAT to Subset sum problem

Tractable and Intractable Problems

Decidable and Undecidable problems

P, NP and NP complete - Cooks Theorem (without proof) and rest topics: Abdul Bari - 8. 0 to 9.2

MODULE 7

Module 7 – Recent Trends

Algorithms related to Search Engines

Faculty’s slides will do wonders for this module

MODULE 8