-
About the Course
This Course is Only Available On Our App
Dive-in and start learning! Get offline access to all the course contents!
No items in this section -
Database Management System [Module 1]:- Introduction Database Concepts
-
Database Management System [Module 2]:- Entity–Relationship Data Model
-
Database Management System [Module 3]:-Relational Model and relational Algebr
-
Database Management System [Module 4]:- Structured Query Language (SQL)
- Introduction to SQL
- Data definition language
- DML ( data manipulation language )
- DRL ( Data Retrieval Language)
- Aggregate Function in SQL
- PL SQL | part 1 |
- PL SQL | part 2 |
- Query Processing And Query Optimisation [Part 1]
- Query Processing And Query Optimisation [Part 2]
- Query Processing And Query Optimisation [Part 3]
- Query Processing And Query Optimisation [Part 4]
- Integrity Constraints
- Trigger
- Types Of Joins & Inner Join
- Left, Right & Full Join
- SQL Queries | Solved Example – 1
- SQL Queries | Solved Example – 2
- SQL Queries | Solved Example – 3
- SQL Queries | Solved Example – 4
- SQL Queries | Solved Example – 5
- Notes
-
Database Management System [Module 5]:- Relational-Database Design
-
Database Management System [Module 6 ]:- Transactions Management and Concurrence
- Concurrency Control
- Concurrency Control – Lock Based Protocol in DBMS Transaction
- Timestamp Based Protocol
- Deadlock Full concept in DBMS transaction management
- Shadow Paging in Database Recovery
- Log Based Database Recovery
- Shadow Copy Technique in Database recovery
- Transaction State and Acid Properties
- Transaction Schedule
- View Serializability
- Conflict Serializability
- Notes
-
Database Management System - Viva Questions with Answers Module wise
-
Database Management System [IMP]
-
Computational Theory [Module 1]
- 1. Introduction to Finite State Machine-002
- 2. Finite State Machine Problem No. 1-001
- 3. Finite State Machine Problem No. 2-003
- 4. Finite State Machine Problem No. 3-004
- 5. Introduction to Deterministic Finite Automata ( DFA )
- 6. Deterministic Finite Automata ( DFA ) Problem No. 1 ( Updated )
- 7. Deterministic Finite Automata ( DFA ) Problem No. 2
- 8. Deterministic Finite Automata ( DFA ) Problem No. 3
- 9. Deterministic Finite Automata ( DFA ) Problem No. 4
- Regula Expression and Regular Language
- Operations on Language
- Regular Expression to Regular Language
- Regular Language to Regular Expression
- Understanding the flow
- 15. RE to NFA with Epselon Transition using Thompsons COnstruction Method
- 16. RE to NFA with Epselon transition using Thompson’s Construction Method ( Part 2 )
- 17. RLRE to Minimised DFA ( Direct Method )
- 18. RLRE to Minimised DFA ( Imp State Method )
- 19. Convert NFA with E-Transition to NFA without E-Transition
- 20. NFA Without E-Transition to DFA
- 21. Moore & Mealy Machine
- 22. Moore & Mealy Machine ( Problem 1 )
- PYQ : DFA #1
- PYQ : DFA #2
- PYQ : DFA #3
- PYQ ; DFA #4
- PYQ : DFA #5
- PYQ : DFA #6
- PYQ : Moore Machine Numerical
- PYQ : Mealy Machine Numerical
-
Computational Theory [Module 2]
-
Computational Theory [Module 3]
- 23. Introduction to Grammar
- 24. RE – RL to Context Free Grammar
- 25. How to Convert RE RL to Context Free Grammar
- 26. LMD RMD & Parse Tree
- 27. Check whether the given grammar is an ambiguous grammar or not
- 28. Elimination of useless variable
- 29. Elimination of Null Production
- 30. Elimination of unit Production
- 31. Simplification of CFG
- 32. Introduction to Chomsky Normal Form
- 33. CFG to CNF ( Problem No. 1 )-004
- 34. CFG to CNF ( Problem No. 2 )
- 35. CFG to CNF ( Problem No. 3 )-002
- 36. Introduction to Greibach Normal Form ( GNF )
- 37. Convert CFG to GNF ( Problem No. 1 )
- 38. Convert CFG to GNF ( Problem No. 2 )
- 39. Convert CFG to GNF ( Problem No. 3 )
- 40. Convert the following into CNF & GNF
- PYQ : LMD and RMD Numerical
- PYQ : Parse Tree & Grammar Ambiguity
- PYQ : CFG to CNF with simplification
- PYQ : CFG TO GNF
-
Computational Theory [Module 4]
-
Computational Theory [Module 5]
-
Computational Theory [Module 6]
-
Computational Theory - Notes
-
Operating System [Module 1] :- OPERATING SYSTEM OVERVIEW
-
Operating System [Module 2] :- PROCESS AND PROCESS SCHEDULING
- PCB ( Process Control Block )
- Process State Transition Diagram
- System Calls and Its Types
- Scheduler and Types of Process Scheduling Algorithm
- Threading and Multi-Threading
- SJF (non preemptive ) with solved example | CPU Scheduling
- FCFS ( First come first serve ) | CPU Scheduling
- ROUND ROBIN SCHEDULING ALGORITHM with solved example | CPU Scheduling
- Preemptive Priority Scheduling with solved example | CPU Scheduling
- SJF Preemptive with solved example | Cpu Scheduling
- SJF 2 Preemptive with solved example
- IMP Module 2 Solution
- Process Scheduling Module 2 Numericals
-
Operating System [Module 3] :- PROCESS SYNCHRONIZATION AND DEADLOCKS
- Producer Consumer Problem
- Critical Section Problem
- Dead Lock with Necessary and Sufficient Condition for Deadlock
- Bankers algorithm with Solve Example Part 1
- Bankers (Resource Request algorithm) with Solve Example Part 2
- Dead Lock Recovery
- Dining philosopher Problem
- Bankers algorithm Module 3 Numericals
- IMP Module 3 Solution
-
Operating System [Module 4] :- MEMORY MANAGEMENT
-
Operating System [Module 5] :- Input /Output Management
- Disk scheduling Algorithm
- FCFS Disk Scheduling Algorithm
- SSTF Disk Scheduling Algorithm
- SCAN Disk Scheduling Algorithm
- C SCAN Disk Scheduling Algorithm
- Look Disk Scheduling Algorithm
- C Look Disk Scheduling Algorithm
- FCFS SSTF SCAN CSCAN LOOK CLOOK Overview | Disk Scheduling Sums | All in One
- IMP Module 5 Solution
-
Operating System [Module 6]:- I/O Management
-
Operating System [Notes+IMP]
This content is protected, please login and enroll course to view this content!
Prev
Transaction Schedule