Vikash Katariya

BCC#22 Function of Operating System
BCC#22 Function of Operating System
BCC#21 Basics of OS & Overview of OS
BCC#21 Basics of OS & Overview of OS
BCC#20 Addressing Part 2
BCC#20 Addressing Part 2
BCC#19 Addressing Modes of 8086 Part-1
BCC#19 Addressing Modes of 8086 Part-1
BCC#18 CPU Registers
BCC#18 CPU Registers
BCC#17 Basic Computer Instruction Format Part 2
BCC#17 Basic Computer Instruction Format Part 2
BCC#16 Basic Computer Instructions Format
BCC#16 Basic Computer Instructions Format
BCC#15 Types of IO Module Part 2
BCC#15 Types of IO Module Part 2
BCC#14 Types of IO module Part 1
BCC#14 Types of IO module Part 1
BCC#12 Interrupt Part-2
BCC#12 Interrupt Part-2
BCC#11 Interrupt Part 1
BCC#11 Interrupt Part 1
BCC#10 Bus Structure Part 2
BCC#10 Bus Structure Part 2
BCC#9 Bus Structure Part 1
BCC#9 Bus Structure Part 1
BCC#8 Types of Actions Performed by Instruction
BCC#8 Types of Actions Performed by Instruction
L#17 Greedy Method Part 4 Prims & Krushkal
L#17 Greedy Method Part 4 Prims & Krushkal
L#16 Greedy Method Part 3 MST & Prim's Algorithm
L#16 Greedy Method Part 3 MST & Prim's Algorithm
L#15 Greedy Method Part 2 (Job Sequencing Problem)
L#15 Greedy Method Part 2 (Job Sequencing Problem)
L#14 Introduction of Greedy Method & Knapsack Problem
L#14 Introduction of Greedy Method & Knapsack Problem
L#13 Divide & Conquer Part-6, Strassen's Matrices Part 2
L#13 Divide & Conquer Part-6, Strassen's Matrices Part 2
L#12 Divide & Conquer Part-5, Strassen's Matrices Part 1
L#12 Divide & Conquer Part-5, Strassen's Matrices Part 1
L#11 Divide & Conquer Part-4 (Quick Sort)
L#11 Divide & Conquer Part-4 (Quick Sort)
L#10 Divide & Conquer Part-3
L#10 Divide & Conquer Part-3
L#9 Divide & Conquer Part 2
L#9 Divide & Conquer Part 2
L#8 Divide & Conquer Strategies Part-1
L#8 Divide & Conquer Strategies Part-1
L#7 Recursion & Recurrence Relation
L#7 Recursion & Recurrence Relation
L#6 Analysis of Time Complexity Part 2
L#6 Analysis of Time Complexity Part 2
L#5 Analysis of Time complexity Part-1
L#5 Analysis of Time complexity Part-1
L#4 Asymptotic Notation (Big Omega & Big Theta) Part 2
L#4 Asymptotic Notation (Big Omega & Big Theta) Part 2
L#3 Asymptotic Notation (Big O) Part-1
L#3 Asymptotic Notation (Big O) Part-1
L#2 Factorization Method & Euclid Method to find GCD
L#2 Factorization Method & Euclid Method to find GCD