Sem – 4 AIML + Comps [ Mu ] [ Importance with Solution + Solution , Video Lectures + Viva Questions ]
₹5,000.00
₹2,999.00
-
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 -
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 CT IMP Soln 2026
-
Computational Theory - Notes
-
Database Management System [Module 1]:- Introduction Database Concepts and Data Mode
-
Database Management System [Module 2]:- Relational Model and relational Algebra
-
Database Management System [Module 3]:- Structured Query Language (SQL)
- Introduction to SQL
- Data definition language
- DML ( data manipulation language )
- Aggregate Function in SQL
- 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
- 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
- Notes
-
Database Management System [Module 4]:- Database Normalization
-
Database Management System [Module 5]:- Transactions Management and Concurrence
-
Database Management System [Module 6]:-Introduction to modern databases
-
Database Management System [IMP]
-
Database Management System - Viva Questions with Answers Module wise
-
Operating System M1 : Fundamentals of Operating System
-
Operating System M2 : Process Management
- PCB ( Process Control Block )
- Process State Transition Diagram
- Threading and Multi-Threading
- Scheduler and Types of Process Scheduling Algorithm
- Various Scheduling Criteria
- SJF – Scheduling Criteria
- Priority Scheduling Non-Preemptive
- SRTN Scheduling Algo
- Round Robin Scheduling Criteria
- Priority Scheduling Preemptive
-
Operating System M3 : Process Synchronization and Deadlock
-
Operating System M4 : MEMORY MANAGEMENT
-
Operating System M5 : File and IO 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
- Input Output Management
- File Managment File System
- Disk Allocation Methods
-
Operating System M6 : Special Purpose Operating System
-
Operating System - Importance with Solution
- Operating System Module vise IMP
- IMP Module 1 Solution
- Process Scheduling Module 2 Numericals
- IMP Module 2 Solution
- Bankers algorithm Module 3 Numericals
- IMP Module 3 Solution
- IMP Module 4 Solution
- Page Replacement Numericals Module 4
- IMP Module 5 Solution
- IMP Module 6 Solution
- Operating System More Question
-
Operating System - Viva Questions with Answers Module wise
![SEBI GRADE A 2026 – IT [ Phase 1 + Phase 2 ]](https://lastmomenttuitions.com/wp-content/uploads/2025/12/SEBI-GRADE-A-IT-2025-450x450.png "SEBI GRADE A – IT 2025")
