-
About the Course 0
No items in this section -
Computational Theory [Module 1] 30
-
1. Introduction to Finite State Machine-002 22 minLecture2.1
-
2. Finite State Machine Problem No. 1-001 12 minLecture2.2
-
3. Finite State Machine Problem No. 2-003 12 minLecture2.3
-
4. Finite State Machine Problem No. 3-004 14 minLecture2.4
-
5. Introduction to Deterministic Finite Automata ( DFA ) 18 minLecture2.5
-
6. Deterministic Finite Automata ( DFA ) Problem No. 1 ( Updated ) 12 minLecture2.6
-
7. Deterministic Finite Automata ( DFA ) Problem No. 2 10 minLecture2.7
-
8. Deterministic Finite Automata ( DFA ) Problem No. 3 12 minLecture2.8
-
9. Deterministic Finite Automata ( DFA ) Problem No. 4 09 minLecture2.9
-
Regula Expression and Regular Language 03 minLecture2.10
-
Operations on Language 11 minLecture2.11
-
Regular Expression to Regular Language 06 minLecture2.12
-
Regular Language to Regular Expression 10 minLecture2.13
-
Understanding the flow 02 minLecture2.14
-
15. RE to NFA with Epselon Transition using Thompsons COnstruction Method 16 minLecture2.15
-
16. RE to NFA with Epselon transition using Thompson’s Construction Method ( Part 2 ) 10 minLecture2.16
-
17. RLRE to Minimised DFA ( Direct Method ) 27 minLecture2.17
-
18. RLRE to Minimised DFA ( Imp State Method ) 24 minLecture2.18
-
19. Convert NFA with E-Transition to NFA without E-Transition 16 minLecture2.19
-
20. NFA Without E-Transition to DFA 15 minLecture2.20
-
21. Moore & Mealy Machine 22 minLecture2.21
-
22. Moore & Mealy Machine ( Problem 1 ) 09 minLecture2.22
-
PYQ : DFA #1 16 minLecture2.23
-
PYQ : DFA #2 11 minLecture2.24
-
PYQ : DFA #3 16 minLecture2.25
-
PYQ ; DFA #4 10 minLecture2.26
-
PYQ : DFA #5 18 minLecture2.27
-
PYQ : DFA #6 09 minLecture2.28
-
PYQ : Moore Machine Numerical 10 minLecture2.29
-
PYQ : Mealy Machine Numerical 11 minLecture2.30
-
-
Computational Theory [Module 2] 3
-
REGULAR EXPRESSIONS AND LANGUAGESLecture3.1
-
Pumping Lemma #1 10 minLecture3.2
-
Pumping Lemma #2 08 minLecture3.3
-
-
Computational Theory [Module 3] 22
-
23. Introduction to Grammar 09 minLecture4.1
-
24. RE – RL to Context Free Grammar 07 minLecture4.2
-
25. How to Convert RE RL to Context Free Grammar 15 minLecture4.3
-
26. LMD RMD & Parse Tree 13 minLecture4.4
-
27. Check whether the given grammar is an ambiguous grammar or not 07 minLecture4.5
-
28. Elimination of useless variable 12 minLecture4.6
-
29. Elimination of Null Production 11 minLecture4.7
-
30. Elimination of unit Production 04 minLecture4.8
-
31. Simplification of CFG 09 minLecture4.9
-
32. Introduction to Chomsky Normal Form 09 minLecture4.10
-
33. CFG to CNF ( Problem No. 1 )-004 11 minLecture4.11
-
34. CFG to CNF ( Problem No. 2 ) 05 minLecture4.12
-
35. CFG to CNF ( Problem No. 3 )-002 12 minLecture4.13
-
36. Introduction to Greibach Normal Form ( GNF ) 13 minLecture4.14
-
37. Convert CFG to GNF ( Problem No. 1 ) 09 minLecture4.15
-
38. Convert CFG to GNF ( Problem No. 2 ) 07 minLecture4.16
-
39. Convert CFG to GNF ( Problem No. 3 ) 04 minLecture4.17
-
40. Convert the following into CNF & GNF 05 minLecture4.18
-
PYQ : LMD and RMD Numerical 08 minLecture4.19
-
PYQ : Parse Tree & Grammar Ambiguity 07 minLecture4.20
-
PYQ : CFG to CNF with simplification 13 minLecture4.21
-
PYQ : CFG TO GNF 11 minLecture4.22
-
-
Computational Theory [Module 4] 7
-
41. Introduction to Push Down Automata 08 minLecture5.1
-
42. How to write commands in Push Down Automata 08 minLecture5.2
-
43. Push Down Automata ( Problem No. 1 ) 14 minLecture5.3
-
45. Convert FA ( DFA ) to PDA 11 minLecture5.4
-
46. Convert CFG to PDA 09 minLecture5.5
-
PYQ : Pushdown Automata – #1 17 minLecture5.6
-
PYQ : Pushdown Automata – #2 17 minLecture5.7
-
-
Computational Theory [Module 5] 3
-
44. Introduction to Turing Machine 15 minLecture6.1
-
Turing Machine – #1 08 minLecture6.2
-
Turing Machine – #2 11 minLecture6.3
-
-
Computational Theory [Module 6] 2
-
Halting Problem 09 minLecture7.1
-
47. Post Currospondance Problem ( PCP ) 05 minLecture7.2
-
-
Computational Theory CT IMP Soln 2026 6
-
MODULE 1-BASICS CONCEPTS AND REGULAR LANGUAGESLecture8.1
-
Module 2 – Finite AutomataLecture8.2
-
Module 3 – Context-Free GrammarsLecture8.3
-
Module 4 – Pushdown AutomataLecture8.4
-
Module 5 – Turing MachinesLecture8.5
-
Module 6 – DecidabilityLecture8.6
-
-
Computational Theory - Notes 6
-
BASIC CONCEPTS AND FINITE AUTOMATALecture9.1
-
REGULAR EXPRESSIONS AND LANGUAGESLecture9.2
-
GRAMMARSLecture9.3
-
PUSHDOWN AUTOMATALecture9.4
-
TURING MACHINELecture9.5
-
UNDECIDABILITYLecture9.6
-
-
Database Management System [Module 1]:- Introduction Database Concepts and Data Mode 5
-
Introduction to DBMS Basic Concept 07 minLecture10.1
-
Entity Relationship Modelling with solved example 09 minLecture10.2
-
Extended Entity Relationship Model with solved example 07 minLecture10.3
-
Keys 09 minLecture10.4
-
NotesLecture10.5
-
-
Database Management System [Module 2]:- Relational Model and relational Algebra 4
-
Keys 09 minLecture11.1
-
E-R To Relational Schema #1 19 minLecture11.2
-
E-R To Relational Schema #2 25 minLecture11.3
-
NotesLecture11.4
-
-
Database Management System [Module 3]:- Structured Query Language (SQL) 20
-
Introduction to SQL 07 minLecture12.1
-
Data definition language 10 minLecture12.2
-
DML ( data manipulation language ) 07 minLecture12.3
-
Aggregate Function in SQL 09 minLecture12.4
-
Types Of Joins & Inner Join 15 minLecture12.5
-
Left, Right & Full Join 05 minLecture12.6
-
SQL Queries | Solved Example – 1 17 minLecture12.7
-
SQL Queries | Solved Example – 2 17 minLecture12.8
-
SQL Queries | Solved Example – 3 12 minLecture12.9
-
SQL Queries | Solved Example – 4 15 minLecture12.10
-
SQL Queries | Solved Example – 5 09 minLecture12.11
-
PL SQL | part 1 | 08 minLecture12.12
-
PL SQL | part 2 | 08 minLecture12.13
-
Query Processing And Query Optimisation [Part 1] 11 minLecture12.14
-
Query Processing And Query Optimisation [Part 2] 09 minLecture12.15
-
Query Processing And Query Optimisation [Part 3] 06 minLecture12.16
-
Query Processing And Query Optimisation [Part 4] 03 minLecture12.17
-
Integrity Constraints 07 minLecture12.18
-
Trigger 08 minLecture12.19
-
NotesLecture12.20
-
-
Database Management System [Module 4]:- Database Normalization 5
-
Normalization and first normal form 1NF 10 minLecture13.1
-
Second Normal Form 2NF example 09 minLecture13.2
-
Third Normal Form 3NF with example 09 minLecture13.3
-
BCNF | Boyce Cod Normal Form | with example 10 minLecture13.4
-
NotesLecture13.5
-
-
Database Management System [Module 5]:- Transactions Management and Concurrence 9
-
Concurrency Control 09 minLecture14.1
-
Concurrency Control – Lock Based Protocol in DBMS Transaction 08 minLecture14.2
-
Timestamp Based Protocol 11 minLecture14.3
-
Deadlock Full concept in DBMS transaction management 12 minLecture14.4
-
Log Based Database Recovery 08 minLecture14.5
-
Transaction State and Acid Properties 05 minLecture14.6
-
View Serializability 05 minLecture14.7
-
Conflict Serializability 09 minLecture14.8
-
NotesLecture14.9
-
-
Database Management System [Module 6]:-Introduction to modern databases 3
-
IntroductionLecture15.1
-
NoSql Database 05 minLecture15.2
-
NotesLecture15.3
-
-
Database Management System [IMP] 6
-
Module 1 – Introduction To Database ConceptsLecture16.1
-
Module 2 – Entity-Relationship Data ModelLecture16.2
-
Module 3 – Relational Model & Relational AlgebraLecture16.3
-
Module 4 – Structured Query Language (SQL)Lecture16.4
-
Module 5 – Relational Database DesignLecture16.5
-
Module 6 – Transactions Management and Concurrency and RecoveryLecture16.6
-
-
Database Management System - Viva Questions with Answers Module wise 6
-
Introduction Database ConceptsLecture17.1
-
Entity–Relationship Data ModelLecture17.2
-
Relational Model and relational AlgebraLecture17.3
-
Structured Query LanguageLecture17.4
-
Relational-Database DesignLecture17.5
-
Transactions Management and ConcurrenceLecture17.6
-
-
Operating System M1 : Fundamentals of Operating System 3
-
Introduction to Operating System 18 minLecture18.1
-
Os Structure 18 minLecture18.2
-
System Calls and Its Types 10 minLecture18.3
-
-
Operating System M2 : Process Management 10
-
PCB ( Process Control Block ) 12 minLecture19.1
-
Process State Transition Diagram 13 minLecture19.2
-
Threading and Multi-Threading 09 minLecture19.3
-
Scheduler and Types of Process Scheduling Algorithm 13 minLecture19.4
-
Various Scheduling Criteria 21 minLecture19.5
-
SJF – Scheduling Criteria 16 minLecture19.6
-
Priority Scheduling Non-Preemptive 15 minLecture19.7
-
SRTN Scheduling Algo 18 minLecture19.8
-
Round Robin Scheduling Criteria 15 minLecture19.9
-
Priority Scheduling Preemptive 13 minLecture19.10
-
-
Operating System M3 : Process Synchronization and Deadlock 8
-
Deadlock 08 minLecture20.1
-
Semaphore Producer Consumer Problem 12 minLecture20.2
-
OS Reader Writer & Dinning Philospher Problem 16 minLecture20.3
-
Dining philosopher Problem Old Video 08 minLecture20.4
-
Critical Section Problem 07 minLecture20.5
-
Dead Lock Recovery 05 minLecture20.6
-
Bankers algorithm with Solve Example Part 1 13 minLecture20.7
-
Bankers (Resource Request algorithm) with Solve Example Part 2 09 minLecture20.8
-
-
Operating System M4 : MEMORY MANAGEMENT 8
-
Pagen Replacement Algorithms 20 minLecture21.1
-
Paging & TLB 17 minLecture21.2
-
Virtual Memory & Demand Paging 13 minLecture21.3
-
Memory Management & Partitioning 11 minLecture21.4
-
Memeory Allocation Techniques 10 minLecture21.5
-
Segmentation 14 minLecture21.6
-
Loading and Linking 04 minLecture21.7
-
FIFO,LRU AND OPTIMAL PAGE REPLACEMENT ALGORITHMS 20 minLecture21.8
-
-
Operating System M5 : File and IO Management 11
-
Disk scheduling Algorithm 06 minLecture22.1
-
FCFS Disk Scheduling Algorithm 09 minLecture22.2
-
SSTF Disk Scheduling Algorithm 07 minLecture22.3
-
SCAN Disk Scheduling Algorithm 06 minLecture22.4
-
C SCAN Disk Scheduling Algorithm 05 minLecture22.5
-
Look Disk Scheduling Algorithm 04 minLecture22.6
-
C Look Disk Scheduling Algorithm 04 minLecture22.7
-
FCFS SSTF SCAN CSCAN LOOK CLOOK Overview | Disk Scheduling Sums | All in One 08 minLecture22.8
-
Input Output Management 09 minLecture22.9
-
File Managment File System 09 minLecture22.10
-
Disk Allocation Methods 11 minLecture22.11
-
-
Operating System M6 : Special Purpose Operating System 4
-
Modern Operating System 12 minLecture23.1
-
Network Operating System 12 minLecture23.2
-
Real Time Operating System 11 minLecture23.3
-
Mobile Operating System 13 minLecture23.4
-
-
Operating System - Importance with Solution 11
-
Operating System Module vise IMPLecture24.1
-
IMP Module 1 SolutionLecture24.2
-
Process Scheduling Module 2 NumericalsLecture24.3
-
IMP Module 2 SolutionLecture24.4
-
Bankers algorithm Module 3 NumericalsLecture24.5
-
IMP Module 3 SolutionLecture24.6
-
IMP Module 4 SolutionLecture24.7
-
Page Replacement Numericals Module 4Lecture24.8
-
IMP Module 5 SolutionLecture24.9
-
IMP Module 6 SolutionLecture24.10
-
Operating System More QuestionLecture24.11
-
-
Operating System - Viva Questions with Answers Module wise 6
-
IntroductionLecture25.1
-
Process and process schedulingLecture25.2
-
Process Synchronization and DeadlocksLecture25.3
-
Memory ManagementLecture25.4
-
File ManagementLecture25.5
-
I/O ManagementLecture25.6
-
Introduction
1. What is an Operating system?
Ans:An operating system is a program that manages the computer hardware.It also provides a basis for application programs and acts as an intermediary between the computer user and the computer hardware.
2.What are the main objectives of the operating system?
Ans:The main objectives of the operating system are as follows: To make the computer system convenient to use in an efficient manner.
- To hide the details of the hardware resources from the users.
- To provide users a convenient interface to use the computer system.
- To act as an intermediary between the hardware and its users, making it easier for the users to access and use other resources.
- To manage the resources of a computer system.
- To keep track of who is using which resource, granting resource requests, and mediating conflicting requests from different programs and users.
- To provide efficient and fair sharing of resources among users and programs.
3.Explain the various evolution of operating systems.
Ans: The various evolution of an operating system are given below:
i)Serial Processing: was developed from 1940 to 1950’s programmers incorporated the hardware components without the implementation of the operating system.
ii)Batch Processing: is used by improving the utilization and application of computers. Jobs were scheduled and submitted on cards and tapes. Then sequentially executed on the monitors by using Job Control Language.
iii)Multiprogramming Multiprogramming is a technique to execute a number of programs simultaneously by a single processor. In multiprogramming, a number of processes reside in the main memory at a time.
iv)Time-Sharing System: Time-sharing or multitasking is a logical extension of
multiprogramming. Multiple jobs are executed by the CPU switching between
v)Parallel System: There is a trend of multiprocessor systems, such systems having more than one processor in close communication, sharing the computer bus, the clock, and sometimes memory and peripheral devices.
vi)Distributed System: In a distributed operating system, the processors cannot share a memory or a clock, each processor has its own local memory.
4.What Is Access Control ?
Ans:
Functions of the operating system:
i) Memory Management
ii)Processor Management/Scheduling
iii) Device Management
iv) File Management
v)Security
vi)Accounting
vii)Other functions
i )Memory Management: It is the management of the main or primary memory.
ii)Processor Management/Scheduling: When more than one process runs on the system the OS decides how and when a process will use the CPU. Hence, the name is also CPU Scheduling.
iii)Device Management: Device management in an operating system means controlling the Input/Output devices like disk, microphone, keyboard, printer, magnetic tape, USB ports, camcorder, scanner, other accessories, and supporting units like supporting units control channels.
iv)File Management: A file management system is used for file maintenance (or management) operations.
v)Security: The term operating system (OS) security refers to practices and measures that can ensure the confidentiality, integrity, and availability (CIA) of operating systems.
i)Accounting: The operating system keeps track of all the functions of a computer system. Hence, it makes a record of all the activities taking place on the system.
ii)Other functions: Some other functions of the OS can be:
- Error detection.
- keeping a record of system performance.
- Communication between different software etc.
5.Classify the operating system based on structure.
Ans:
)Simple structure: Such operating systems do not have a well-defined structure and are small, simple, and limited systems.
i)Layered structure:The layered structure approach breaks up the operating system into different layers and retains much more control on the system. The bottom layer (layer 0) is the hardware, and the topmost layer (layer N) is the user interface.
ii)Micro-kernel: structure designs the operating system by removing all non-essential components from the kernel and implementing them as system and user programs. This results in a smaller kernel called the micro-kernel.
v)Monolithic Approach: Functionality of the OS is invoked with simple function calls within the kernel, which is one large program.
6. What is Linux Kernel?
Ans:The Linux kernel is the main component of a Linux operating system (OS) and is the core interface between a computer’s hardware and its processes. It communicates between the two, managing resources as efficiently as possible.
7. What are the core subsystems of the Linux kernel?
Ans:The Core Subsystems of the Linux Kernel are as follows:
- The Process Scheduler
- The Memory Management Unit (MMU)
- The Virtual File System (VFS)
- The Networking Unit
- Inter-Process Communication Unit
8. Define System calls.
Ans:A system call is a routine that allows a user application to request actions that require special privileges. Adding system calls is one of several ways to extend the functions provided by the kernel.
9. What are the categories of System calls?
Ans: The followings are the main categories of System calls:
i) Process Control: running program needs to be able to stop execution either normally or abnormally. When execution is stopped abnormally, often a dump of memory is taken and can be examined with a debugger.
ii)File Management: Some common system calls are created, delete, read, write, reposition, or closed. Also, there is a need to determine the file attributes – get and set file attributes. Many times the OS provides an API to make these system calls.
iii)Device Management: Processes usually require several resources to execute, if these resources are available, they will be granted and control returned to the user process.
iv)Information Management: system calls exist purely for transferring information between the user program and the operating system. An example of this is time or date.
v)Communication: are two models of interprocess communication, the message-passing model and the shared memory model.
- Message-passing uses a common mailbox to pass messages between processes.
- Shared memory uses certain system calls to create and gain access to create and gain access to regions of memory owned by other processes. The two processes exchange information by reading and writing in the shared data.
10. What are the system calls used in OS?
Ans:There are the following system calls used in OS:
i)wait()
ii)fork()
iii)exec()
iv)kill()
v)exit()
11. What is the function of fork()?
Ans:Processes use fork() system call to create processes that are a copy of themselves. With the help of this system Call parent process creates a child process, and the execution of the parent process will be suspended till the child process executes.
12. What is kernel?
Ans:The kernel is a core component of an operating system and serves as the main interface between the computer’s physical hardware and the processes running on it. The kernel enables multiple applications to share hardware resources by providing access to CPU, memory, disk I/O, and networking.
13. What are User Mode and Kernel Mode?
Ans: User Mode: In User mode, the executing code has no ability to directly access hardware or reference memory. Code running in user mode must delegate to system APIs to access hardware or memory. Due to the protection afforded by this sort of isolation, crashes in user mode are always recoverable. Most of the code running on our computer will execute in user mode.
Kernel Mode: In Kernel mode, the executing code has complete and unrestricted access to the underlying hardware. It can execute any CPU instruction and reference any memory address. Kernel mode is generally reserved for the lowest-level, most trusted functions of the operating system. Crashes in kernel mode are catastrophic; they will halt the entire PC.

