04:36

DFA Complement Example

05:06

DFA Example|String length is a multiple of n

05:49

DFA Example|no of a's is a multiple of n

08:47

DFAExample|Binary no divisible by n

06:44

DFA Complement

06:54

DFA Example|TOC|Tutorial9|Strings containing a substring

11:12

DFA Example|TOC|Tutorial8|Strings ending with a substring

10:53

DFA Example|TOC|Tutorial7|Strings beginning with the given substring

07:02

Introduction to DFA|Theory Of Computation|Tutorial6

06:21

Intro to Finite Automata|Theory Of Computation|Tutorial5

05:37

Automata|TOC|Tutorial4

04:50

Grammar|TOC|Tutorial 3

06:38

Language|TOC|Tutorial2

10:23

Introduction to TOC-Tutorial1

09:47

Introduction to Theory Of Computation|Why do we study TOC|Basic topics

03:42

gate question deadlock 1997

04:46

Gate question on deadlock 1998

10:47

Gate questions on Semaphore and Precedence

10:12

Processes and Threads|Operating System

03:49

Deadlock detection with wait for graph|Single Instance Resource System

06:16

Deadlock Detection-part1|Introduction|Using RAG and Bankers Algorithm

08:49

User mode and Kernel Mode|Dual Mode of Execution

06:24

Process Queues|Process Scheduling Queues|Operating System

09:19

Scheduling and Types of Schedulers|Long term Scheduler|Short term Scheduler|Medium term Scheduler

08:46

Context Switching in Operating System|Process Management

13:10

Process States and State Transition Diagram

08:44

PCB|Process Control Block|Task Control Block

11:20

Introduction to Process Management

10:50

Deadlock Avoidance with Resource Allocation Graph

09:04

Resource Allocation Graph|MultiInstance|Deadlock state

12:06

Resource Allocation Graph|Single Instance RAG|Describing Deadlock

11:44

Bankers Algorithm for Deadlock Avoidance|Deadlock Avoidance Schemes

15:51

Bankers Algorithm Safe state Unsafe state|Deadlock Avoidance

08:55

Introduction to Deadlock Avoidance|deadlock avoidance vs deadlock prevention|handling deadlock

07:20

Dining Philosophers problem solution- part2|Classic Problems of Synchronization

12:44

Introduction to Deadlock|Necessary Conditions for Deadlock|Handling Deadlock

09:07

Dining Philosophers problem-part1|Classic Problems of Synchronization

12:33

Reader writer problem solution with Binary Semaphore

03:34

FLSM Practice Question|IP Addressing and Subnetting

10:12

Bounded waiting mutual exclusion with Test And Set Instruction|Hardware Synchronization Solutions

05:25

GateQuestiononTestAndSetInstruction|Gate questions discussion part5

09:35

SwapInstruction|Hardware Synchronization Mechanisms

03:50

Practice Question Fixed Length Subnet Masking|Subnetting|IP Addressing

03:15

Practice Question|Fixed Length Subnetting|IP Addressing and Subnetting

11:06

TestAndSet Instruction|Hardware Synchronizaton Solutions

02:01

Practice Question|Fixed Length Subnet Masking|IP Addressing and Subnetting

11:04

Gate Question on n process solution or Bakery algorithm|Gate Questions discussion part4

10:00

Gate Questions with topics discussion|Process Synchronization-part3

06:52

Gate Questions with topics discussion-Process Synchronization part2

13:49

Gate Questions and topics discussion|Process Synchronization-part1

05:01

Cloud Computing-Tutorial7|SaaS|Software A A Service|Cloud Service Models

03:51

Practice Question|Fixed Length Subnet Masking|Subnetting

06:58

Fixed Length Subnetting-part3|Subnetting in Classful IP Addressing

09:27

Fixed Length Subnetting-part2|Subnetting in Classful IP Addressing

06:09

Fixed Length Subnetting-part1|Subnetting in Classful IP Addressing

06:58

Introduction|Subnetting in Classful IP Addressing

06:06

Private IP AddressesIClassful IP Addressing

06:28

Practice question on Class A Class B Class C |Classful IP Addressing

04:51

Class D and class E|Classful IP Addressing

04:55

Cloud Computing-Tutorial7|PaaS|Platform As A Service|Cloud Service Models