Lecture

Right Arrow

SEARCH COURSES / LECTURES

Left Arrow

Advanced Algorithms Analysis and Design (V-U)

(45 Lectures Available)

S# Lecture Course Institute Instructor Discipline
26
  • Minimal Spanning Tree Problem, Kruskal's Algorithm, Prim's Algorithm (V-U)
Advanced Algorithms Analysis and Design (V-U) Virtual University Dr. N. A. Zafar Applied Sciences
27
  • NP Completeness: Circuit Satisfiability, Proof: Formula Satisfiability, 3-CNF, Clique (V-U)
Advanced Algorithms Analysis and Design (V-U) Virtual University Dr. N. A. Zafar Applied Sciences
28
  • Number Theoretic Algorithms: Definitions and Some Important Results (V-U)
Advanced Algorithms Analysis and Design (V-U) Virtual University Dr. N. A. Zafar Applied Sciences
29
  • Number Theoretic Algorithms: GCD, Euclid's Algorithm, Groups and Rings (V-U)
Advanced Algorithms Analysis and Design (V-U) Virtual University Dr. N. A. Zafar Applied Sciences
30
  • Optimal Weight Triangulation using Dynamic Programming (V-U)
Advanced Algorithms Analysis and Design (V-U) Virtual University Dr. N. A. Zafar Applied Sciences
31
  • Polynomials and Fast Fourier Transform: Representation of Polynomials, The DFT and FFT (V-U)
Advanced Algorithms Analysis and Design (V-U) Virtual University Dr. N. A. Zafar Applied Sciences
32
  • Proof of Breadth First Search Algorithm, Depth First Search (V-U)
Advanced Algorithms Analysis and Design (V-U) Virtual University Dr. N. A. Zafar Applied Sciences
33
  • Proof of White Path Theorem, Applications of Depth First Search (V-U)
Advanced Algorithms Analysis and Design (V-U) Virtual University Dr. N. A. Zafar Applied Sciences
34
  • Proof: Bellman Ford Algorithm, Shortest Paths in Directed Acyclic Graphs (V-U)
Advanced Algorithms Analysis and Design (V-U) Virtual University Dr. N. A. Zafar Applied Sciences
35
  • Proofs, Validation, Verification (V-U)
Advanced Algorithms Analysis and Design (V-U) Virtual University Dr. N. A. Zafar Applied Sciences
36
  • Recurrence Relations: Algorithms Design and Analysis Techniques (V-U)
Advanced Algorithms Analysis and Design (V-U) Virtual University Dr. N. A. Zafar Applied Sciences
37
  • Recurrence Relations: Mathematical Models, Analysis Techniques (V-U)
Advanced Algorithms Analysis and Design (V-U) Virtual University Dr. N. A. Zafar Applied Sciences
38
  • Relations over Asymptotic Notations (V-U)
Advanced Algorithms Analysis and Design (V-U) Virtual University Dr. N. A. Zafar Applied Sciences
39
  • Review Lecture 1-44 (V-U)
Advanced Algorithms Analysis and Design (V-U) Virtual University Dr. N. A. Zafar Applied Sciences
40
  • Review Lectures 1-21 (V-U)
Advanced Algorithms Analysis and Design (V-U) Virtual University Dr. N. A. Zafar Applied Sciences
41
  • Road Map Problem, Paths and Shortest Paths, Bellman-Ford Algorithm (V-U)
Advanced Algorithms Analysis and Design (V-U) Virtual University Dr. N. A. Zafar Applied Sciences
42
  • String Matching: Naive Algorithm, Rabin-Karp Algorithm, String Match with Finite Automata (V-U)
Advanced Algorithms Analysis and Design (V-U) Virtual University Dr. N. A. Zafar Applied Sciences
43
  • Strong Math Induction (V-U)
Advanced Algorithms Analysis and Design (V-U) Virtual University Dr. N. A. Zafar Applied Sciences
44
  • The Floyd-Warshall Algorithm, Johnson's Algorithm (V-U)
Advanced Algorithms Analysis and Design (V-U) Virtual University Dr. N. A. Zafar Applied Sciences
45
  • Time Complexity Measuring Notations (V-U)
Advanced Algorithms Analysis and Design (V-U) Virtual University Dr. N. A. Zafar Applied Sciences