Madhusudhan M V - VideoAndMovie

Part 50 - AVL Trees

1:04:21

Part 50 - AVL Trees

Part 49 - Limitations of Algorithemic Power, Trivial Lower Bound(LB) and other 3 methods to find LB

25:21

Part 49 - Limitations of Algorithemic Power, Trivial Lower Bound(LB) and other 3 methods to find LB

Part 48 - Travelling Salesperson Problem (TSP) using Branch & Bound Technique

33:40

Part 48 - Travelling Salesperson Problem (TSP) using Branch & Bound Technique

Part 47 - Greedy Knapsack ( Fractional Knapsack)

32:40

Part 47 - Greedy Knapsack ( Fractional Knapsack)

Part 46 - Tower of Hanoi

27:33

Part 46 - Tower of Hanoi

Part 28 - Binary Division Using Restoring Method

16:56

Part 28 - Binary Division Using Restoring Method

Part 27 - Booth's Algorithm

21:45

Part 27 - Booth's Algorithm

Part 26 - Shift & Add Method for Multiplication (Sequential Multiplication)

22:01

Part 26 - Shift & Add Method for Multiplication (Sequential Multiplication)

Part 25 - Carry Look Ahead Adder (Fast Adder)

28:15

Part 25 - Carry Look Ahead Adder (Fast Adder)

Part 24 - N Bit Ripple Carry Adder

29:04

Part 24 - N Bit Ripple Carry Adder

Part 23 - Direct Memory Access (DMA)

18:01

Part 23 - Direct Memory Access (DMA)

Part 22 - Interrupt I/O

8:19

Part 22 - Interrupt I/O

Part 21 - I/O Communication Techniques: Program Controlled I/O

15:23

Part 21 - I/O Communication Techniques: Program Controlled I/O

Part 20 - I/O Mapping Techniques: Memory Mapped I/O vs I/O Mapped I/O

17:14

Part 20 - I/O Mapping Techniques: Memory Mapped I/O vs I/O Mapped I/O

Part 19 - I/O Interface

13:24

Part 19 - I/O Interface

Part 18 - Direct Mapping, Associative Mapping & Set-Associative Mapping

31:57

Part 18 - Direct Mapping, Associative Mapping & Set-Associative Mapping

Part 17 - Cache - Memory Mapping Functions

10:30

Part 17 - Cache - Memory Mapping Functions

Part 16 - Locality of Reference, Copy-Through & Copy-Back Protocols.

26:06

Part 16 - Locality of Reference, Copy-Through & Copy-Back Protocols.

Part 15 - Internal Organization of Memory (RAM)

35:01

Part 15 - Internal Organization of Memory (RAM)

Part 14 - Subroutines & Nested Subroutines

22:11

Part 14 - Subroutines & Nested Subroutines

Part 13 - Safe Push and Safe Pop

27:18

Part 13 - Safe Push and Safe Pop

Part 12 - Index & Relative Addressing Modes

17:54

Part 12 - Index & Relative Addressing Modes

Part 11 - Indirect Addressing Mode

10:15

Part 11 - Indirect Addressing Mode

Part 10 - Immediate, Register and Direct Addressing Modes

10:06

Part 10 - Immediate, Register and Direct Addressing Modes

Part 9 - Addressing Modes and it's Types

9:27

Part 9 - Addressing Modes and it's Types

Part 8 - Instructions & Instruction Types

28:25

Part 8 - Instructions & Instruction Types

Part 7 - Byte Addressability, Big- Endian & Little- Endian

11:20

Part 7 - Byte Addressability, Big- Endian & Little- Endian

Part 6 - Number Representation, Binary Addition & Binary Subtraction

32:14

Part 6 - Number Representation, Binary Addition & Binary Subtraction

Part 17- C Program to find grade of a student

12:36

Part 17- C Program to find grade of a student

Part 5 - Performance Equation & Problems on it

16:31

Part 5 - Performance Equation & Problems on it