Digital System Designing

Duration: 13 min

This video lesson is available to enrolled students.

Return to /learn/BIHAR-STET-COMPUTER-SCIENCE-COMPLETE-COURSE/unit-1-digital-electronics/dig-sys-boolean-basics/digital-fundamentals-boolean-algebra/asset-digital-system-designing after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About the course: About the Course
  2. Mathematical Aptitude: संख्या पद्धति / Number System, महत्तम समापवर्तक और लघुत्तम समापवर्त्य / HCF and LCM, Divisibility Rules, प्रतिशत / Percentage, अनुपात और समानुपात / Ratio and Proportion, औसत / Average, लाभ, हानि और बट्टा / Profit, Loss and Discount, समय और कार्य / Time and Work, घन क्षेत्रमिति / Solid Mensuration, साधारण और चक्रवृद्धि ब्याज / Simple and Compound Interest, समय, चाल और दूरी / Time, Speed and Distance, Age Problems, मिश्रण और एलिगेशन / Mixture and Alligation, Algebra, सरलीकरण, घातांक और करणी / Simplification, Indices and Surds, Pipe and Cistern, Trigonometry, Statistics, आँकड़ा निर्वचन / Data Interpretation, Arithmetic, समुच्चय, संबंध, फलन और विविक्त गणित / Sets, Relations, Functions and Discrete Mathematics, संख्या पद्धति और संख्या सिद्धांत / Number Systems and Number Theory, निर्देशांक ज्यामिति, सदिश और त्रिविमीय ज्यामिति / Coordinate Geometry, Vectors and 3D Geometry, बहुपद, समीकरण और सम्मिश्र संख्याएँ / Polynomials, Equations and Complex Numbers
  3. Logical Reasoning: श्रेणी / Series, कूट लेखन एवं कूट वाचन / Coding-Decoding, सादृश्यता एवं वर्गीकरण / Analogy and Classification, रक्त संबंध / Blood Relations, दिशा एवं दूरी / Direction and Distance, क्रम एवं रैंकिंग / Order and Ranking, अशाब्दिक तर्क / Non-Verbal Reasoning, बैठक व्यवस्था एवं पहेलियाँ / Seating Arrangement and Puzzles, Syllogisms, वेन आरेख, न्याय वाक्य एवं असमानता / Venn Diagrams, Syllogism and Inequalities, गणितीय संक्रियाएँ एवं लुप्त संख्या / Mathematical Operations and Missing Numbers, वर्णमाला एवं संख्या परीक्षण / Alphabet and Number Test, कथन आधारित तार्किक विवेचन / Statement-Based Reasoning, Analytical Reasoning (Counting Figures Reasoning), घन, पासा एवं आकृतियों की गिनती / Cubes, Dice and Figure Counting, कैलेंडर एवं घड़ी / Calendar and Clock, Clock
  4. General Knowledge: वैज्ञानिक उपलब्धियाँ और अनुसंधान / Scientific Achievements and Research, Chemistry, Biology, History, Geography, Polity, Indian Economy, समसामयिकी / Current Affairs, Static General Knowledge
  5. Art of Teaching: शिक्षण-अधिगम प्रक्रिया एवं कक्षा प्रबंधन / Teaching-Learning Process and Classroom Management, Learners & Learning Process, Factors Affecting Teaching, शिक्षण विधियाँ एवं उपागम / Teaching Methods and Approaches, सूक्ष्म शिक्षण एवं कक्षा संप्रेषण / Microteaching and Classroom Communication, शिक्षण सहायक सामग्री एवं शैक्षिक तकनीकी / Teaching Aids and Educational Technology, आकलन एवं मूल्यांकन / Assessment and Evaluation, शिक्षक: गुण, व्यावसायिक नैतिकता एवं विकास / Teacher: Qualities, Professional Ethics and Development, शैक्षिक नीतियाँ, अधिनियम एवं प्रशासन / Educational Policies, Acts and Administration, पाठ्यचर्या, कला एवं सह-शैक्षिक क्षेत्र / Curriculum, Arts and Co-curricular Areas, निर्देशन एवं परामर्श / Guidance and Counselling, दिव्यांग बच्चों की शिक्षा / Education of Children with Disabilities, Micro-Teaching & Teaching Skills, पाठ योजना / Lesson Planning
  6. Environmental Science: Environment
  7. Unit 1 | Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
  8. Unit 2 | COA: Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Instr Formats & Modes, Control Unit Design, Register Transfer and Microoperations, Programming the Basic Computer
  9. Unit 3 | C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  10. Unit 3 | Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  11. Unit 4 | Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Advanced Algorithms
  12. Unit 5 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management
  13. Unit 6 | Database Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, File Organization & Indexing, Relational Algebra, SQL, Transaction Management, Concurrency Control
  14. Unit 7 | Computer Networks: Introduction to CN, Data Communication, DLL: Access Control, DLL: Flow Control, DLL: Error Control, DLL: Framing, Data Link Layer - Ethernet, Net Layer: IPv4 & Proto, Net Layer: IP Addressing, Net Layer:Routing Protocol, Transport Layer Services, TL: Congestion & UDP, Application Layer
  15. Unit 8 | Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  16. Unit 9 | Object Oriented Programming: OOPS with C++
  17. Unit 10 | Web Development: HTML Basics, CSS, JavaScript-Basics, XML, Node.js
  18. Unit 11 | Theory Of Computation: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Grammar, Regular Language Properties, Moore & Mealy Machines, Pushdown Automata & CFG, Turing Machines
  19. Unit 12 | IoT: Emerging Tech Trends, Cloud Computing, कंप्यूटर नेटवर्क / Computer Networks
  20. Unit 13 | Artificial Intelligence: Approaches to AI, Search Algorithms, Game Playing, Knowledge Representation, Natural Language Processing, Artificial Neural Networks, Genetic Algorithms
  21. Unit 14 | E-Commerce: Electronic Data Interchange and E-Commerce, Role of Internet and Web Services, Security in Mobile and Wireless Computing, Physical Security and Cryptography Basics, Cyber Safety and Security
  22. Unit 15 | Multimedia: Multimedia
  23. Unit 16 | Python: Introduction to Python, Tokens, Variables, Data Types, I/O, Operators & Expressions, Control Flow & Looping, Collections & Strings, Functions & Modules, File Handling & Data Analysis, DSA using Python
  24. Full Length Mock Tests — General Paper:
  25. Full Length Mock Tests — Computer Science (Paper II):
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This lecture introduces a step-by-step digital system design workflow using a car warning signal example. The instructor begins by stating that the session will demonstrate how to design a digital system starting from a problem statement. The specific problem asks students to design a digital system for a car manufacturing company, with inputs defined as the lights of the car (L), day or night (D), and ignition on/off. The first step is to understand the problem definition, followed by designing a truth table with columns for Light, Day, Engine, and Warning. The instructor fills the eight-row binary truth table (000 to 111) by marking warning conditions, then writes the Boolean expression in both Sum of Products (SoP) and Product of Sums (PoS) forms: W(L,D,E) = Σm(1,4,6,7) and W(L,D,E) = ΠM(0,2,3,5). The next step minimizes the Boolean expression using a Karnaugh map labeled 00, 01, 11, and 10 with rows c' = 0 and c = 1. Finally, the minimized expression W = ac' + ab + a'b'c is implemented using logic gates: three input lines pass through inverters, feed into AND gates, and their outputs combine at a final OR gate producing W. The lesson emphasizes the complete design sequence: problem statement, truth table, Boolean expression, minimization, and gate-level implementation.

Chapters

  1. 0:00 – 2:00 00:00-02:00

    The instructor introduces the topic with on-screen text reading 'Let's try an example of designing a digital device, using this example, we will understand step by step process to design a digital system starting from problem statement.' He gestures while explaining that the session will walk through a complete design process. The slide title 'Digital system designing' is visible, establishing the lecture's focus on a practical example rather than abstract theory.

  2. 2:00 – 5:00 02:00-05:00

    The problem statement appears on screen: 'Design a digital system for a car manufacturing company' with inputs listed as lights of the car (L), day or night (D), and ignition on/off. The solution begins with '1) Understand the problem' followed by 'Design the truth table.' A four-column truth table with orange headers Light, Day, Engine, and Warning is displayed, listing binary rows from 000 to 111. The instructor uses a pen to point at specific rows, such as the 0/0 row and the 0/1/1 row, while progressively filling the Warning column with hand-drawn marks to indicate which input combinations produce a warning output.

  3. 5:00 – 10:00 05:00-10:00

    The lecture moves to Boolean expression formulation. Slide 2 shows 'Write the Boolean expression' with W(L,D,E) = Σm(1,4,6,7) annotated as SoP and W(L,D,E) = ΠM(0,2,3,5) annotated as PoS. Minterm numbers 0 through 7 are written in the right margin of the truth table to connect rows with their binary indices. Slide 3 then presents 'Minimize Boolean expression' showing W = a'b'c + ab'c' + abc' + abc above a Karnaugh map with column labels 00, 01, 11, 10 and row labels c' = 0 and c = 1. The instructor demonstrates how to group minterms on the K-map to derive a simplified expression.

  4. 10:00 – 12:40 10:00-12:40

    The final step is gate-level implementation. The slide reads '4) Implement the expression using logic gates, draw the implementation using logic gates' followed by the minimized expression W = ac' + ab + a'b'c. The instructor hand-draws the circuit: three vertical input lines labeled a, b, and c each pass through an inverter symbol at the top. Wires from these inputs connect into three AND gates, and their outputs feed a final OR gate labeled 'W.' A completed truth table with Light, Day, Engine, and Warning columns remains visible on the right side of the slide throughout this section.

The lecture follows a structured five-stage digital design methodology applied to a car warning signal. Stage one defines the problem with three binary inputs (lights, day/night, ignition) and one output (warning). Stage two constructs a complete truth table covering all eight input combinations, with the instructor marking warning conditions row by row. Stage three converts the truth table into canonical Boolean forms, explicitly showing both minterm (SoP) and maxterm (PoS) representations with their numeric indices. Stage four applies Karnaugh map minimization to reduce the expression from its canonical sum form to a simplified three-term expression. Stage five translates the minimized Boolean equation into a physical gate circuit using inverters, AND gates, and an OR gate. The pedagogical approach emphasizes that each stage depends on the previous one: you cannot write a Boolean expression without a truth table, cannot minimize without a canonical form, and cannot implement gates without a minimized expression. The car example provides concrete context for abstract logic design concepts, making the workflow memorable and exam-relevant.

Loading lesson…