Data Structure And Algorithms by University of California San Diego

List of Courses

• 1. Algorithmic Toolbox
• 2. Data Structures
• 3. Algorithms On Graphs
• 4. Algorithms On String

1. Algorithmic Toolbox

• Course link

• Week-1 Programming Challanges

  • Progrmming Assignment-1

    1. • [x] Sum of Two Digits
    2. • [x] Maximun Pairwise Product

• Week-2 Algorithmic Warmup

  • List of Contants

    1. Why Study Algorithms

    2. Fabonacci Numbers

       1. Introduction

       2. Native Approch

       3. Effective Approch

    3. Greatest Common Factor

       1. Introduction

       2. Euclidean Algorithm for computing GCD

    4. Asymptotic Notations

       1. Basics of Asymptotic Notations

       2. Big-O Notations

       3. Using Big-O Notations

  • Progrmming Assignment-2

    1. • [X] Fibonacci Numbers
    2. • [X] Last digit of Fibonacci Numbers
    3. • [X] Greatest Common Divisor
    4. • [X] Least Common Multiplier
    5. • [X] Fiblnacci Number Again
    6. • [X] Fibonacci Last Digit
    7. • [ ] Fibonacci Partial Sum
    8. • [ ] Fibonacci Sum Square

• Week-3 Greedy Algorithms

  • List of Contants

    1. Introduction

    2. Grouping Children Problem

       • Implementation

    3. Fractional knapsack

       • Implementation

  • Progrmming Assignment-3

    1. • [X] Money Change
    2. • [X] Maximum Value of the Loot
    3. • [X] Car Fueling
    4. • [X] Maximun Advertisement Revenue

• Week-4 Divide and Conqure

  • List of Contents

    1. Search in Array

       • Linear Search

       • Binary Search

    2. Polynomial Multiplication

       • Implementation

    3. Master Theorm

       • Introduction

    4. Sorting

       • Selection Sort

       • Merge Sort

       • Counting Sort

    5. Quick Sort

       • Implementation

    • Progrmming Assignment-4

      1. • [X] Binary Search
      2. • [x] Majority Element
      3. • [x] Improving Quick Sort
      4. • [ ] Numbers of Intersions
      5. • [ ] Organizing a Lottery
      6. • [ ] Closing Points

• Week-5 Dynamic Programming Part-1

  • List of Contents

    1. Change Problem

    2. String Comparison

    3. Extra Slides

  • Progrmming Assignment-5

    1. • [X] Money Change Again
    2. • [x] Primitive Calculator
    3. • [X] Edit Distance
    4. • [ ] Longest Common Subsequence of two sequences
    5. • [ ] Longest Common Subsequence of three sequences

• Week-6 Dynamic Programming Part-2

  • List of Contents

    1. KnapSack

       • Knapsack With Repetitions (Video)

       • Knapsack Without Repetitions (Video)

    2. Placing Parentheses (Video)

  • Progrmming Assignment-5

    1. • [X] Maximun Annount of Gold
    2. • [ ] Partitioning Souvenirs
    3. • [X] Maximun Value of Arithmetic Expression

2. Data Structures

• Course Link

• Week-1 Basic Data Structures

  • List of Contents

    1. Array and List

       • Arrays

       • Link List

    2. Stack and Queue

       • Stack

       • Queue

    3. Trees

       • Tree Implementation

  • Programming Assignment-1

    1. • [X] Brackets in Code
    2. • [X] Tree Height
    3. • [X] Network Simulation
    4. • [X] Stack With Max
    5. • [ ] Max Sliding Window

• Week-2 Dynamic Array

  • List of Contents

    1. Dynamic Array and Amortized Analysis

       • Dynamic Array

       • Amortized Analysis

• Week-3 Priority Queue and Disjoint Set

  • List of Contents

    1. Priority Queue

       • Introduction

    2. Binary Heaps

       • Introduction

       • Heap Sort

    3. Disjoint Set Native

       • Implementation

    4. Disjoint Set Effective

       • Implementation

  • Programming Assignment-2

    1. • [X] Make Heap
    2. • [X] Job Queue
    3. • [X] Merging Tables

• Week-4 Hash Tables

  • List of Contents

    1. Hash Tables Introduction

       • Introduction

    2. Hash Function

       • Introduction

    3. Search Substring

       • Search Pattren

       • Robin Karps Algorithm

  • Programming Assignment-4

    1. • [X] Phone Book
    2. • [X] Hash Chains
    3. • [X] Hash Substring
    4. • [ ] Substring Equality
    5. • [ ] Longest Common Substring
    6. • [ ] Matching With Mismatch

• Week-5 Binary Search Tree

  • List of Contants

    1. BST Introduction

    2. BST Basic Operations

       • Implementation

    3. Balancing BST

    4. AVL Trees Introduction

    5. AVL Tree Operations

       • Implementation

    6. Merge and Split

    7. Applications of BST

    8. Splay Tree

       • Implementation

  • Programming Assignment-5

    1. • [X] Tree Travelsal
    2. • [X] Is BST
    3. • [X] Is BST Advance
    4. • [ ] Set Range Sum
    5. • [ ] Rope

3. Algorithms On Graphs

• Course Link

• Week-1 Graph Decomposition Part-1

  • List of Contents

    1. Graph Basics

    2. Graph Representation

       • Undirected Graphs Basics And Representation

    3. Exploring Graphs

    4. Graph Connectivity

    5. Pre-order and Post-order

       • Implementation

  • Programming Assignment-1

    1. • [X] Rechability
    2. • [X] Connected Components

• Week-2 Graph Decomposition Part-2

  • List of Contents

    1. DAG'S Basics

    2. Topological Sort

       • Implementation

    3. Strongly Connected Components

    4. Finding Strongly Connected Components

       • Implementation

  • Programming Assignment-2

    1. • [X] Cs Curriculum
    2. • [X] Order of Course
    3. • [X] Intersection Rechability

• Week-3 Path in Graphs Part-1

  • List of Contents

    1. Shortest Path in Graph

       • Introduction

       • Breadth First Search

       • Shortest Path Tree

  • Programming Assignment-3

    1. -[X] Flight Segments

    2. -[X] Biparted

• Week-4 Path in Graph Part-2

  • List of Contents

    1. Dijkstra Algorithms

       • Fastest Route

       • Implementation of Dijkstra Algorithm

    2. Bellman Ford Algorithm

       • Implementation

  • Programming Assignment-4

    1. • [X] Minimun Flight Cost
    2. • [X] Detecting Anomalites
    3. • [X] Exchanging Money

• Week-5 Spanning Tree

  • List of Contents

    1. Minimum Spanning Tree

       • MST introduction

       • Kruskal's Algorithm

       • Prim's Algorithms

  • Programming Assignment-5

    1. • [X] Connecting Points
    2. • [X] Clustering

4. Algorithms On String

• Course Link

• Week-1 Suffix Tree

  • List of Contents

    1. Suffix Tree

       • Introduction

       • Suffix Tire

       • Suffix Tree]

  • Programming Assignment-1

    1. • [X] Tire
    2. • [X] Tire Matching
    3. • [ ] Tire Matching Extended
    4. • [X] Suffix Tree
    5. • [X] Non Shared Substring

• Week-2 Burrows Wheeler Transformation

  • List of Contents

    1. BWT in Pattern Matching

       • Introduction

       • Pattren Matching Using BWT

       • Suffix Array

       • Approximate Pattren Matching

  • Programming Assignment-2

    1. • [X] BWT
    2. • [X] BWT Inverse
    3. • [X] BWT Matching
    4. • [X] Suffix Array

• Week-3 Knuth-Morris-Pratt Algorithm

  • List of Contents

    1. Knuth-Morris-Pratt Algorithm

       • Exact Pattren Matching

       • Safe Shift

       • Prefix Function

       • Knuth-Morris-Pratt Algorithm Implementation

• Week-4 Suffix Array

  • List of Contents

    1. Suffix Array

       • Suffix Array Basics

       • Suffix Array Construction

    2. Suffix Tree from Suffix Array

       • LCP Array Introduction

       • Suffix Tree

  • Programming Assignment-3

    1. • [X] KMP
    2. • [X] Suffix Array Long
    3. • [ ] Suffix Array Matching
    4. • [X] Suffix Tree From Array