16:50

Process Management - Part - D (Process Creation and Termination)

13:08

Process Management- Part-C (Types of Schedulers)

09:51

Process Management - Part - B (Process Control Block)

12:27

Process Management Part -A (Process state diagram)

06:41

CPU Scheduling - Part-G (Multilevel feedback queue)

06:05

CPU Scheduling - Part-F (Multilevel queue scheduling policy)

11:16

CPU Schduling - Part-E (Round robin scheduling)

03:17

CPU Scheduling - Part-D (Priority scheduling)

17:26

CPU Scheduling- Part-B (FCFS)

16:14

CPU Scheduling - Part-A (Introduction to CPU scheduling)

26:04

CPU Scheduling- Part-C (Shortest Job First and SRTF)

44:01

Process Management - up to Fork (class lecture)

18:25

Process Management- Part-F (Process Inter Process Communication (IPC) - Using Pipes)

32:53

Lecture 6: Process Synchronization Part-II (Peterson and Bakery Algorithms)

33:45

Lecture 5: Process Synchronization Part-I

01:58:19

Lecture 4: CPU Scheduling (FCFS, SJF, SRTF, Priority, Multilevel, Multilevel Feedback)

01:36:11

Lecture 3: Process Management (Complete Chapter)

21:16

Lecture 2: Types of Operating System

36:14

Lecture 1: Introduction to Operating System ( Responsibilities of OS)

30:05

Binomial Heap: Part 2 (UNION operation, INSERT, EXTRACT_MIN etc.)

28:03

Binomial heap : Part-1 (Properties, Representation and Operations)

17:51

Binary Heaps as a Priority Queue

08:11

Tighter Analysis of BUILD MAX HEAP procedure

09:24

Heap Sort

19:30

Max-Heapify and Build_Max_Heap Procedure

16:11

Binary Heaps - Min Heap and Max Heaps

14:43

Binary Tree, Complete Binary Tree and Fully Complete Binary Tree

16:47

Asymptotic Notations- Big O, Big Omega, and Theta

22:35

Introduction to Algorithms

13:29

Introduction to Algorithms - Part 2

12:18

Binary Search

24:44

Analysis of Algorithm to find Maximum and Minimum element from an Array - Part 2

13:57

Analysis of Algorithm to find Maximum and Minimum element from an Array-Part -1

17:56

Divide and conquer Algorithms - An Introduction

27:35

Arithmetic Progression - Important Questions Set-2

17:06

Important Questions based on Arithmetic Progression with solution

13:45

Tree Method for solving recurrence relations

08:36

Question Based on Iteration Method -1

07:15

Question Based on Iteration Method -2

13:36

Iteration Method With Solved Examples

05:36

Solving Recurrence Relation of an Algorithm- Introduction

13:19

Wordpress Cloudflare Flexible SSL HTTPS Setup

12:47

Array Basics - Memory map perspective

19:06

OOSP Presentation: Java Swings

11:51

OOSP Presentation: JDBC by Example

36:01

Normal Forms ( 1NF, 2NF, 3NF, BCNF)

27:28

Cannonical cover of Functional dependancies or Minimal Cover

20:14

Attribute Closure and Candidate keys

20:40

Functional Dependancy in RDBMS

12:45

Schema Refinement (Normalization)

11:24

Key Concepts in DBMS

07:08

Wireless sensor networks lab: TelosB mote Hardware description

21:14

Wireless sensor networks lab: TinyOS Introduction

05:24

How to change/create the Internet passward (IPIN) for city bank credit card

23:47

Build and run applet using appletviewer and web browser- Part 1

07:28

How to make Portable Java Development Kit JDK in Hindi

19:56

printf() and Expression evaluation of increment and decrement operators|GCC compiler|Turbo C++

09:28

Debugging C program in Code Blocks IDE

06:14

How to create C projects in Code Blocks