Sem-4 IT MU [ Maths 4 – CNN – OS – AT – COA ]
₹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 -
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
-
Engineering Maths- 4 [Module 1]:- Complex Integration
- Complex integration along a Line or Parabola with Solved Example
- Complex integration along a Circle with Solved Example
- Cauchy’s Theorem Basics & Cauchy’s integral formula Type 1
- Cauchy’s Theorem Type 2 and Type 3
- Cauchy’s Theorem Type 4 and Type 5
- Taylor and Laurent series Full Basic with Solved Example part 1
- Taylor and Laurent series Full Basic with Solved Example part 2
- Complex Integration Notes
-
Engineering Maths- 4 [Module 2]:- Linear Algebra / Matrices
- Introduction to Matrices
- Eigen value and Eigen vector in Matrices
- Eigen value and Eigen vectors for Types of Matrices
- Cayley Hamilton Theorem with Example Part 1
- Cayley Hamilton Theorem with Example Part 2
- Cayley Hamilton Theorem with Example Part 3
- Monic and Minimal Polynomial of a Matrix
- Algebraic multiplicity And Geometric multiplicity
- Functions of a Square Matrix in Matrices
- Reduction of Quadratic form to Canonical form
- Orthogonal Matrix with Solved Example
- Matrices Notes
- Practice problems solution key matrices
-
Engineering Maths- 4 [Module 3]:- Sampling Theory
- What Is Sampling
- Large Sampling Problems
- Large Sampling Test Theory+Numerical
- Hypothesis Testing Full concept
- Testing Difference Between Means(case_1) With Examples
- Small Sample Test Example
- Small Sample Test
- Testing Difference Between Means(case_1) With Examples Part 2
- Testing Difference Between Means(case_2)
- Non Parametric Test Type_1_Numerical
- Non Parametric Test
- Sampling Theory Notes
- Solution key for Sampling Theory
-
Engineering Maths- 4 [Module 4]:- Mathematical Programming / Linear Programming
- Basics of simplex method in LPP
- Standard form of LPP Simplex Method
- Types of Solutions in Simplex Method in LPP
- How to Solve LPP using Simplex method
- LPP Using Big M method ( Penalty Method )
- Relationship between Primal and Dual
- Duality of LPP ( Primal and Dual )
- Dual Simplex Method in LPP
- Linear Programming Problems Notes
- Linear Programming solution key
-
Engineering Maths- 4 [Module 5]:- Calculus of Variation
- Euler’s Differential Equation
- Functions of Second Order Derivative
- Gram Schmidt Process With Numerical
- Hypothesis Concerning Several Proportions
- Linear Combinations Of Vector
- Non Parametric Test Type_2_Numerical
- Pythagorean Theorem
- Subspaces
- Cauchy Schwarz Inequality in R^
- Lagranges Method
- Rayleigh Ritz Method
- Calculus of Variation
-
Engineering Maths- 4 [Module 6]:- Correlation (EXTC, Electrical , Electronics)
-
Engineering Maths- 4 [Module 7]:- Regression (EXTC, Electrical , Electronics)
-
Engineering Maths- 4 [Module 8]:- Probability Distribution
- Introduction to Probability Distribution
- Discrete Random Variable in Probability Distribution
- Distribution function of Discrete Random Variable
- Continuous Random Variable in Probability Distribution
- Continuous Distribution Function in Probability Distribution
- Expectation in Probability Distribution
- Mean and Variance Part 1 in Probability Distribution
- Mean and Variance Part 2 in Probability Distribution
- Moments and Moments Generating Function Part #1 in Probability Distribution
- Moments and Moments Generating Function Part #2 in Probability Distribution
- Probability Notes
- Practice problem solution key for Probability
-
Engineering Maths- 4 [Module 9]:- Vector Calculus
-
Engineering Maths- 4 [Module 10]:- Z transform
-
Automata Theory [Module 1] :- Introduction and Regular Languages
-
Automata Theory [Module 2] :- Finite Automata
- 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
- 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 )
-
Automata Theory [Module 3] :- Context Free Grammar
- 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
-
Automata Theory [Module 4] :- Push Down Automata
-
Automata Theory [Module 5] :- Turing Machine
-
Automata Theory [Module 6] :- Applications of Automata
-
Computer Network [Module 1]:- Introduction to Networks
-
Computer Network [Module 2]:-Physical Layer & Data Link layer
- Transmission Media: Guided and Unguided [Difference]
- Twisted-Pair Cables
- CoAxial Cable
- Fiber Optics Part [01]
- Fiber Optics Part [02]
- Framing and it’s Methods
- Error Detection and its Methods
- Hamming Code
- Cyclic Redundancy Check Part [01]
- Cyclic Redundancy Check Part [02]
- Parity Checking and Checksum Error Detection
- Flow Control: Stop and Wait and Sliding Window Protocol
- Go Back- N ARQ System
- SDLC protocol
- HDLC protocol
- Carrier Sense Multiple Access-Collision Detection Procedure (CSMA-CD)
-
Computer Network [Module 3]:- Network Layer
-
Computer Network [Module 4]:- Transport Layer & session Layer
-
Computer Network [Module 5]:- Presentation & Application Layer
-
Computer Network Important solution
-
Computer Architecture [Module 1 ] :- Fundamentals of logic Design
-
Computer Architecture [Module 2 ] :- Overview of Computer Architecture & Organization
-
Computer Architecture [Module 3 ] :- Processor Organization and Architecture
-
Computer Architecture [Module 4 ] :- Data Representation & Arithmetic Algorithms
-
Computer Architecture [Module 5 ] :- Memory Organization
-
Computer Architecture [Module 6 ] :- I / O Organization
-
TCS Notes
![Protected: Wipro Elite /WILP Complete Prep Courses [ Videos + Notes + Mock ]](https://lastmomenttuitions.com/wp-content/uploads/2019/08/VIVA-QUESTION-450x450.png "VIVA QUESTION")
![First Year Sem 2 MU NEP [ Comps – IT – AIML Branch ]](https://lastmomenttuitions.com/wp-content/uploads/2020/02/WhatsApp-Image-2020-06-26-at-12.15.44-PM.jpeg "WhatsApp Image 2020-06-26 at 12.15.44 PM")
![Sem 6 AIML / AIDS Bundle [ ML – DVA – CNS – SEPM ]](https://lastmomenttuitions.com/wp-content/uploads/2019/07/demo_image-450x450.jpg "demo_image")
