Course curriculum

  • 2

    Course Introduction

  • 3

    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 2 - Sparse Matrix

    • Introduction

    • Simple transpose

    • Fast transpose

    • Addition - Theopry and examples

    • Addition - Code

    • Fast Transpose Code

  • 7

    Unit - 2 Polynomials using arrays

    • Introduction

    • Polynomial Addition

    • Polynomial Multiplication

  • 8

    Unit 3 - Searching

    • Linear Search

    • Sentinel Search

    • Binary Search

    • Index Sequential Search - Theory and examples

    • Index Sequential Search - Code and Analysis

    • Fibonnaci Search

  • 9

    Recursion

    • Recursion

    • Recursion types

  • 10

    Unit 3 - Sorting

    • Bubble sort - Theory and Examples

    • Bubble Sort Code and Analysis

    • Selection Sort - Theory and Examples

    • Selection Sort - Code and Analysis

    • 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

    • Shell Sort

    • Bucket Sort

    • Radix Sort

    • Counting Sort

  • 11

    Pointers

    • Pointers - Part 1

    • Pointers part 2

  • 12

    Unit 4 - Linked List

    • Singly Linked List - Creation and display

    • Singly Link List - Insertion

    • Singly Linked List - Seach and Update

    • Doubly Linked List - insertion and deletion

    • Circular Linked List

    • Doubly Linked List - Create and Display

  • 13

    Unit 5 - Stack

    • Stack implementation using Arrays

    • Stack implementation using Linked List

    • Stack ADT - Practical way

    • Expression conversions using stack

    • Expression evaluation using stack

  • 14

    Unit 5 - Queue

    • Queue Implementation using Array

    • Queue Implementation using Linked List

    • Circular Queue

    • DeQueue - Double Ended Queue

    • Priority Queue

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.00Fundamentals of Data Structures - Insem Course

    Buy Now