SCCI Digital Library and Forum
Menu
Home
About Us
Video Library
eBooks
SCCI Forum
Home
»
Applied Sciences
»
Computer Science
»
Advanced Algorithms Analysis and Design (V-U)
»
Greedy Algorithms: Huffman Coding (V-U)
Greedy Algorithms: Huffman Coding (V-U)
Course:
Advanced Algorithms Analysis and Design (V-U)
Discipline:
Applied Sciences
Institute:
Virtual University
Instructor(s):
Dr. N. A. Zafar
Level:
Graduate
Advanced Algorithms Analysis and Design (V-U)
0-1 Knapsack Problem using Dynamic Programming (V-U)
0-1 Knapsack Problem's Algorithm using Dynamic Programming, Optimal Weight Triangulation (V-U)
2-Line Assembly Scheduling Problem, n-Line Assembly Scheduling Problem (V-U)
All-Pairs Shortest Paths, Shortest Paths and Matrix Multiplication (V-U)
Assembly-Line Scheduling Problem (V-U)
Backtracking, Branch & Bound Algorithms (V-U)
Breadth First Search: Shortest Paths (V-U)
Brute Force Approach: Introduction, Starting with Primality, Sorting Sequence of numbers (V-U)
Chain Matrix Multiplication Problem using Dynamic Programming (Cont.) (V-U)
Designing Algorithms using Brute Force and Divide & Conquer Approaches (V-U)
Designing Algorithms using Divide & Conquer Approaches (Cont.) (V-U)
Dijkstra's Algorithm: Problem Statement, Analysis, Correctness (V-U)
Dynamic Programming for Solving Optimization Problems: Chain Matrix Multiplication Problem (V-U)
Dynamic Programming: Optimal Binary Search Trees (Cont.) , Greedy Algorithms (V-U)
Fermat Theorem, Euler's Theorem, RSA Cryptosystem, String Matching Problem (V-U)
Fibonacci Sequences (V-U)
Further Techniques Solving Recurrence Relations (V-U)
Greedy Algorithms: Activity Selection Algorithm, Fractional Knapsack, Coin Change Making (V-U)
Greedy Algorithms: Huffman Coding (V-U)
Groups and Rings, Chinese Remainder Theorem, RSA Cryptosystem (V-U)