In most cases, a good algorithm will be packaged together with a set of appropriate data structures that provide the algorithm with the means to efficiently manipulate the data. In this interactive learning experience, we will investigate the typical data structures that are implemented in a variety of computing issues. You will get an understanding of how various data structures may be implemented in C++, and then you will put that knowledge into practice in the programming projects we provide you. Because of this, you will have a better understanding of what is occurring within a certain built-in implementation of a data structure and what outcomes you may anticipate from using it. Additionally, you will become familiar with common applications of these data structures.

• Core concepts & internals of Data Structures

• Trees, Linked Lists, Heaps, Graphs

• Build all data structures from scratch

• Brute Force & Optimisation Techniques

• Space Time Complexity Analysis

• Recursion & Backtracking

• Dynamic Memory & Pointers

• C++ Standard Template Library Basics

Data Structures Essentials is the only course you need to understand Data Structures and establish a solid C++ programming foundation. Every software program manipulates data (Insert, Delete, Update, Search). This course covers both the theory and hands-on implementation of each data structure from start to give you a solid grasp of Data Structures. This Computer Science course will teach you basic data kinds, such as integers, and how to organize and manage efficient structures.

Data Structures Foundation

• Array, 2D Array, Strings, Usage of vector and other STL containers

• Linked Lists, Stacks, Queues

• Trees, BST

• Heaps/Priority Queues

• Hash-tables, Collision Handling

• Graphs

Md. Atiab Jobayer Purno

Department of CSE

National Institute of Technology, Tiruchirappalli

Lecture 1 (Introduction) – June 27

- Asymptotic Notation Analysis

- Storage Structure of Array

- C++ STL Usage

• Familiarity with C/Python/Java

• Ability to understand & write code (preferably C/C++)

• Understanding of Array, String, Loops, Variables, Conditional Statements

    Access to lectures and assignments depends on your type of enrollment.

Asymptotic Notation Analysis

Storage Structure of Array

Rotate Matrix

Transpose Matrix

Spiral Traversal

- Stacks

            Implementation

            Application

- Queue

            Implementation

            Application

Implementation

Doubly/Circular Linked List

Insert/ Delete/ Update

Reverse a LL

Detecting Loop

Implementation

Binary Search Tree

Preorder/Inorder/Postorder Traversal

BST Property Analysis

BST Problems

Implementation

Operations

           Insert

           Update

           Get Min/Max

Extract Min/Max Operation

Delete Operation

HeapSort

Priority Queue

            Implementation

            Application

Graph Properties

Graph Representation

Adjacency Matrix

Adjacency List

Breadth First Search

Depth First Search

Solve Techniques for Programming Final Contest