Course curriculum

  • 2

    Course Introduction

  • 3

    Unit 1 - Arrays

    • Introduction

    • Array as an ADT

    • Multi dimentional Arrays

    • Address Calculation

  • 4

    Unit 1- Data Structure Classification

  • 5

    Unit 1 - Analysis of Complexity

    • Asymptotic Notations

    • Step Count Method

    • Programming Constructs

  • 6

    Unit 1 - Pointers

    • Pointers part 1

    • Pointers part 2

  • 7

    Unit 1 - Linked List

    • SLL - Creation and display

    • SLL - Insertion

    • SLL - Search and Update

    • Doubly linked list - create and display

    • Circular Linked List

    • Dll insertion and deletion

  • 8

    Unit 2 - Searching

    • Linear Search

    • Sentinel Search

    • Binary Search

  • 9

    Unit 2 - Sorting

    • Bubble sort - Theory and Examples

    • Bubble Sort Code and Analysis

    • Selection Sort - Theory and Examples

    • Insertion Sort - Theory and Examples

    • Insertion Sort - Code and Analysis

    • Quick Sort - Theory and Examples

    • Quick Sort - Code and Analysis

    • Merge Sort - Theory and Examples

    • Merge Sort - Code and Analysis

    • Selection Sort - Code and Analysis

    • Shell Sort

    • Bucket Sort

    • Radix Sort

    • Counting Sort

  • 10

    Unit 3 - Stack

    • Stack implementation using Arrays

    • Stack implementation using Linked List

    • Stack ADT - Practical way

    • Expression conversions using stack

    • Expression evaluation using stack

  • 11

    Unit 3 - Queue

    • Queue Implementation using Array

    • Queue Implementation using Linked List

    • Circular Queue

    • DeQueue - Double Ended Queue

    • Priority Queue

  • 12

    Unit 4 - Trees

    • Tree Traversing Techniques

    • Preorder - recursive

    • Preorder - Non recursive

    • Inorder and Postorder

    • Tree creation using infix,prefix,postfix Expressions

    • Binary Search Tree

    • Expression Tree

    • Threaded binary tree 1

    • Threaded binary tree 2

  • 13

    Unit 5 - Graphs

    • Adjecency Matrix and List

    • Breadth First Search (BFS)

    • Depth First Search (DFS)

    • Minimum Spanning Tree (MST) - Prims and Kruskal algorithms

    • Floyd Warshall Algorithm

    • Dijiktras Algorithm

    • Topological Sort

  • 14

    Unit 5 - Symbol Tables

    • OBST prerequisites

    • OBST examples

    • AVL tree 1

    • AVL tree 2

    • Heap Data Structure

  • 15

    Unit 6 - Hashing

    • Key to address translation techniques

    • Collision resolution techniques

Features

  • Prerequisite Course Available for FREE

  • Immediate Support is available for doubt clearing on Discussion Section

  • The interactive nature of the tutorials makes it a popular choice among students.

  • The instructors provide tips and tricks to help you adopt best coding practices

Other Courses

  • ₹400.00

    ₹400.00Data Structures and Algorithms - Insem Course

    Buy Now