Protected: Product Development: Full Software Engineering Program

Featured
Beginner-to-expert
Free Software Product Development Course
Product Development Software Development web development

Product Development: Full Software Engineering Program

Trending and Recommended
stanley inegben stanley inegben
0 (0)
Overview
Curriculum
Reviews
  • 22 Sections
  • 241 Lessons
  • 5 Assignments
  • 0m Duration
Collapse All
Module 1: Computer Science & Software Engineering Foundations
1 Lesson
  1. Introduction to Computing & Software Engineering
Module 2: Computer Organization and Architecture (COA)
96 Lessons
  1. Introduction to Computer Organization and Architecture (COA)
  2. Basics of Computer Architecture
  3. Classifications of Computer Architecture
  4. Introduction to Memory
  5. Memory Hierarchy & Interfacing
  6. Memory Interfacing – Solved PYQs
  7. Introduction to Cache Memory
  8. Direct Memory Mapping
  9. Direct Memory Mapping – Solved Examples
  10. Direct Memory Mapping – Solved PYQs (Part 1)
  11. Direct Memory Mapping – Solved PYQs (Part 2)
  12. Direct Memory Mapping – Solved PYQs (Part 3)
  13. Direct Memory Mapping – Hardware Implementation
  14. Associative Mapping
  15. Associative Mapping – Solved Examples
  16. Associative Mapping – Solved PYQ
  17. Set Associative Mapping
  18. Set Associative Mapping – Solved Examples (Part 1)
  19. Set Associative Mapping – Solved Examples (Part 2)
  20. Set Associative Mapping – Solved PYQs (Part 1)
  21. Set Associative Mapping – Solved PYQs (Part 2)
  22. Cache Memory Mapping – A Comparative Study
  23. Cache Memory Mapping – Solved PYQ
  24. Set Associative Mapping – Bonus PYQs
  25. Cache Design - An Overview
  26. Cache Replacement Policies - RR, FIFO, LIFO, & Optimal
  27. Cache Replacement Policies - MRU, LRU, Pseudo-LRU, & LFU
  28. LRU Cache Replacement Policy - Solved PYQs
  29. Cache Coherence Problem & Cache Coherency Protocols
  30. Snooping-based Cache Coherency Protocol
  31. Directory-based Cache Coherency Protocol
  32. Introduction to Primary Memory
  33. Primary Memory – Architecture of ROM (Part 1)
  34. Primary Memory – Architecture of ROM (Part 2)
  35. Primary Memory – Architecture of ROM (Part 3)
  36. Primary Memory – Architecture of ROM (Part 4)
  37. ROM – Solved Examples
  38. Primary Memory – RAM
  39. Primary Memory – Solved Example
  40. Introduction to Secondary Memory
  41. Secondary Memory – Hard Disk Drives
  42. Hard Disk Drives (Solved Problems) - Set 1
  43. Hard Disk Drives – Recording Density & Rotational Speed
  44. Hard Disk Drives (Solved Problems) - Set 2
  45. Hard Disk Drives (Solved Problems) - Set 3
  46. Hard Disk Drives (Solved Problems) - Set 4
  47. Hard Disk Drives (Solved Problems) - Set 5
  48. Secondary Memory – Solid State Drives
  49. Introduction to Number Systems
  50. Binary Number System
  51. Octal Number System
  52. Hexadecimal Number System
  53. Conversion to Decimal Number System
  54. Conversion from Decimal Number System
  55. Number System – Solved Problems (Set 1)
  56. Number System – Solved Problems (Set 2)
  57. Number System – Solved Problems (Set 3)
  58. Number System – Solved Problems (Set 4)
  59. Introduction to Complementary Number Systems
  60. Complementary Number Systems - Examples
  61. Diminished Radix and Radix Complement
  62. Subtraction in Diminished Radix Complement
  63. Subtraction in Radix Complement
  64. Representations of Binary Numbers
  65. Representations of Binary Numbers - Solved Problems
  66. Sign bit Extension (Part 1)
  67. Sign bit Extension (Part 2)
  68. Overflow in Signed and Unsigned Numbers
  69. Introduction to Binary Codes
  70. 8421, Excess-3, and 3321 Codes
  71. Binary Codes - Solved Problems
  72. BCD Addition
  73. BCD Adder
  74. Excess-3 Addition
  75. Gray Code
  76. Error Detection
  77. Error Correction
  78. Problem of Encoding in Error Detection and Correction
  79. Hamming Code
  80. Hamming Code – Solved Problems
  81. Floating Point Numbers
  82. Representations of Floating Point Numbers
  83. Explicit vs. Implicit Normalization of Floating Point Numbers
  84. Floating Point Numbers - Solved Problems
  85. IEEE Standard for Floating-Point Arithmetic (IEEE 754)
  86. IEEE 754 - Single and Double Precision
  87. IEEE 754 - Solved Problems (Set 1)
  88. IEEE 754 - Solved Problems (Set 2)
  89. Binary Multiplication
  90. The Concept of Booth’s Algorithm
  91. The Implementation of Booth’s Algorithm
  92. Binary Division
  93. The Concept of Restoring Division
  94. Implementation of Restoring Division
  95. Improving the Hardware of Restoring Division
  96. Non-Restoring Division
Module 3: Linear Algebra for Computing
1 Lesson
  1. Linear Algebra (A Full College Course)
Module 4: Linear Algebra for Computing (Essence of Linear Algebra)
16 Lessons
  1. Vectors | Chapter 1, Essence of linear algebra
  2. Chapter 2: Linear combinations, span, and basis vectors
  3. Chapter 3: Linear transformations and matrices
  4. Chapter 4: Matrix multiplication as composition
  5. Chapter 5: Three-dimensional linear transformations
  6. Chapter 6: The determinant
  7. Chapter 7: Inverse matrices, column space and null space
  8. Chapter 8: Nonsquare matrices as transformations between dimensions
  9. Chapter 9: Dot products and duality
  10. Chapter 10: Cross products
  11. Chapter 11: Cross products in the light of linear transformations
  12. Chapter 12: Cramer's rule, explained geometrically
  13. Chapter 13: Change of basis
  14. Chapter 14: Eigenvectors and eigenvalues
  15. Chapter 15: A quick trick for computing eigenvalues
  16. Chapter 16: Abstract vector spaces
Module 5: Discrete Math (Sets, Logic, Proofs, Probability, Graph Theory, etc)
86 Lessons
  1. Intro to Discrete Math
  2. Intro to Sets | Examples, Notation & Properties
  3. Set-Roster vs Set-Builder notation
  4. The Empty Set & Vacuous Truth
  5. Cartesian Product of Two Sets A x B
  6. Relations between two sets | Definition + First Examples
  7. The intuitive idea of a function
  8. Formal Definition of a Function using the Cartesian Product
  9. Example: Is this relation a function?
  10. Intro to Logical Statements
  11. Intro to Truth Tables | Negation, Conjunction, and Disjunction
  12. Truth Table Example: ~p V ~q
  13. Logical Equivalence of Two Statements
  14. Tautologies and Contradictions
  15. 3 Ways to Show a Logical Equivalence | Ex: DeMorgan's Laws
  16. Conditional Statements: if p then q
  17. Vacuously True Statements
  18. Negating a Conditional Statement
  19. Contrapositive of a Conditional Statement
  20. The converse and inverse of a conditional statement
  21. Biconditional Statements | "if and only if"
  22. Logical Arguments - Modus Ponens & Modus Tollens
  23. Logical Argument Forms: Generalizations, Specialization, Contradiction
  24. Analyzing an argument for validity
  25. Predicates and their Truth Sets
  26. Universal and Existential Quantifiers, ∀ "For All" and ∃ "There Exists"
  27. Negating Universal and Existential Quantifiers
  28. Negating Logical Statements with Multiple Quantifiers
  29. Universal Conditionals P(x) implies Q(x)
  30. Necessary and Sufficient Conditions
  31. Formal Definitions in Math | Ex: Even & Odd Integers
  32. How to Prove Math Theorems | 1st Ex: Even + Odd = Odd
  33. Step-By-Step Guide to Proofs | Ex: product of two evens is even
  34. Rational Numbers | Definition + First Proof
  35. Proving that divisibility is transitive
  36. Disproving implications with Counterexamples
  37. Proof by Division Into Cases
  38. Proof by Contradiction | Method & First Example
  39. Proof by Contrapositive | Method & First Example
  40. Quotient-Remainder Theorem and Modular Arithmetic
  41. Proof: There are infinitely many primes numbers
  42. Introduction to sequences
  43. The formal definition of a sequence.
  44. The sum and product of finite sequences
  45. Intro to Mathematical Induction
  46. Induction Proofs Involving Inequalities.
  47. Strong Induction // Intro and Full Example
  48. Recursive Sequences
  49. The Miraculous Fibonacci Sequence
  50. Prove A is a subset of B with the ELEMENT METHOD
  51. Proving equalities of sets using the element method
  52. The union of two sets
  53. The Intersection of Two Sets
  54. Universes and Complements in Set Theory
  55. Using the Element Method to prove a Set Containment w/ Modus Tollens
  56. Power Sets and the Cardinality of the Continuum
  57. Relations and their Inverses
  58. Reflexive, Symmetric, and Transitive Relations on a Set
  59. Equivalence Relations - Reflexive, Symmetric, and Transitive
  60. check every spot for reflexivity, symmetry, and transitivity
  61. Introduction to probability // Events, Sample Space, Formula, Independence
  62. Example: Computing Probabilities using P(E)=N(E)/N(S)
  63. What is the probability of guessing a 4 digit pin code?
  64. Counting with Triple Intersections // Example & Formula
  65. Permutations: How many ways to rearrange the letters in a word?
  66. The summation rule for disjoint unions
  67. Counting formula for two intersecting sets: N(A union B)=N(A)+N(B)-N(A intersect B)
  68. Combinations Formula: Counting the number of ways to choose r items from n items.
  69. How many ways are there to reorder the word MISSISSIPPI? // Choose Formula Example
  70. Counting and Probability Walkthrough
  71. Intro to Conditional Probability
  72. Two Conditional Probability Examples (what's the difference???)
  73. Conditional Probability With Tables | Chance of an Orange M&M???
  74. Bayes' Theorem - The Simplest Case
  75. Bayes' Theorem Example: Surprising False Positives
  76. Bayes' Theorem - Example: A disjoint union
  77. IS CHESS A GAME OF CHANCE? Classical vs Frequentist vs Bayesian Probability
  78. Intro to Markov Chains & Transition Diagrams
  79. Markov Chains & Transition Matrices
  80. Intro to Linear Programming
  81. Intro to Graph Theory | Definitions & Ex: 7 Bridges of Konigsberg
  82. Properties in Graph Theory: Complete, Connected, Subgraph, Induced Subgraph
  83. Degree of Vertices | Definition, Theorem & Example | Graph Theory
  84. Euler Paths & the 7 Bridges of Konigsberg | Graph Theory
  85. The End of Discrete Math - Congrats! Some final thoughts
  86. Discrete Mathematics by Shanghai Jiaotong University
Module 6: Programming Fundamentals with Python
2 Lessons
  1. Python for Beginners
  2. Python for Beginners
Practical Assignments 1
2 Assignments
  1. Project 1:
  2. Project 2
Module7: Data Structures & Algorithms + Object-Oriented Programming
2 Lessons
  1. Algorithms and Data Structures Tutorial
  2. Data Structures Easy to Advanced Course - Full Tutorial from a Google Engineer
Module 8: Object-Oriented Programming (OOP) in Python
2 Lessons
  1. Python Object Oriented Programming (POOP)
  2. Object Oriented Programming with Python 2
Module 9: Integrating Data Structures with OOP
6 Lessons
  1. Classes and Instances
  2. Class Variables
  3. class methods and static methods
  4. Inheritance - Creating Subclasses
  5. Special (Magic/Dunder) Methods
  6. Property Decorators - Getters, Setters, and Deleters
Practical Assignments 2
1 Assignment
  1. Project 3 and 4
Module 10: Web Development (Front-End)
2 Lessons
  1. Full Stack Web Development for Beginners (Full Course on HTML, CSS, JavaScript, Node.js, MongoDB)
  2. Front-End Framework: React.js
Module 11: Web Development (Back-End)
6 Lessons
  1. Node.js and Express.js
  2. Node JS Backend Tutorials Step by Step With Example
  3. Database Management: MongoDB
  4. SQL For Web Developers
  5. MySQL
  6. Mongoose Crash Course
Module 12: Integrating Front-End and Back-End (MERN Stack)
1 Lesson
  1. MERN Stack Tutorial with Deployment
Practical Assignments 3
1 Assignment
  1. Project 5-9
Module 13: DevOps, Cloud, and Deployment
6 Lessons
  1. Introduction to DevOps
  2. Continuous Integration and Continuous Deployment (CI/CD)
  3. Containerization with Docker
  4. Container Orchestration with Kubernetes
  5. Cloud Deployment with AWS
  6. AWS S3 Full Course
Practical Assignments 4
1 Assignment
  1. Project 10-13
Module 14: Cybersecurity & Secure Software Development
4 Lessons
  1. Introduction to Cybersecurity for Developers
  2. Common Software Vulnerabilities (OWASP Top 10)
  3. Web App Vulnerabilities - DevSecOps Course
  4. How to Analyze Code for Vulnerabilities
Module 15: Agile Product Development & Software Lifecycle
5 Lessons
  1. Introduction to Agile Methodologies
  2. Scrum Framework Deep Dive
  3. Scrum Master Full Course
  4. Kanban
  5. Lean Software Development Process
Software Development Life Cycle (SDLC) Overview
2 Lessons
  1. Entire Software Development Life Cycle
  2. Integrating Agile with SDLC
Tools for Agile and SDLC Management
3 Lessons
  1. Jira
  2. Git & GitHub Crash Course
  3. Miro
Module 15: Capstone Project & Portfolio Building

The Product Development: Full Software Engineering Program is a comprehensive, project-driven training designed to elevate beginners into fully-equipped software professionals. Over approximately 9-11 months, learners gain expertise across four key domains:

  1. Foundational Engineering – mastering programming (Python & JavaScript), data structures, algorithms, and software architecture.
  2. Full‑Stack Development – building responsive, user-friendly front‑ends (React), scalable back‑ends (Node.js/Express), and database integration (SQL/NoSQL).
  3. Security, DevOps & Cloud – applying cybersecurity best practices, containerization (Docker), orchestration (Kubernetes), CI/CD pipelines, and cloud deployment.
  4. Product-Centered Software Delivery – embracing Agile methodologies (Scrum/Kanban), product lifecycle management, and cross-functional collaboration.

Learners progress through theory-rich lessons and hands-on assignments, culminating in a capstone project that blends technical implementation, product thinking, documentation, and deployment.

Graduates emerge as well-rounded professionals ready for roles such as Full‑Stack Engineer, DevOps Engineer, Product Engineer, or Technical Product Manager.

Create a new review.

×

Free Lesson Videos:

Deleting Course Review

Are you sure? You can't restore this back

Course Access

This course is password protected. To access it please enter your password below:

Scroll to top