Sem-4 IT MU [ Maths 4 – CNN – OS – AT – COA ]

Teacher

Adarsh

Review

₹5,000.00₹2,999.00

Course Features

Lectures 269
Quiz 0
Duration 50 hours
Skill level All levels
Language English
Students 2
Assessments Yes

Curriculum

34 Sections
269 Lessons
24 Weeks

Expand all sectionsCollapse all sections

About the Course
/*! CSS Used from: Embedded */ *, ::after, ::before { box-sizing: border-box; border-width: 0; border-style: solid; border-color: #e5e7eb; } ::after, ::before { --tw-content: ''; } h2 { font-size: inherit; font-weight: inherit; } a { color: inherit; text-decoration: inherit; } h2, p { margin: 0; } :disabled { cursor: default; } *, ::before, ::after { --tw-border-spacing-x: 0; --tw-border-spacing-y: 0; --tw-translate-x: 0; --tw-translate-y: 0; --tw-rotate: 0; --tw-skew-x: 0; --tw-skew-y: 0; --tw-scale-x: 1; --tw-scale-y: 1; --tw-scroll-snap-strictness: proximity; --tw-ring-offset-width: 0px; --tw-ring-offset-color: #fff; --tw-ring-color: rgb(59 130 246 / 0.5); --tw-ring-offset-shadow: 0 0 #0000; --tw-ring-shadow: 0 0 #0000; --tw-shadow: 0 0 #0000; --tw-shadow-colored: 0 0 #0000; } .mx-auto { margin-left: auto; margin-right: auto; } .mb-2 { margin-bottom: 0.5rem; } .mb-4 { margin-bottom: 1rem; } .mb-6 { margin-bottom: 1.5rem; } .mr-2 { margin-right: 0.5rem; } .max-w-screen-sm { max-width: 640px; } .max-w-screen-xl { max-width: 1280px; } .rounded-lg { border-radius: 0.5rem; } .bg-primary-700 { --tw-bg-opacity: 1; background-color: rgb(29 78 216 / var(--tw-bg-opacity)); } .bg-white { --tw-bg-opacity: 1; background-color: rgb(255 255 255 / var(--tw-bg-opacity)); } .px-4 { padding-left: 1rem; padding-right: 1rem; } .px-5 { padding-left: 1.25rem; padding-right: 1.25rem; } .py-2.5 { padding-top: 0.625rem; padding-bottom: 0.625rem; } .py-8 { padding-top: 2rem; padding-bottom: 2rem; } .text-center { text-align: center; } .text-4xl { font-size: 3rem; line-height: 2.5rem; } .text-sm { font-size: 0.875rem; line-height: 1.25rem; } .font-extrabold { font-weight: 800; } .font-light { font-weight: 300; } .font-medium { font-weight: 500; } .leading-tight { line-height: 1.25; } .tracking-tight { letter-spacing: -0.025em; } .text-gray-500 { --tw-text-opacity: 1; color: rgb(107 114 128 / var(--tw-text-opacity)); } .text-gray-900 { --tw-text-opacity: 1; color: rgb(17 24 39 / var(--tw-text-opacity)); } .text-white { --tw-text-opacity: 1; color: rgb(255 255 255 / var(--tw-text-opacity)); } .hover:bg-primary-800:hover { --tw-bg-opacity: 1; background-color: rgb(30 64 175 / var(--tw-bg-opacity)); } .focus:outline-none:focus { outline: 2px solid transparent; outline-offset: 2px; } .focus:ring-4:focus { --tw-ring-offset-shadow: var(--tw-ring-inset) 0 0 0 var(--tw-ring-offset-width) var(--tw-ring-offset-color); --tw-ring-shadow: var(--tw-ring-inset) 0 0 0 calc(4px + var(--tw-ring-offset-width)) var(--tw-ring-color); box-shadow: var(--tw-ring-offset-shadow), var(--tw-ring-shadow), var(--tw-shadow, 0 0 #0000); } .focus:ring-primary-300:focus { --tw-ring-opacity: 1; --tw-ring-color: rgb(147 197 253 / var(--tw-ring-opacity)); } @media (min-width: 640px) { .sm:py-16 { padding-top: 4rem; padding-bottom: 4rem; } } @media (min-width: 768px) { .md:text-lg { font-size: 1.5rem; line-height: 1.75rem; } } @media (min-width: 1024px) { .lg:px-6 { padding-left: 1.5rem; padding-right: 1.5rem; } } .imgdata { width: 35% } @media (max-width: 767px) { .imgdata { width: 40% } } .course-payment { display: none !important; } .thim-course-landing-button { display: none !important; }

This Course is Only Available On Our App

Dive-in and start learning! Get offline access to all the course contents!

0
Operating System [Module 1] :- OPERATING SYSTEM OVERVIEW
4
- 2.1
  Introduction to Operating System Copy
  9 Minutes
- 2.2
  Monolithic and Micro Kernel Architecture Copy
  6 Minutes
- 2.3
  User Space and Kernel Space Copy
  6 Minutes
- 2.4
  IMP Module 1 Solution Copy
Operating System [Module 2] :- PROCESS AND PROCESS SCHEDULING
10
- 3.1
  PCB ( Process Control Block ) Copy
  5 Minutes
- 3.2
  Process State Transition Diagram Copy
  11 Minutes
- 3.3
  SJF (non preemptive ) with solved example | CPU Scheduling Copy
  5 Minutes
- 3.4
  FCFS ( First come first serve ) | CPU Scheduling Copy
  14 Minutes
- 3.5
  ROUND ROBIN SCHEDULING ALGORITHM with solved example | CPU Scheduling Copy
  10 Minutes
- 3.6
  Preemptive Priority Scheduling with solved example | CPU Scheduling Copy
  16 Minutes
- 3.7
  SJF Preemptive with solved example | Cpu Scheduling Copy
  10 Minutes
- 3.8
  SJF 2 Preemptive with solved example Copy
  21 Minutes
- 3.9
  IMP Module 2 Solution Copy
- 3.10
  Process Scheduling Module 2 Numericals Copy
Operating System [Module 3] :- PROCESS SYNCHRONIZATION AND DEADLOCKS
9
- 4.1
  Producer Consumer Problem Copy
  8 Minutes
- 4.2
  Critical Section Problem Copy
  7 Minutes
- 4.3
  Dead Lock with Necessary and Sufficient Condition for Deadlock Copy
  4 Minutes
- 4.4
  Bankers algorithm with Solve Example Part 1 Copy
  13 Minutes
- 4.5
  Bankers (Resource Request algorithm) with Solve Example Part 2 Copy
  9 Minutes
- 4.6
  Dead Lock Recovery Copy
  5 Minutes
- 4.7
  Dining philosopher Problem Copy
  5 Minutes
- 4.8
  Bankers algorithm Module 3 Numericals Copy
- 4.9
  IMP Module 3 Solution Copy
Operating System [Module 4] :- MEMORY MANAGEMENT
8
- 5.1
  Introduction to Memory in Operating system Copy
  8 Minutes
- 5.2
  Memory management |Part 1 | Copy
  8 Minutes
- 5.3
  Memory management |Part 2 | Copy
  8 Minutes
- 5.4
  Memory management |Part 3 | Copy
  8 Minutes
- 5.5
  Loading and Linking Copy
  4 Minutes
- 5.6
  FIFO,LRU AND OPTIMAL PAGE REPLACEMENT ALGORITHMS Copy
  20 Minutes
- 5.7
  IMP Module 4 Solution Copy
- 5.8
  Page Replacement Numericals Module 4 Copy
Operating System [Module 5] :- Input /Output Management
9
- 6.1
  Disk scheduling Algorithm Copy
  6 Minutes
- 6.2
  FCFS Disk Scheduling Algorithm Copy
  9 Minutes
- 6.3
  SSTF Disk Scheduling Algorithm Copy
  7 Minutes
- 6.4
  SCAN Disk Scheduling Algorithm Copy
  6 Minutes
- 6.5
  C SCAN Disk Scheduling Algorithm Copy
  5 Minutes
- 6.6
  Look Disk Scheduling Algorithm Copy
  4 Minutes
- 6.7
  C Look Disk Scheduling Algorithm Copy
  4 Minutes
- 6.8
  FCFS SSTF SCAN CSCAN LOOK CLOOK Overview | Disk Scheduling Sums | All in One Copy
  8 Minutes
- 6.9
  IMP Module 5 Solution Copy
Operating System [Module 6]:- I/O Management
1
- 7.1
  IMP Module 6 Solution Copy
Engineering Maths- 4 [Module 1]:- Complex Integration
8
- 8.1
  Complex integration along a Line or Parabola with Solved Example Copy
  17 Minutes
- 8.2
  Complex integration along a Circle with Solved Example Copy
- 8.3
  Cauchy’s Theorem Basics & Cauchy’s integral formula Type 1 Copy
  13 Minutes
- 8.4
  Cauchy’s Theorem Type 2 and Type 3 Copy
  10 Minutes
- 8.5
  Cauchy’s Theorem Type 4 and Type 5 Copy
  12 Minutes
- 8.6
  Taylor and Laurent series Full Basic with Solved Example part 1 Copy
  15 Minutes
- 8.7
  Taylor and Laurent series Full Basic with Solved Example part 2 Copy
  17 Minutes
- 8.8
  Complex Integration Notes Copy
Engineering Maths- 4 [Module 2]:- Linear Algebra / Matrices
13
- 9.1
  Introduction to Matrices Copy
  7 Minutes
- 9.2
  Eigen value and Eigen vector in Matrices Copy
  17 Minutes
- 9.3
  Eigen value and Eigen vectors for Types of Matrices Copy
  6 Minutes
- 9.4
  Cayley Hamilton Theorem with Example Part 1 Copy
  9 Minutes
- 9.5
  Cayley Hamilton Theorem with Example Part 2 Copy
  5 Minutes
- 9.6
  Cayley Hamilton Theorem with Example Part 3 Copy
  4 Minutes
- 9.7
  Monic and Minimal Polynomial of a Matrix Copy
  5 Minutes
- 9.8
  Algebraic multiplicity And Geometric multiplicity Copy
  10 Minutes
- 9.9
  Functions of a Square Matrix in Matrices Copy
  7 Minutes
- 9.10
  Reduction of Quadratic form to Canonical form Copy
  13 Minutes
- 9.11
  Orthogonal Matrix with Solved Example Copy
  9 Minutes
- 9.12
  Matrices Notes Copy
- 9.13
  Practice problems solution key matrices Copy
Engineering Maths- 4 [Module 3]:- Sampling Theory
13
- 10.1
  What Is Sampling Copy
  8 Minutes
- 10.2
  Large Sampling Problems Copy
  16 Minutes
- 10.3
  Large Sampling Test Theory+Numerical Copy
  16 Minutes
- 10.4
  Hypothesis Testing Full concept Copy
  2 Minutes
- 10.5
  Testing Difference Between Means(case_1) With Examples Copy
  11 Minutes
- 10.6
  Small Sample Test Example Copy
  13 Minutes
- 10.7
  Small Sample Test Copy
  4 Minutes
- 10.8
  Testing Difference Between Means(case_1) With Examples Part 2 Copy
  5 Minutes
- 10.9
  Testing Difference Between Means(case_2) Copy
  12 Minutes
- 10.10
  Non Parametric Test Type_1_Numerical Copy
  8 Minutes
- 10.11
  Non Parametric Test Copy
  4 Minutes
- 10.12
  Sampling Theory Notes Copy
- 10.13
  Solution key for Sampling Theory Copy
Engineering Maths- 4 [Module 4]:- Mathematical Programming / Linear Programming
10
- 11.1
  Basics of simplex method in LPP Copy
  11 Minutes
- 11.2
  Standard form of LPP Simplex Method Copy
  12 Minutes
- 11.3
  Types of Solutions in Simplex Method in LPP Copy
  14 Minutes
- 11.4
  How to Solve LPP using Simplex method Copy
  18 Minutes
- 11.5
  LPP Using Big M method ( Penalty Method ) Copy
  25 Minutes
- 11.6
  Relationship between Primal and Dual Copy
  17 Minutes
- 11.7
  Duality of LPP ( Primal and Dual ) Copy
  17 Minutes
- 11.8
  Dual Simplex Method in LPP Copy
  17 Minutes
- 11.9
  Linear Programming Problems Notes Copy
- 11.10
  Linear Programming solution key Copy
Engineering Maths- 4 [Module 5]:- Calculus of Variation
12
- 12.1
  Euler’s Differential Equation Copy
  11 Minutes
- 12.2
  Functions of Second Order Derivative Copy
  9 Minutes
- 12.3
  Gram Schmidt Process With Numerical Copy
  19 Minutes
- 12.4
  Hypothesis Concerning Several Proportions Copy
  7 Minutes
- 12.5
  Linear Combinations Of Vector Copy
  5 Minutes
- 12.6
  Non Parametric Test Type_2_Numerical Copy
  5 Minutes
- 12.7
  Pythagorean Theorem Copy
  4 Minutes
- 12.8
  Subspaces Copy
  10 Minutes
- 12.9
  Cauchy Schwarz Inequality in R^ Copy
  5 Minutes
- 12.10
  Lagranges Method Copy
  9 Minutes
- 12.11
  Rayleigh Ritz Method Copy
  12 Minutes
- 12.12
  Calculus of Variation Copy
Engineering Maths- 4 [Module 6]:- Correlation (EXTC, Electrical , Electronics)
4
- 13.1
  Introduction to correlation Copy
  8 Minutes
- 13.2
  Karl Pearson coefficient correlation Copy
  6 Minutes
- 13.3
  Spearman Rank Copy
  13 Minutes
- 13.4
  Correlation,Regression and Curve Fitting (EXTC, Electrical , Electronics Notes ) Copy
Engineering Maths- 4 [Module 7]:- Regression (EXTC, Electrical , Electronics)
4
- 14.1
  Introduction to Regression Copy
  5 Minutes
- 14.2
  Regression part 2 Copy
  13 Minutes
- 14.3
  Regression part 3 Copy
  15 Minutes
- 14.4
  Correlation,Regression and Curve Fitting Copy
Engineering Maths- 4 [Module 8]:- Probability Distribution
12
- 15.1
  Introduction to Probability Distribution Copy
  7 Minutes
- 15.2
  Discrete Random Variable in Probability Distribution Copy
  15 Minutes
- 15.3
  Distribution function of Discrete Random Variable Copy
  15 Minutes
- 15.4
  Continuous Random Variable in Probability Distribution Copy
  14 Minutes
- 15.5
  Continuous Distribution Function in Probability Distribution Copy
  14 Minutes
- 15.6
  Expectation in Probability Distribution Copy
  12 Minutes
- 15.7
  Mean and Variance Part 1 in Probability Distribution Copy
  11 Minutes
- 15.8
  Mean and Variance Part 2 in Probability Distribution Copy
  13 Minutes
- 15.9
  Moments and Moments Generating Function Part #1 in Probability Distribution Copy
  13 Minutes
- 15.10
  Moments and Moments Generating Function Part #2 in Probability Distribution Copy
  11 Minutes
- 15.11
  Probability Notes Copy
- 15.12
  Practice problem solution key for Probability Copy
Engineering Maths- 4 [Module 9]:- Vector Calculus
6
- 16.1
  Divergence and curl Copy
  10 Minutes
- 16.2
  Scalar Potential Copy
  14 Minutes
- 16.3
  Vector differentiation basics and gradient Copy
  15 Minutes
- 16.4
  Green theorem Copy
  15 Minutes
- 16.5
  Gauss divergence theorem Copy
  7 Minutes
- 16.6
  Stokes Theorem Copy
  17 Minutes
Engineering Maths- 4 [Module 10]:- Z transform
8
- 17.1
  Introduction to Z transform Copy
  16 Minutes
- 17.2
  Z Transforms Change Of Scale Copy
  5 Minutes
- 17.3
  Z Transforms Linearity Copy
  9 Minutes
- 17.4
  Z Transforms multiplication by k Copy
  10 Minutes
- 17.5
  Z Transforms Of Standard Functions Copy
  8 Minutes
- 17.6
  Z Transforms Shifting Property Copy
  5 Minutes
- 17.7
  Inverse Z transform using binomial expansion Copy
  8 Minutes
- 17.8
  Inverse Z transform using partial fractions Copy
  20 Minutes
Automata Theory [Module 1] :- Introduction and Regular Languages
5
- 18.1
  10. Regula Expression and Regular Language
  3 Minutes
- 18.2
  11. Operations on Language
  11 Minutes
- 18.3
  12. Regular Expression to Regular Language
  6 Minutes
- 18.4
  13. Regular Language to Regular Expression
  10 Minutes
- 18.5
  14. Understanding the flow
  2 Minutes
Automata Theory [Module 2] :- Finite Automata
17
- 19.1
  1. Introduction to Finite State Machine-002
  22 Minutes
- 19.2
  2. Finite State Machine Problem No. 1-001
  12 Minutes
- 19.3
  3. Finite State Machine Problem No. 2-003
  12 Minutes
- 19.4
  4. Finite State Machine Problem No. 3-004
  14 Minutes
- 19.5
  5. Introduction to Deterministic Finite Automata ( DFA )
  18 Minutes
- 19.6
  6. Deterministic Finite Automata ( DFA ) Problem No. 1 ( Updated )
  12 Minutes
- 19.7
  7. Deterministic Finite Automata ( DFA ) Problem No. 2
  10 Minutes
- 19.8
  8. Deterministic Finite Automata ( DFA ) Problem No. 3
  12 Minutes
- 19.9
  9. Deterministic Finite Automata ( DFA ) Problem No. 4
  9 Minutes
- 19.10
  15. RE to NFA with Epselon Transition using Thompsons COnstruction Method
  16 Minutes
- 19.11
  16. RE to NFA with Epselon transition using Thompson’s Construction Method ( Part 2 )
  10 Minutes
- 19.12
  17. RLRE to Minimised DFA ( Direct Method )
  27 Minutes
- 19.13
  18. RLRE to Minimised DFA ( Imp State Method )
  24 Minutes
- 19.14
  19. Convert NFA with E-Transition to NFA without E-Transition
  16 Minutes
- 19.15
  20. NFA Without E-Transition to DFA
  15 Minutes
- 19.16
  21. Moore & Mealy Machine
  22 Minutes
- 19.17
  22. Moore & Mealy Machine ( Problem 1 )
  9 Minutes
Automata Theory [Module 3] :- Context Free Grammar
18
- 20.1
  23. Introduction to Grammar
  9 Minutes
- 20.2
  24. RE – RL to Context Free Grammar
  7 Minutes
- 20.3
  25. How to Convert RE  RL to Context Free Grammar
  15 Minutes
- 20.4
  26. LMD  RMD & Parse Tree
  13 Minutes
- 20.5
  27. Check whether the given grammar is an ambiguous grammar or not
  7 Minutes
- 20.6
  28. Elimination of useless variable
  12 Minutes
- 20.7
  29. Elimination of Null Production
  11 Minutes
- 20.8
  30. Elimination of unit Production
  4 Minutes
- 20.9
  31. Simplification of CFG
  9 Minutes
- 20.10
  32. Introduction to Chomsky Normal Form
  9 Minutes
- 20.11
  33. CFG to CNF ( Problem No. 1 )-004
  11 Minutes
- 20.12
  34. CFG to CNF ( Problem No. 2 )
  5 Minutes
- 20.13
  35. CFG to CNF ( Problem No. 3 )-002
  12 Minutes
- 20.14
  36. Introduction to Greibach Normal Form ( GNF )
  13 Minutes
- 20.15
  37. Convert CFG to GNF ( Problem No. 1 )
  9 Minutes
- 20.16
  38. Convert CFG to GNF ( Problem No. 2 )
  7 Minutes
- 20.17
  39. Convert CFG to GNF ( Problem No. 3 )
  4 Minutes
- 20.18
  40. Convert the following into CNF & GNF
  5 Minutes
Automata Theory [Module 4] :- Push Down Automata
5
- 21.1
  41. Introduction to Push Down Automata
  8 Minutes
- 21.2
  42. How to write commands in Push Down Automata
  8 Minutes
- 21.3
  43. Push Down Automata ( Problem No. 1 )
  14 Minutes
- 21.4
  45. Convert FA ( DFA ) to PDA
  11 Minutes
- 21.5
  46. Convert CFG to PDA
  9 Minutes
Automata Theory [Module 5] :- Turing Machine
2
- 22.1
  44. Introduction to Turing Machine
  15 Minutes
- 22.2
  47. Post Currospondance Problem ( PCP )
  5 Minutes
Automata Theory [Module 6] :- Applications of Automata
4
- 23.1
  Finite Automata As Language Acceptor Verifier
  10 Minutes
- 23.2
  Turing Machine as Language Acceptor
  15 Minutes
- 23.3
  Pushdown Automata as Simple Parser
  19 Minutes
- 23.4
  Phases of compiler
  9 Minutes
Computer Network [Module 1]:- Introduction to Networks
9
- 24.1
  Introduction to Computer Networks
  12 Minutes
- 24.2
  Network Topologies
  12 Minutes
- 24.3
  Network Connecting Devices
  11 Minutes
- 24.4
  Connection-Oriented vs Connection-Less Communication
  9 Minutes
- 24.5
  OSI Reference Model
  7 Minutes
- 24.6
  TCP-IP Reference Model
  7 Minutes
- 24.7
  OSI vs TCP-IP Model Comparision
  8 Minutes
- 24.8
  Network Classification LAN, MAN, WAN
  8 Minutes
- 24.9
  Virtual Lan’s
  8 Minutes
Computer Network [Module 2]:-Physical Layer & Data Link layer
16
- 25.1
  Transmission Media: Guided and Unguided [Difference]
  9 Minutes
- 25.2
  Twisted-Pair Cables
  8 Minutes
- 25.3
  CoAxial Cable
  7 Minutes
- 25.4
  Fiber Optics Part [01]
  11 Minutes
- 25.5
  Fiber Optics Part [02]
  11 Minutes
- 25.6
  Framing and it’s Methods
  8 Minutes
- 25.7
  Error Detection and its Methods
  8 Minutes
- 25.8
  Hamming Code
  10 Minutes
- 25.9
  Cyclic Redundancy Check Part [01]
  9 Minutes
- 25.10
  Cyclic Redundancy Check Part [02]
  5 Minutes
- 25.11
  Parity Checking and Checksum Error Detection
  9 Minutes
- 25.12
  Flow Control: Stop and Wait and Sliding Window Protocol
  8 Minutes
- 25.13
  Go Back- N ARQ System
  8 Minutes
- 25.14
  SDLC protocol
  5 Minutes
- 25.15
  HDLC protocol
  12 Minutes
- 25.16
  Carrier Sense Multiple Access-Collision Detection Procedure (CSMA-CD)
  7 Minutes
Computer Network [Module 3]:- Network Layer
8
- 26.1
  IP address vs MAC address
  9 Minutes
- 26.2
  IPv4 Header Format
  12 Minutes
- 26.3
  IPv4 vs IPv6
  10 Minutes
- 26.4
  Routing Algorithms Part 01
  12 Minutes
- 26.5
  Routing Algorithms Part 02
  10 Minutes
- 26.6
  ARP & RARP
  7 Minutes
- 26.7
  Leaky Bucket Algorithm
  5 Minutes
- 26.8
  Token Bucket Algorithm
  6 Minutes
Computer Network [Module 4]:- Transport Layer & session Layer
2
- 27.1
  Berkeley Sockets
  7 Minutes
- 27.2
  User Datagram Protocol
  8 Minutes
Computer Network [Module 5]:- Presentation & Application Layer
4
- 28.1
  Domain Name Server – DNS
  6 Minutes
- 28.2
  Simple Mail Transfer Protocol – SMTP
  5 Minutes
- 28.3
  Hypertext Transfer Protocol – HTTP
  8 Minutes
- 28.4
  File Transfer Protocol – FTP
  5 Minutes
Computer Architecture [Module 1 ] :- Fundamentals of logic Design
14
- 29.1
  Number System Intro
  11 Minutes
- 29.2
  Binary Number System
  11 Minutes
- 29.3
  Octal Number System
  9 Minutes
- 29.4
  Hexadecimal Number System
  7 Minutes
- 29.5
  Logic Gates – 1
  12 Minutes
- 29.6
  Logic Gates – 2
  12 Minutes
- 29.7
  Universal Gates
  13 Minutes
- 29.8
  Excess – 3
  5 Minutes
- 29.9
  Gray Code
  7 Minutes
- 29.10
  Half and Full Adder
  13 Minutes
- 29.11
  Multiplexer and Demultiplexer
  6 Minutes
- 29.12
  SR Flip Flop
  7 Minutes
- 29.13
  JK Flip Flop
  5 Minutes
- 29.14
  D and T Flip Flop
  6 Minutes
Computer Architecture [Module 2 ] :- Overview of Computer Architecture & Organization
6
- 30.1
  Introduction – Computer Organization
  9 Minutes
- 30.2
  Von Neumann Architecture
  13 Minutes
- 30.3
  Architecture of 8086
  14 Minutes
- 30.4
  Addressing Modes – Part 1
  11 Minutes
- 30.5
  Addressing Modes – Part 2
  13 Minutes
- 30.6
  Amdahl’s law
  7 Minutes
Computer Architecture [Module 3 ] :- Processor Organization and Architecture
6
- 31.1
  Instruction Cycles & Interrupts Mechanism
  7 Minutes
- 31.2
  Hardwired Control Unit
  8 Minutes
- 31.3
  Microprogrammed Control Unit
  8 Minutes
- 31.4
  Hardwired vs Microprogrammed
  10 Minutes
- 31.5
  Parallel Processing & Applications
  13 Minutes
- 31.6
  Flynn’s Classfication
  10 Minutes
Computer Architecture [Module 4 ] :- Data Representation & Arithmetic Algorithms
9
- 32.1
  Booth’s Algorithm – Part 1
  13 Minutes
- 32.2
  Booth’s Algorithm – Part 2
  10 Minutes
- 32.3
  Booth’s Algorithm – Part 3
  8 Minutes
- 32.4
  Restoring Division – Part 1
  18 Minutes
- 32.5
  Restoring Division – Part 2
  18 Minutes
- 32.6
  Non-Restoring Division – Part 2
  10 Minutes
- 32.7
  Non-Restoring Division – Part 1
  12 Minutes
- 32.8
  Binary Numeric Data Representation
  7 Minutes
- 32.10
  IEEE-754 Floating Point Number Representation
  17 Minutes
Computer Architecture [Module 5 ] :- Memory Organization
9
- 33.1
  Memory And It’s Characteristics
  9 Minutes
- 33.2
  DRAM
  7 Minutes
- 33.3
  SRAM
  8 Minutes
- 33.4
  Memory Hierarchy And Locality Of Reference
  13 Minutes
- 33.5
  Cache Memory
  7 Minutes
- 33.6
  Cache Coherence
  11 Minutes
- 33.7
  Cache Coherence Strategies
  9 Minutes
- 33.8
  MESI Protocol
  11 Minutes
- 33.9
  Interleaved Memory
  10 Minutes
Computer Architecture [Module 6 ] :- I / O Organization
4
- 34.1
  IO Module, Functions, Requirement & Types
  11 Minutes
- 34.2
  Programmed IO
  12 Minutes
- 34.3
  Interrupt Driven IO
  11 Minutes
- 34.4
  DMA Driven IO
  13 Minutes