Lecture

Right Arrow

SEARCH COURSES / LECTURES

Left Arrow

Advanced Algorithms Analysis and Design (V-U)

(45 Lectures Available)

S# Lecture Course Institute Instructor Discipline
1
  • 0-1 Knapsack Problem using Dynamic Programming (V-U)
Advanced Algorithms Analysis and Design (V-U) Virtual University Dr. N. A. Zafar Applied Sciences
2
  • 0-1 Knapsack Problem's Algorithm using Dynamic Programming, Optimal Weight Triangulation (V-U)
Advanced Algorithms Analysis and Design (V-U) Virtual University Dr. N. A. Zafar Applied Sciences
3
  • 2-Line Assembly Scheduling Problem, n-Line Assembly Scheduling Problem (V-U)
Advanced Algorithms Analysis and Design (V-U) Virtual University Dr. N. A. Zafar Applied Sciences
4
  • All-Pairs Shortest Paths, Shortest Paths and Matrix Multiplication (V-U)
Advanced Algorithms Analysis and Design (V-U) Virtual University Dr. N. A. Zafar Applied Sciences
5
  • Assembly-Line Scheduling Problem (V-U)
Advanced Algorithms Analysis and Design (V-U) Virtual University Dr. N. A. Zafar Applied Sciences
6
  • Backtracking, Branch & Bound Algorithms (V-U)
Advanced Algorithms Analysis and Design (V-U) Virtual University Dr. N. A. Zafar Applied Sciences
7
  • Breadth First Search: Shortest Paths (V-U)
Advanced Algorithms Analysis and Design (V-U) Virtual University Dr. N. A. Zafar Applied Sciences
8
  • Brute Force Approach: Introduction, Starting with Primality, Sorting Sequence of numbers (V-U)
Advanced Algorithms Analysis and Design (V-U) Virtual University Dr. N. A. Zafar Applied Sciences
9
  • Chain Matrix Multiplication Problem using Dynamic Programming (Cont.) (V-U)
Advanced Algorithms Analysis and Design (V-U) Virtual University Dr. N. A. Zafar Applied Sciences
10
  • Designing Algorithms using Brute Force and Divide & Conquer Approaches (V-U)
Advanced Algorithms Analysis and Design (V-U) Virtual University Dr. N. A. Zafar Applied Sciences
11
  • Designing Algorithms using Divide & Conquer Approaches (Cont.) (V-U)
Advanced Algorithms Analysis and Design (V-U) Virtual University Dr. N. A. Zafar Applied Sciences
12
  • Dijkstra's Algorithm: Problem Statement, Analysis, Correctness (V-U)
Advanced Algorithms Analysis and Design (V-U) Virtual University Dr. N. A. Zafar Applied Sciences
13
  • Dynamic Programming for Solving Optimization Problems: Chain Matrix Multiplication Problem (V-U)
Advanced Algorithms Analysis and Design (V-U) Virtual University Dr. N. A. Zafar Applied Sciences
14
  • Dynamic Programming: Optimal Binary Search Trees (Cont.) , Greedy Algorithms (V-U)
Advanced Algorithms Analysis and Design (V-U) Virtual University Dr. N. A. Zafar Applied Sciences
15
  • Fermat Theorem, Euler's Theorem, RSA Cryptosystem, String Matching Problem (V-U)
Advanced Algorithms Analysis and Design (V-U) Virtual University Dr. N. A. Zafar Applied Sciences
16
  • Fibonacci Sequences (V-U)
Advanced Algorithms Analysis and Design (V-U) Virtual University Dr. N. A. Zafar Applied Sciences
17
  • Further Techniques Solving Recurrence Relations (V-U)
Advanced Algorithms Analysis and Design (V-U) Virtual University Dr. N. A. Zafar Applied Sciences
18
  • Greedy Algorithms: Activity Selection Algorithm, Fractional Knapsack, Coin Change Making (V-U)
Advanced Algorithms Analysis and Design (V-U) Virtual University Dr. N. A. Zafar Applied Sciences
19
  • Greedy Algorithms: Huffman Coding (V-U)
Advanced Algorithms Analysis and Design (V-U) Virtual University Dr. N. A. Zafar Applied Sciences
20
  • Groups and Rings, Chinese Remainder Theorem, RSA Cryptosystem (V-U)
Advanced Algorithms Analysis and Design (V-U) Virtual University Dr. N. A. Zafar Applied Sciences
21
  • Huffman Coding Problem, Road Trip Problem, Graph Theoretic Concepts (V-U)
Advanced Algorithms Analysis and Design (V-U) Virtual University Dr. N. A. Zafar Applied Sciences
22
  • Introduction (V-U)
Advanced Algorithms Analysis and Design (V-U) Virtual University Dr. N. A. Zafar Applied Sciences
23
  • Logic and Proving Techniques (V-U)
Advanced Algorithms Analysis and Design (V-U) Virtual University Dr. N. A. Zafar Applied Sciences
24
  • Longest Common Subsequence, Optimal Binary Search Trees (V-U)
Advanced Algorithms Analysis and Design (V-U) Virtual University Dr. N. A. Zafar Applied Sciences
25
  • Mathematical Tools (V-U)
Advanced Algorithms Analysis and Design (V-U) Virtual University Dr. N. A. Zafar Applied Sciences