Dining Philosophers problem-part1|Classic Problems of Synchronization

DFA Complement Example

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

DFA Example|String length is a multiple of n

DFA Complement

DFAExample|Binary no divisible by n

DFA Example|TOC|Tutorial9|Strings containing a substring

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

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

Introduction to DFA|Theory Of Computation|Tutorial6

Intro to Finite Automata|Theory Of Computation|Tutorial5

Automata|TOC|Tutorial4

Grammar|TOC|Tutorial 3

Language|TOC|Tutorial2

Introduction to TOC-Tutorial1

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

gate question deadlock 1997

Gate question on deadlock 1998

Gate questions on Semaphore and Precedence

Processes and Threads|Operating System

Deadlock detection with wait for graph|Single Instance Resource System

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

User mode and Kernel Mode|Dual Mode of Execution

Process Queues|Process Scheduling Queues|Operating System

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