Computing Concepts

CS33M7V1: Algorithm Paradigms

CS33M7V2: Brute force or Exhaustive Search

CS33M7V3: Transform and Conquer

CS33M8V1: Introduction to Dynamic Programming

CS33M8V2: Binomial Coefficients

CS33M8V3 Longest Common Subsequence

CS33M8V4 0-1 Knapsack Problem

CS33M8V5 Transitive Closure

CS33M9V1 Greedy Algorithms

Minimum Spanning Tree

Coding Problem

Greedy TSP and Some Few Algorithm Design Notes

L2.3 Solving Recurrences

Complex Data Types

Welcome to Computing Concepts

L2.1 Analysis of Non-Recursive Algorithms

[CS165] What is inside the Database Systems Course Pack?

Introduction to SQL