Course Features
- Lectures 277
- Quiz 0
- Duration 50 hours
- Skill level All levels
- Language English
- Students 5
- Assessments Yes
Curriculum
- 39 Sections
- 277 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; }0
- Microprocessor [Module 1] - The Intel Microprocessors 8086 Archite10
- 2.1Introduction to Microprocessor29 Minutes
- 2.28086 Memory Banking11 Minutes
- 2.38086 Memory Segmentation7 Minutes
- 2.4Architecture of 808614 Minutes
- 2.58086 FLAG REGISTER17 Minutes
- 2.6Minimum Mode20 Minutes
- 2.7Timing Diagram12 Minutes
- 2.8Maximum Mode28 Minutes
- 2.98086 interrupts14 Minutes
- 2.108086 Memory Mapping Sum19 Minutes
- Microprocessor [Module 2] :- Instruction Set and Programming17
- 3.18086 Addressing modes13 Minutes
- 3.2Data Transfer Instruction10 Minutes
- 3.3XLAT Translation7 Minutes
- 3.4DAA and AAA Instruction16 Minutes
- 3.5Push and POP instruction4 Minutes
- 3.6String Instuction21 Minutes
- 3.7Logical Operation9 Minutes
- 3.8Arithmetic instructions14 Minutes
- 3.98086 Rotate instructions12 Minutes
- 3.108086 Branch instructions17 Minutes
- 3.11Programmer Model14 Minutes
- 3.12Basics of Programming- Addition of 2 Numbers32 Minutes
- 3.13ALP for Exchange Content of Two Memory Block11 Minutes
- 3.14Reverse a String- ALP Program14 Minutes
- 3.15Find a Character in the Given String12 Minutes
- 3.16ALP to Sort a Array of 10 in Ascending Order25 Minutes
- 3.17Previous Year ALP All Codes Solution
- Microprocessor [Module 3] :- Memory and Peripherals interfacing7
- Microprocessor [Module 4] :- Intel 80386DX Processor7
- Microprocessor [Module 5] :- Pentium Processor5
- Microprocessor [Module 6] :- Pentium 43
- Microprocessor [ Importance with Solution ]9
- Operating System [Module 1] :- OPERATING SYSTEM OVERVIEW4
- Operating System [Module 2] :- PROCESS AND PROCESS SCHEDULING10
- 10.1PCB ( Process Control Block )5 Minutes
- 10.2Process State Transition Diagram11 Minutes
- 10.3SJF (non preemptive ) with solved example | CPU Scheduling5 Minutes
- 10.4FCFS ( First come first serve ) | CPU Scheduling14 Minutes
- 10.5ROUND ROBIN SCHEDULING ALGORITHM with solved example | CPU Scheduling10 Minutes
- 10.6Preemptive Priority Scheduling with solved example | CPU Scheduling16 Minutes
- 10.7SJF Preemptive with solved example | Cpu Scheduling10 Minutes
- 10.8SJF 2 Preemptive with solved example21 Minutes
- 10.9IMP Module 2 Solution
- 10.10Process Scheduling Module 2 Numericals
- Operating System [Module 3] :- PROCESS SYNCHRONIZATION AND DEADLOCKS9
- 11.1Producer Consumer Problem8 Minutes
- 11.2Critical Section Problem7 Minutes
- 11.3Dead Lock with Necessary and Sufficient Condition for Deadlock4 Minutes
- 11.4Bankers algorithm with Solve Example Part 113 Minutes
- 11.5Bankers (Resource Request algorithm) with Solve Example Part 29 Minutes
- 11.6Dead Lock Recovery5 Minutes
- 11.7Dining philosopher Problem5 Minutes
- 11.8Bankers algorithm Module 3 Numericals
- 11.9IMP Module 3 Solution
- Operating System [Module 4] :- MEMORY MANAGEMENT8
- 12.1Introduction to Memory in Operating system8 Minutes
- 12.2Memory management |Part 1 |8 Minutes
- 12.3Memory management |Part 2 |8 Minutes
- 12.4Memory management |Part 3 |8 Minutes
- 12.5Loading and Linking4 Minutes
- 12.6FIFO,LRU AND OPTIMAL PAGE REPLACEMENT ALGORITHMS20 Minutes
- 12.7IMP Module 4 Solution
- 12.8Page Replacement Numericals Module 4
- Operating System [Module 5] :- Input /Output Management9
- 13.1Disk scheduling Algorithm6 Minutes
- 13.2FCFS Disk Scheduling Algorithm9 Minutes
- 13.3SSTF Disk Scheduling Algorithm7 Minutes
- 13.4SCAN Disk Scheduling Algorithm6 Minutes
- 13.5C SCAN Disk Scheduling Algorithm5 Minutes
- 13.6Look Disk Scheduling Algorithm4 Minutes
- 13.7C Look Disk Scheduling Algorithm4 Minutes
- 13.8FCFS SSTF SCAN CSCAN LOOK CLOOK Overview | Disk Scheduling Sums | All in One8 Minutes
- 13.9IMP Module 5 Solution
- Operating System [Module 6]:- I/O Management1
- Operating System [Notes+IMP]2
- Analysis of Algorithm [Module 1]:- Introduction5
- Analysis of Algorithm [Module 2]:- Divide and Conquer Approach7
- 17.1Max Min Problem with Solved Example8 Minutes
- 17.2Merge Sort Algorithm with Solved Example20 Minutes
- 17.3Multiplying Long Integers Using Divide and Conquer Technique9 Minutes
- 17.4Quick Sort Algorithm web17 Minutes
- 17.5Quick Sort Algorithm Explained with Example15 Minutes
- 17.6Divide & Conquer With Example6 Minutes
- 17.7Binary Search10 Minutes
- Analysis of Algorithm [Module 3]:- Greedy Method Approach4
- Analysis of Algorithm [Module 4]:- Dynamic Programming Approach5
- Analysis of Algorithm [Module 5]:- Backtracking and Branch and bound2
- Analysis of Algorithm [Module 6]:- String Matching Algorithms0
- Analysis of Algorithm Importance with Solution3
- Database Management System [Module 1]:- Introduction Database Concepts6
- Database Management System [Module 2]:- Entity–Relationship Data Model3
- Database Management System [Module 3]:-Relational Model and relational Algebr6
- Database Management System [Module 4]:- Structured Query Language (SQL)21
- 26.1Introduction to SQL7 Minutes
- 26.2Data definition language10 Minutes
- 26.3DML ( data manipulation language )7 Minutes
- 26.4DRL ( Data Retrieval Language)7 Minutes
- 26.5Aggregate Function in SQL9 Minutes
- 26.6PL SQL | part 1 |8 Minutes
- 26.7PL SQL | part 2 |8 Minutes
- 26.8Query Processing And Query Optimisation [Part 1]11 Minutes
- 26.9Query Processing And Query Optimisation [Part 2]9 Minutes
- 26.10Query Processing And Query Optimisation [Part 3]6 Minutes
- 26.11Query Processing And Query Optimisation [Part 4]3 Minutes
- 26.12Integrity Constraints7 Minutes
- 26.13Trigger8 Minutes
- 26.14Types Of Joins & Inner Join15 Minutes
- 26.15Left, Right & Full Join5 Minutes
- 26.16SQL Queries | Solved Example – 117 Minutes
- 26.17SQL Queries | Solved Example – 217 Minutes
- 26.18SQL Queries | Solved Example – 312 Minutes
- 26.19SQL Queries | Solved Example – 415 Minutes
- 26.20SQL Queries | Solved Example – 59 Minutes
- 26.21Notes
- Database Management System [Module 5]:- Relational-Database Design7
- Database Management System [Module 6 ]:- Transactions Management and Concurrence12
- 28.1Concurrency Control9 Minutes
- 28.2Concurrency Control – Lock Based Protocol in DBMS Transaction8 Minutes
- 28.3Timestamp Based Protocol11 Minutes
- 28.4Deadlock Full concept in DBMS transaction management12 Minutes
- 28.5Shadow Paging in Database Recovery12 Minutes
- 28.6Log Based Database Recovery8 Minutes
- 28.7Shadow Copy Technique in Database recovery5 Minutes
- 28.8Transaction State and Acid Properties5 Minutes
- 28.9Transaction Schedule7 Minutes
- 28.10View Serializability5 Minutes
- 28.11Conflict Serializability9 Minutes
- 28.12Notes
- Engineering Maths- 4 [Module 1]:- Complex Integration8
- 29.1Complex integration along a Line or Parabola with Solved Example17 Minutes
- 29.2Complex integration along a Circle with Solved Example
- 29.3Cauchy’s Theorem Basics & Cauchy’s integral formula Type 113 Minutes
- 29.4Cauchy’s Theorem Type 2 and Type 310 Minutes
- 29.5Cauchy’s Theorem Type 4 and Type 512 Minutes
- 29.6Taylor and Laurent series Full Basic with Solved Example part 115 Minutes
- 29.7Taylor and Laurent series Full Basic with Solved Example part 217 Minutes
- 29.8Complex Integration Notes
- Engineering Maths- 4 [Module 2]:- Linear Algebra / Matrices13
- 30.1Introduction to Matrices7 Minutes
- 30.2Eigen value and Eigen vector in Matrices17 Minutes
- 30.3Eigen value and Eigen vectors for Types of Matrices6 Minutes
- 30.4Cayley Hamilton Theorem with Example Part 19 Minutes
- 30.5Cayley Hamilton Theorem with Example Part 25 Minutes
- 30.6Cayley Hamilton Theorem with Example Part 34 Minutes
- 30.7Monic and Minimal Polynomial of a Matrix5 Minutes
- 30.8Algebraic multiplicity And Geometric multiplicity10 Minutes
- 30.9Functions of a Square Matrix in Matrices7 Minutes
- 30.10Reduction of Quadratic form to Canonical form13 Minutes
- 30.11Orthogonal Matrix with Solved Example9 Minutes
- 30.12Matrices Notes
- 30.13Practice problems solution key matrices
- Engineering Maths- 4 [Module 3]:- Sampling Theory13
- 31.1What Is Sampling8 Minutes
- 31.2Large Sampling Problems16 Minutes
- 31.3Large Sampling Test Theory+Numerical16 Minutes
- 31.4Hypothesis Testing Full concept2 Minutes
- 31.5Testing Difference Between Means(case_1) With Examples11 Minutes
- 31.6Small Sample Test Example13 Minutes
- 31.7Small Sample Test4 Minutes
- 31.8Testing Difference Between Means(case_1) With Examples Part 25 Minutes
- 31.9Testing Difference Between Means(case_2)12 Minutes
- 31.10Non Parametric Test Type_1_Numerical8 Minutes
- 31.11Non Parametric Test4 Minutes
- 31.12Sampling Theory Notes
- 31.13Solution key for Sampling Theory
- Engineering Maths- 4 [Module 4]:- Mathematical Programming / Linear Programming10
- 32.1Basics of simplex method in LPP11 Minutes
- 32.2Standard form of LPP Simplex Method12 Minutes
- 32.3Types of Solutions in Simplex Method in LPP14 Minutes
- 32.4How to Solve LPP using Simplex method18 Minutes
- 32.5LPP Using Big M method ( Penalty Method )25 Minutes
- 32.6Relationship between Primal and Dual17 Minutes
- 32.7Duality of LPP ( Primal and Dual )17 Minutes
- 32.8Dual Simplex Method in LPP17 Minutes
- 32.9Linear Programming Problems Notes
- 32.10Linear Programming solution key
- Engineering Maths- 4 [Module 5]:- Calculus of Variation14
- 33.1Euler’s Differential Equation11 Minutes
- 33.2Functions of Second Order Derivative9 Minutes
- 33.3Gram Schmidt Process With Numerical19 Minutes
- 33.4Hypothesis Concerning Several Proportions7 Minutes
- 33.5Linear Combinations Of Vector5 Minutes
- 33.6Non Parametric Test Type_2_Numerical5 Minutes
- 33.7Pythagorean Theorem4 Minutes
- 33.8Subspaces10 Minutes
- 33.9Cauchy Schwarz Inequality in R^5 Minutes
- 33.10Lagranges Method9 Minutes
- 33.11Rayleigh Ritz Method12 Minutes
- 33.12Calculus of Variation
- 33.13Calculus of Variation Notes
- 33.14Calculus of Variation Practice Problem and Solution
- Engineering Maths- 4 [Module 6]:- Correlation (EXTC, Electrical , Electronics)4
- Engineering Maths- 4 [Module 7]:- Regression (EXTC, Electrical , Electronics)4
- Engineering Maths- 4 [Module 8]:- Probability Distribution12
- 36.1Introduction to Probability Distribution7 Minutes
- 36.2Discrete Random Variable in Probability Distribution15 Minutes
- 36.3Distribution function of Discrete Random Variable15 Minutes
- 36.4Continuous Random Variable in Probability Distribution14 Minutes
- 36.5Continuous Distribution Function in Probability Distribution14 Minutes
- 36.6Expectation in Probability Distribution12 Minutes
- 36.7Mean and Variance Part 1 in Probability Distribution11 Minutes
- 36.8Mean and Variance Part 2 in Probability Distribution13 Minutes
- 36.9Moments and Moments Generating Function Part #1 in Probability Distribution13 Minutes
- 36.10Moments and Moments Generating Function Part #2 in Probability Distribution11 Minutes
- 36.11Probability Notes
- 36.12Practice problem solution key for Probability
- Engineering Maths- 4 [Module 9]:- Vector Calculus7
- Engineering Maths- 4 [Module 10]:- Z transform9
- 38.1Introduction to Z transform16 Minutes
- 38.2Z Transforms Change Of Scale5 Minutes
- 38.3Z Transforms Linearity9 Minutes
- 38.4Z Transforms multiplication by k10 Minutes
- 38.5Z Transforms Of Standard Functions8 Minutes
- 38.6Z Transforms Shifting Property5 Minutes
- 38.7Inverse Z transform using binomial expansion8 Minutes
- 38.8Inverse Z transform using partial fractions20 Minutes
- 38.9Notes
- Database Management System [IMP]1