Канал: Ahmad Qawasmeh

Algorithms Lecture 32: Minimum Spanning Tree (Prim Algorithm)

Algorithms Lecture 32: Minimum Spanning Tree (Prim Algorithm)

Digital Logic Lecture 35: Sequential and Combinational Extra Examples

Digital Logic Lecture 35: Sequential and Combinational Extra Examples

Digital Logic Lecture 34: Sequential and Combinational Example 1

Digital Logic Lecture 34: Sequential and Combinational Example 1

Digital Logic Lecture 33: Flip Flops 2

Digital Logic Lecture 33: Flip Flops 2

Digital Logic Lecture 32: Flip Flops 1

Digital Logic Lecture 32: Flip Flops 1

Digital Logic Lecture 31: Extra Questions on Decoders and Multiplexers

Digital Logic Lecture 31: Extra Questions on Decoders and Multiplexers

Digital Logic Lecture 30: Decoders (Active-High and Active-Low)

Digital Logic Lecture 30: Decoders (Active-High and Active-Low)

Digital Logic Lecture 29: Multiple Multiplexers

Digital Logic Lecture 29: Multiple Multiplexers

Digital Logic Lecture 28: Multiplexer 4

Digital Logic Lecture 28: Multiplexer 4

Digital Logic Lecture 27: Multiplexer 3

Digital Logic Lecture 27: Multiplexer 3

Digital Logic Lecture 26: Multiplexer 2

Digital Logic Lecture 26: Multiplexer 2

Digital Logic Lecture 25: Multiplexer 1

Digital Logic Lecture 25: Multiplexer 1

Digital Logic Lecture 24: Design of Full Adder using Half Adders

Digital Logic Lecture 24: Design of Full Adder using Half Adders

Digital Logic Lecture 23: Four-bits Parallel Adder-Subtractor

Digital Logic Lecture 23: Four-bits Parallel Adder-Subtractor

Digital Logic Lecture 22: Combinational Circuits-Design procedure-Adder-Subtractor-Multiplier

Digital Logic Lecture 22: Combinational Circuits-Design procedure-Adder-Subtractor-Multiplier

Digital Logic Lecture 21: NAND-NOR Implementation

Digital Logic Lecture 21: NAND-NOR Implementation

Digital Logic Lecture 20: K-Map Simplification in PoS Format

Digital Logic Lecture 20: K-Map Simplification in PoS Format

Digital Logic Lecture 19: K-Map Don't Care and Prime Implicants in SoP

Digital Logic Lecture 19: K-Map Don't Care and Prime Implicants in SoP

Digital Logic Lecture 18: K-Maps Simplification in SoP Format

Digital Logic Lecture 18: K-Maps Simplification in SoP Format

Digital Logic Lecture 17: Rules of K Maps Simplification

Digital Logic Lecture 17: Rules of K Maps Simplification

Digital Logic Lecture 16: Construction of K Maps

Digital Logic Lecture 16: Construction of K Maps

Digital Logic Lecture 15: Minterm and Maxterm Formats 2

Digital Logic Lecture 15: Minterm and Maxterm Formats 2

Digital Logic Lecture 14: Minterm and Maxterm Formats 1

Digital Logic Lecture 14: Minterm and Maxterm Formats 1

Digital Logic Lecture 13: Duality and Conversion between SoP and PoS

Digital Logic Lecture 13: Duality and Conversion between SoP and PoS

Digital Logic Lecture 12: Simplification using Boolean Laws

Digital Logic Lecture 12: Simplification using Boolean Laws

Digital Logic Lecture 11: SoP and PoS Formats and Derivation

Digital Logic Lecture 11: SoP and PoS Formats and Derivation

Digital Logic Lecture 10: Boolean Expressions 2

Digital Logic Lecture 10: Boolean Expressions 2

Digital Logic Lecture 9: Boolean Expressions 1

Digital Logic Lecture 9: Boolean Expressions 1

Digital Logic Lecture 8: IEEE Floating Point Representation

Digital Logic Lecture 8: IEEE Floating Point Representation

Digital Logic Lecture 7: Arithmetic Operations on Signed Numbers

Digital Logic Lecture 7: Arithmetic Operations on Signed Numbers

Digital Logic Lecture 6: Signed Numbers Methods

Digital Logic Lecture 6: Signed Numbers Methods

Digital Logic Lecture 5: Arithmetic Operations

Digital Logic Lecture 5: Arithmetic Operations

Digital Logic Lecture 4: Numbering Systems 4

Digital Logic Lecture 4: Numbering Systems 4

Digital Logic Lecture 3: Numbering Systems 3

Digital Logic Lecture 3: Numbering Systems 3

Digital Logic Lecture 2: Numbering Systems 2

Digital Logic Lecture 2: Numbering Systems 2

Digital Logic Lecture 1: Numbering Systems 1

Digital Logic Lecture 1: Numbering Systems 1

Algorithms Lecture 31: Shortest Path Problem (Dijkstra Algorithm)

Algorithms Lecture 31: Shortest Path Problem (Dijkstra Algorithm)

Algorithms Lecture 30: Shortest Path Problem (Bellman Ford Algorithm)

Algorithms Lecture 30: Shortest Path Problem (Bellman Ford Algorithm)

Algorithms Lecture 29: Introduction to Shortest Path Problem

Algorithms Lecture 29: Introduction to Shortest Path Problem

Algorithms Lecture 28: Minimum Spanning Tree (Kruskal Algorithm)

Algorithms Lecture 28: Minimum Spanning Tree (Kruskal Algorithm)

Algorithms Lecture 27: Depth First Search

Algorithms Lecture 27: Depth First Search

Algorithms Lecture 26: Breadth First Search

Algorithms Lecture 26: Breadth First Search

Algorithms Lecture 25: Graph Representation Methods

Algorithms Lecture 25: Graph Representation Methods

Algorithms Lecture 24: Introduction to Graph Theory

Algorithms Lecture 24: Introduction to Graph Theory

Algorithms Lecture 23: Activity Selection Problem

Algorithms Lecture 23: Activity Selection Problem

Algorithms Lecture 22: 0-1 Knapsack Problem

Algorithms Lecture 22: 0-1 Knapsack Problem

Algorithms Lecture 21: Greedy Algorithms (Fractional Knapsack Problem)

Algorithms Lecture 21: Greedy Algorithms (Fractional Knapsack Problem)

Algorithms Lecture 20: Longest Common Subsequence

Algorithms Lecture 20: Longest Common Subsequence

Algorithms Lecture 19: Memoization with Coding Example

Algorithms Lecture 19: Memoization with Coding Example

Algorithms Lecture 18: Matrix Chain Multiplication

Algorithms Lecture 18: Matrix Chain Multiplication

Algorithms Lecture 17: Introduction to Dynamic Programming

Algorithms Lecture 17: Introduction to Dynamic Programming

Algorithms Lecture 16: Red Black Tree 2 (Insertion Examples)

Algorithms Lecture 16: Red Black Tree 2 (Insertion Examples)

Algorithms Lecture 15: Red Black Tree (1)

Algorithms Lecture 15: Red Black Tree (1)

Algorithms Lecture 14: Binary Search Tree

Algorithms Lecture 14: Binary Search Tree

Algorithms Lecture 13: Heap Sort

Algorithms Lecture 13: Heap Sort

Algorithms Lecture 12: Quick Sort

Algorithms Lecture 12: Quick Sort

Algorithms Lecture 11: Divide and Conquer (Merge Sort)

Algorithms Lecture 11: Divide and Conquer (Merge Sort)

Algorithms Lecture 10: Insertion Sort

Algorithms Lecture 10: Insertion Sort

Algorithms Lecture 9: Recurrence Relations Revision

Algorithms Lecture 9: Recurrence Relations Revision

Algorithms Lecture 8: Master Method

Algorithms Lecture 8: Master Method

Algorithms Lecture 7: Recursion Tree Method

Algorithms Lecture 7: Recursion Tree Method

Algorithms Lecture 6: Substitution Method

Algorithms Lecture 6: Substitution Method

Algorithms Lecture 5: Iteration Method

Algorithms Lecture 5: Iteration Method

Algorithms Lecture 4: Introduction to Recursive Methods

Algorithms Lecture 4: Introduction to Recursive Methods

Algorithms Lecture 3: Asymptotic Notations

Algorithms Lecture 3: Asymptotic Notations

Algorithms Lecture 2: Complexity Analysis

Algorithms Lecture 2: Complexity Analysis

Algorithms Lecture 1: Introduction to Algorithms Course

Algorithms Lecture 1: Introduction to Algorithms Course

Shortest Path Problem (Bellman-Ford and Dijkstra Algorithms)

Shortest Path Problem (Bellman-Ford and Dijkstra Algorithms)

Minimum Spanning Tree (Kruskal Algorithm)

Minimum Spanning Tree (Kruskal Algorithm)

Dynamic Programming: Longest Common Subsequences

Dynamic Programming: Longest Common Subsequences

Matrix Chain Multiplication (Memoization and Optimal Parenthesization)

Matrix Chain Multiplication (Memoization and Optimal Parenthesization)

Greedy Algorithms: Activity Selection Problem

Greedy Algorithms: Activity Selection Problem

Introduction to Graph Theory

Introduction to Graph Theory

Searching in Graphs: Breadth-First Search

Searching in Graphs: Breadth-First Search

Searching in Graphs: Depth-First Search

Searching in Graphs: Depth-First Search

Greedy Algorithms: Knapsack Problem

Greedy Algorithms: Knapsack Problem

Dynamic Programming: Matrix-Chain-Multiplication (2)

Dynamic Programming: Matrix-Chain-Multiplication (2)

Dynamic Programming: Matrix-Chain-Multiplication (1)

Dynamic Programming: Matrix-Chain-Multiplication (1)

Red-Black Tree (Insertion 1)

Red-Black Tree (Insertion 1)

Red-Black Tree (Insertion 2)

Red-Black Tree (Insertion 2)

Red-Black Tree Algorithm (1)

Red-Black Tree Algorithm (1)

Heap Sorting

Heap Sorting

Quick Sorting

Quick Sorting

Merge Sorting

Merge Sorting

Insertion Sorting

Insertion Sorting

Recurrence Relations: Recursion-Tree Method

Recurrence Relations: Recursion-Tree Method

Summation Formulas and Mathematical Induction

Summation Formulas and Mathematical Induction

Recurrence Relations: Master Method

Recurrence Relations: Master Method

Recurrence Relations: Substitution Method

Recurrence Relations: Substitution Method

Recurrence Relations: Iteration Method

Recurrence Relations: Iteration Method

Algorithms: Asymptotic Notations

Algorithms: Asymptotic Notations

Introduction to Algorithms Course

Introduction to Algorithms Course