Computer Algorithms/ Design and Analysis of Algorithms
Click Topic
Lecture 01 : Computer Algorithm: Introduction to Algorithms
Lecture 02 : Terms used in Algorithms Specification during Design and analysis of Algorithm
Lecture 03 : Algorithm Analysis(PART-I) Space Complexity Explored
Lecture 04 : Performance Analysis (Part-II) Time Complexity Explored
Lecture 05 : Algorithm Analysis Worst Case Complexity
Lecture 06 : Algorithm Analysis – Best Case Complexity (Ω) Explored
Lecture 07 : Algorithm Analysis: Average Case Complexity Θ notation
Lecture 08 : Little o and little ω Omega
Lecture 09 : Profiling Tool GPROF for Algorithm analysis and Measurement
Lecture 10 : Finding Actual time required by your program and functions in your program
Lecture 11 : Performance Measurement Part-I
Lecture 12 : PERFORMANCE MEASUREMENT-II (Creating Platform to Measure Performance of Algorithm)
Lecture 13 : Brute Force Sorting Technique: Insertion Sort, Bubble Sort, Selection Sort
Lecture 14 : Introduction to Divide and Conquer Technique and Binary Search Algorithm
Lecture 15 : DC Max-Min Algorithm( Divide and Conquer Maximum and Minimum finding Algorithm)
Lecture 16 : Merge Sort
Lecture 17 : MERGE SORT AND QUICK SORT, THE TWO DC SORTING ALGORITHMS
Lecture 18 : Greedy Method Introduction
Lecture 19 : Greedy Method: Knapsack Problem
Lecture 20 : Greedy Method: Job Sequencing with Deadlines
Lecture 21 : Greedy Method: Minimum Cost Spanning tree Part -I
Lecture 22 : Minimum Cost Spanning Tree : Prims Algorithm
Lecture 23 : Minimum Cost Spanning Tree(Part-3): Kruskals Algorithm
Lecture 24 : Greedy Method: Optimal Storages on Tapes