Digital System Designing

Duration: 13 min

This video lesson is available to enrolled students.

Return to /learn/BPSC/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. Section 1 | Language (Hindi): भाषा, लिपि और वर्ण, वर्तनी, वर्ण-विन्यास, अनुस्वार, अनुनासिक, चंद्रबिंदु और ‘र’ के रूप, शब्द, पद और शब्द-भेद, संज्ञा और सर्वनाम, पद-भेद और रूप-विकार, लिंग, वचन, पुरुष और कारक, काल, वाच्य, वाक्य और वाक्य-भेद, संधि, समास, विलोम शब्द, पर्यायवाची शब्द, सामान्य अशुद्धियाँ, अनेक शब्दों के लिए एक शब्द, शब्द-भंडार, अपठित बोध, Multi-Topic Content (Cross-Concept Material), वर्णमाला
  3. Section 1 | Language (उर्दू भाषा — 22 प्रश्न (निश्चित)): رسم الخط، حروفِ تہجی اور املا / Script, Alphabet and Spelling, اسم، ضمیر اور صفت / Nouns, Pronouns and Adjectives, الفاظ، محاورے اور ضرب الامثال / Vocabulary, Idioms and Proverbs, تفہیمِ عبارت، انشا اور ترجمہ / Comprehension, Writing and Translation, Comprehension
  4. Section 1 | Language (বাংলা / बांग्ला भाषा — 22 प्रश्न (निश्चित)): শব্দার্থ, বাগধারা ও ভাষাশুদ্ধি / Meaning, Idioms and Correct Usage, বাক্য ও বাচ্য / Sentences and Voice, শব্দগঠন ও শব্দভান্ডার / Word Formation and Vocabulary, অনুবাদ, বোধপরীক্ষণ ও রচনা / Translation, Comprehension and Composition
  5. Section 1 | Language (English): Vocabulary, Noun, Subject Verb Agreement (Verb Noun Agreement), Adjectives, Verbs and Tenses, Pronoun, Verb, Adverb, Prepositions and Conjunctions, Parts of Speech, Determiner, Conjunction, Modals, Transformation of Sentences, Direct and Indirect Speech, Sentence Correction (Error Correction), Sentence Completion (Fill in the blanks), Sentence Construction, Sentence Structure and Common Errors, Reading Comprehension, Cloze Test (Cloze Passage), Verbal Analogy (Word Based Analogy), Facts, Inference and Judgements
  6. Section 2 | Primary Maths & Reasoning: अनुपात और समानुपात / Ratio and Proportion, Divisibility Rules, मिश्रण और एलिगेशन / Mixture and Alligation, Permutation and Combination, संख्या पद्धति / Number System, महत्तम समापवर्तक और लघुत्तम समापवर्त्य / HCF and LCM, Sequence and Series (Series), समय, चाल और दूरी / Time, Speed and Distance, श्रेणी / Series, कूट लेखन एवं कूट वाचन / Coding-Decoding, अशाब्दिक तर्क / Non-Verbal Reasoning, प्रतिशत / Percentage, औसत / Average, लाभ, हानि और बट्टा / Profit, Loss and Discount, साधारण और चक्रवृद्धि ब्याज / Simple and Compound Interest, समय और कार्य / Time and Work, घन क्षेत्रमिति / Solid Mensuration, Age Problems, Arithmetic, सरलीकरण, घातांक और करणी / Simplification, Indices and Surds, Algebra, Probability, Trigonometry, Syllogisms, बैठक व्यवस्था एवं पहेलियाँ / Seating Arrangement and Puzzles, रक्त संबंध / Blood Relations, दिशा एवं दूरी / Direction and Distance, Analytical Reasoning (Counting Figures Reasoning), गणितीय संक्रियाएँ एवं लुप्त संख्या / Mathematical Operations and Missing Numbers, कैलेंडर एवं घड़ी / Calendar and Clock, Clock, घन, पासा एवं आकृतियों की गिनती / Cubes, Dice and Figure Counting, वेन आरेख, न्याय वाक्य एवं असमानता / Venn Diagrams, Syllogism and Inequalities, Data Arrangement, Inequality, सादृश्यता एवं वर्गीकरण / Analogy and Classification, क्रम एवं रैंकिंग / Order and Ranking, समुच्चय, संबंध, फलन और विविक्त गणित / Sets, Relations, Functions and Discrete Mathematics, संख्या पद्धति और संख्या सिद्धांत / Number Systems and Number Theory, निर्देशांक ज्यामिति, सदिश और त्रिविमीय ज्यामिति / Coordinate Geometry, Vectors and 3D Geometry, बहुपद, समीकरण और सम्मिश्र संख्याएँ / Polynomials, Equations and Complex Numbers
  7. Section 2 | General Awareness (GK + Current Affairs): Polity, वैज्ञानिक उपलब्धियाँ और अनुसंधान / Scientific Achievements and Research, Biology, राज्य विशेष सामान्य ज्ञान / State-Specific General Knowledge, Chemistry, History, Geography, Indian Economy, Environment, समसामयिकी / Current Affairs, Static General Knowledge
  8. Section 3 | Computer System and Org. (CSO): Basics of COA, Floating Point Rep, Cache Memory Organization, Instr Formats & Modes, Programming the Basic Computer, Input Output Organisation, Register Transfer and Microoperations, Control Unit Design
  9. Section 3 | Database Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, SQL, File Organization & Indexing, Relational Algebra, Relational Calculus, Transaction Management, Concurrency Control
  10. Section 3 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Process Synchronization
  11. Section 3 | Computer Networks: Introduction to CN, Data Communication, DLL: Access Control, DLL: Flow Control, DLL: Error Control, Data Link Layer - Ethernet, Net Layer: IPv4 & Proto, Net Layer: IP Addressing, Transport Layer Services, TL: Congestion & UDP, Application Layer, Hardware basics
  12. Section 3 | Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Minimum Spanning Trees, Shortest Path Algos
  13. Section 3 | Theory Of Computation & Compiler Design: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Grammar, Regular Language Properties, Moore & Mealy Machines, Pushdown Automata & CFG, Turing Machines, Intro to Compilers, Lexical Analysis, Grammar & CFG, Syntax Analysis: Top-Down, Syntax Analysis: Bottom-Up, Semantic Analysis & SDT, Intermediate Code Gen, Code Optimization
  14. Section 3 | Emerging Trends (AI, Societal Ethics & MS Office): कंप्यूटर के मूल सिद्धांत / Computer Fundamentals, Emerging Tech Trends, Society, Law & Ethics, MS Office Applications, व्यापार, विपणन एवं उपभोक्ता संरक्षण / Trade, Marketing and Consumer Protection, साइबर सुरक्षा / Cyber Safety and Security, कंप्यूटर सॉफ़्टवेयर / Computer Software, ऑपरेटिंग सिस्टम / Operating System, कंप्यूटर नेटवर्क / Computer Networks, वर्ड प्रोसेसिंग (MS Word) / Word Processing (MS Word), Terms & Abbreviations, प्रेज़ेंटेशन (MS PowerPoint) / Presentation Software (MS PowerPoint)
  15. Section 3 | Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Maintenance and Configuration Management, Software Testing
  16. Section 3 | C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  17. Section 3 | OOPS, C++, JAVA, HTML: OOPS with C++, Java, HTML Basics, CSS
  18. Section 3 | Java: Java Fundamentals, Array, String, IO & References, OOPS with Java
  19. Section 3 | Python: Introduction to Python, Tokens, Variables, Data Types, I/O, Operators & Expressions, Control Flow & Looping, Collections & Strings, Functions & Modules, File Handling & Data Analysis
  20. Section 3 | Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
  21. Section 3 | Multimedia: Multimedia
  22. BPSC Previous Year Papers:
  23. BPSC Full Mock Tests:
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…