static hazard
Duration: 3 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- About the Course: About the Course
- Section 1 | भाषा (हिंदी) / Language (Hindi): भाषा, लिपि और वर्ण वर्तनी, वर्ण-विन्यास, अनुस्वार, अनुनासिक, चंद्रबिंदु और ‘र’ के रूप संज्ञा और सर्वनाम पद-भेद और रूप-विकार लिंग, वचन, पुरुष और कारक काल, वाच्य, वाक्य और वाक्य-भेद संधि समास पर्यायवाची शब्द सामान्य अशुद्धियाँ शब्द-भंडार अपठित बोध संज्ञानात्मक और रचनावादी अधिगम / Cognitive and Constructivist Learning वर्णमाला शब्द-विचार और शब्द-रचना वाक्य-विचार काव्यशास्त्र आधुनिक हिंदी कविता
- Section 1 | اردو زبان / Language (Urdu) — 22 Questions (Fixed): رسم الخط، حروفِ تہجی اور املا اسم، ضمیر اور صفت الفاظ، محاورے اور ضرب الامثال تفہیمِ عبارت، انشا اور ترجمہ فعل اور متعلقِ فعل حرف، جملہ اور رموزِ اوقاف علمِ بیان، بدیع اور عروض اردو زبان و ادب کی تاریخ اردو غزل ڈراما اور غیر افسانوی نثر اردو کی تدریس Health Education and Nutrition / स्वास्थ्य शिक्षा एवं पोषण
- Section 1 | বাংলা ভাষা / Language (Bengali) — 22 Questions (Fixed): শব্দার্থ, বাগধারা ও ভাষাশুদ্ধি বাক্য ও বাচ্য শব্দগঠন ও শব্দভান্ডার অনুবাদ, বোধপরীক্ষণ ও রচনা ধ্বনি, ধ্বনিপরিবর্তন ও সন্ধি পদপ্রকরণ কারক ও বিভক্তি সমাস বাংলা ভাষার ইতিহাস ও উপভাষা আধুনিক বাংলা কবিতা বাংলা কথাসাহিত্য বাংলা গদ্য, প্রবন্ধ ও নাটক
- 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) Phonetics and Linguistics
- Section 2 | Primary Maths & Reasoning / प्राथमिक गणित एवं तर्कशक्ति: Ratio and Proportion / अनुपात और समानुपात Divisibility Rules / विभाज्यता के नियम Mixture and Alligation / मिश्रण और एलिगेशन Permutation and Combination / क्रमचय और संचय Percentage / प्रतिशत Number System / संख्या पद्धति HCF and LCM / महत्तम समापवर्तक और लघुत्तम समापवर्त्य अनुक्रम, श्रेणी और संयोजन / Sequences, Series and Combinatorics Simplification, Indices and Surds / सरलीकरण, घातांक और करणी Algebra / बीजगणित Probability / प्रायिकता Profit, Loss and Discount / लाभ, हानि और बट्टा Simple and Compound Interest / साधारण और चक्रवृद्धि ब्याज Average / औसत Time and Work / समय और कार्य Time, Speed and Distance / समय, चाल और दूरी Solid Mensuration / घन क्षेत्रमिति Age Problems / आयु संबंधी प्रश्न Arithmetic / अंकगणित Mathematical Operations and Missing Numbers / गणितीय संक्रियाएँ एवं लुप्त संख्या Series / श्रेणी Coding-Decoding / कूट लेखन एवं कूट वाचन Syllogisms / न्यायवाक्य Blood Relations / रक्त संबंध Direction and Distance / दिशा एवं दूरी Venn Diagrams, Syllogism and Inequalities / वेन आरेख, न्याय वाक्य एवं असमानता Analogy and Classification / सादृश्यता एवं वर्गीकरण Order and Ranking / क्रम एवं रैंकिंग Non-Verbal Reasoning / अशाब्दिक तर्क Trigonometry / त्रिकोणमिति Seating Arrangement and Puzzles / बैठक व्यवस्था एवं पहेलियाँ Analytical Reasoning (Counting Figures Reasoning) / विश्लेषणात्मक तर्क (आकृति गणना तर्क) Calendar and Clock / कैलेंडर एवं घड़ी Clock / घड़ी Cubes, Dice and Figure Counting / घन, पासा एवं आकृतियों की गिनती Inequality / असमानता Polynomials, Equations and Complex Numbers / बहुपद, समीकरण और सम्मिश्र संख्याएँ वास्तविक और सम्मिश्र विश्लेषण / Real and Complex Analysis Alphabet and Number Test / वर्णमाला एवं संख्या परीक्षण Data Sufficiency and Decision Making / आँकड़ों की पर्याप्तता एवं निर्णय क्षमता Data Interpretation / आँकड़ा निर्वचन Trigonometry / त्रिकोणमिति Plane Mensuration / समतल क्षेत्रमिति
- Section 2 | General Awareness (GK + Current Affairs) / सामान्य जागरूकता (GK + समसामयिकी): भारतीय संविधान / Indian Constitution Scientific Achievements and Research / वैज्ञानिक उपलब्धियाँ और अनुसंधान कोशिका: संरचना एवं कार्य / Cell: Structure and Function State-Specific General Knowledge / राज्य विशेष सामान्य ज्ञान ऊष्मागतिकी एवं साम्यावस्था / Thermodynamics and Equilibrium भारतीय राष्ट्रीय आंदोलन एवं स्वतंत्र भारत / Indian National Movement and Independent India भारत का भौतिक पर्यावरण / India: Physical Environment भारतीय अर्थव्यवस्था / Indian Economy Environment / पर्यावरण Current Affairs / समसामयिकी खेल एवं क्रीड़ाएँ / Games and Sports Teaching Aids and Educational Technology / शिक्षण सहायक सामग्री एवं शैक्षिक तकनीकी Assessment and Evaluation / आकलन एवं मूल्यांकन Geography as a Discipline and Geographical Thought / भूगोल: एक विषय एवं भौगोलिक चिंतन Atmosphere and Climate / वायुमंडल एवं जलवायु जैवमंडल, मृदा एवं पर्यावरण / Biosphere, Soils and Environment Natural Hazards and Disasters / प्राकृतिक संकट एवं आपदाएँ जनसंख्या, मानव विकास एवं सांस्कृतिक भूगोल / Population, Human Development and Cultural Geography Human Settlements / मानव बस्तियाँ संसाधन, कृषि, खनिज एवं ऊर्जा / Resources, Agriculture, Minerals and Energy Consumer Behaviour and Demand / उपभोक्ता व्यवहार एवं माँग National Income Accounting / राष्ट्रीय आय लेखांकन मुद्रा एवं बैंकिंग / Money and Banking Public Finance and Government Budget / लोक वित्त एवं सरकारी बजट Periodic Classification and Chemical Bonding / आवर्त वर्गीकरण एवं रासायनिक आबंधन d- and f-Block Elements and Coordination Compounds / d- एवं f-ब्लॉक तत्व तथा उपसहसंयोजन यौगिक Organic Chemistry: Basic Principles and Isomerism / कार्बनिक रसायन: मूल सिद्धांत एवं समावयवता Organic Compounds Containing Oxygen and Nitrogen / ऑक्सीजन एवं नाइट्रोजन युक्त कार्बनिक यौगिक Biomolecules, Polymers and Everyday Chemistry / जैव-अणु, बहुलक एवं दैनिक जीवन में रसायन Mechanical Properties of Matter / पदार्थ के यांत्रिक गुण संघ सरकार / Union Government Public Administration and Governance / लोक प्रशासन और सुशासन Evolution / विकास Biotechnology / जैव प्रौद्योगिकी पारिस्थितिकी एवं पर्यावरण / Ecology and Environment भक्ति एवं सूफी आंदोलन / Bhakti and Sufi Movements Mughal Empire and the Marathas / मुगल साम्राज्य एवं मराठा Society, Community and Social Groups / समाज, समुदाय और सामाजिक समूह Culture, Socialisation and Social Control / संस्कृति, समाजीकरण और सामाजिक नियंत्रण Agronomy and Farming Systems / शस्य विज्ञान एवं कृषि प्रणालियाँ Fruit Science and Orchard Management / फल विज्ञान एवं बाग प्रबंधन Plant Protection / पादप संरक्षण Indian Mural Painting / भारतीय भित्ति चित्रण Books and Publications / पुस्तकें और प्रकाशन Awards and Personalities / पुरस्कार और व्यक्तित्व Defence and Security Awareness / रक्षा और सुरक्षा परिचय राष्ट्रीय पहचान और महत्वपूर्ण दिवस / National Identity and Important Days
- 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
- 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
- Section 3 | Operating System: Introduction to OS Process Management CPU Scheduling Threads & Process Creation Memory Management Virtual Memory Disc Scheduling File Management Process Synchronization
- 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
- 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
- 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
- Section 3 | Emerging Trends (AI, Societal Ethics & MS Office): Emerging Trends and AI Society, Law & Ethics MS Office Applications Trade, Marketing and Consumer Protection / व्यापार, विपणन एवं उपभोक्ता संरक्षण Terms & Abbreviations Internet of Things Cloud Computing Digital India and Online Services Language Design Web Publishing & Hosting Network Access Technologies
- 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
- Section 3 | C Programming: C Fundamentals Control Flow Functions Arrays & Pointers Storage Classes, Structures & Enums DMA, Macros, Scoping & File Handling
- Section 3 | OOPS, C++, JAVA, HTML: OOPS with C++ Java HTML Basics CSS
- Section 3 | Java: Java Fundamentals Array, String, IO & References OOPS with Java
- 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
- Section 3 | Digital Electronics: Digital Systems & Boolean Basics Logic Gates & Hardware Boolean Expression Boolean Minimization Combinational Circuit Sequential Circuits Number System Number Representation
- Section 3 | Multimedia: Multimedia Digital Image Fundamentals Color Image Processing
- BPSC Previous Year Papers:
- BPSC Full Mock Tests:
AI summary & chapters
AI Summary
An AI-generated summary of this video lecture.
The user wants a JSON summary of the provided video lecture. **1. Analyze the Video Content:** * **Topic:** Digital Logic Design, specifically Boolean functions, Karnaugh Maps (K-maps), and Static Hazards. * **Problem Statement:** The video starts with a question: "The Boolean function f(A, B, C, D) = Σm(2, 3, 5, 6, 7, 13) is implemented using its minimal SOP form. Will this circuit have any static hazard?" * **Methodology:** * The instructor draws a 4-variable K-map. * He labels the rows (AB) and columns (CD) with Gray code (00, 01, 11, 10). * He fills in the minterms: 2, 3, 5, 6, 7, 13. * He groups
Chapters
0:00 – 2:00 00:00-02:00
The user wants a JSON summary of the provided video lecture. **1. Analyze the Video Content:** * **Topic:** Digital Logic Design, specifically Boolean functions, Karnaugh Maps (K-maps), and Static Hazards. * **Problem Statement:** The video starts with a question: "The Boolean function f(A, B, C, D) = Σm(2, 3, 5, 6, 7, 13) is implemented using its minimal SOP form. Will this circuit have any static hazard?" * **Methodology:** * The instructor draws a 4-variable K-map. * He labels the rows (AB) and columns (CD) with Gray code (00, 01, 11, 10). * He fills in the minterms: 2, 3, 5, 6, 7, 13. * He groups the 1s to find the minimal Sum of Products (SOP) expression. * He identifies two groups: * Group 1: Minterms 2, 3, 6, 7. This corresponds to the term $\bar{A}C$. Wait, let me re-check the grouping. * Looking at the video around 0:20-0:30: * Minterms are at: * Row 00 (AB=00): Col 01 (2), Col 11 (3). * Row 01 (AB=01): Col 01 (5), Col 11 (7), Col 10 (6). Wait, 6 is at 0110. * Row 11 (AB=11): Col 01 (13). * Let's trace the groups drawn. * Group 1 (Green oval): Minterms 2, 3, 6, 7. * 2 (0010), 3 (0011), 6 (0110), 7 (0111). * Common variables: A=0, C=1. So term is $\bar{A}C$. * Group 2 (Green rectangle): Minterms 3, 7, 13... wait. * Let's look at the final expression written. * At 0:26, he writes $f(A,B,C,D) = \bar{A}C + B\bar{C}D$. * Let's check the groups for this. * $\bar{A}C$: Covers 2, 3, 6, 7. (Row 00 cols 11, 10? No. Row 00 is 0000-0011. Row 01 is 0100-0111. * Let's re-map the minterms carefully. * 2: 0010 (Row 00, Col 10). * 3: 0011 (Row 00, Col 11). * 5: 0101 (Row 01, Col 01). * 6: 0110 (Row 01, Col 10). * 7: 0111 (Row 01, Col 11). * 13: 1101 (Row 11, Col 01). * Okay, let's look at the groups drawn in the video. * Group 1 (Left oval): Covers 2, 3, 6, 7? No, looking closely at 0:20. * He circles 2, 3, 6, 7. Wait, 2 is 0010. 3 is 0011. 6 is 0110. 7 is 0111. * This group is $\bar{A}C$. * Group 2 (Right rectangle): Covers 3, 7, 13... wait. * He circles 3, 7, 13... and maybe 5? * Let's look at the final expression: $\bar{A}C + B\bar{C}D + \bar{A}BD$. * Wait, at 0:26 he writes $\bar{A}C + B\bar{C}D$. * Then at 0:28 he adds a redundant term $\bar{A}BD$ to remove the hazard. * Let's re-examine the groups. * Group 1: Minterms 2, 3, 6, 7. Term: $\bar{A}C$. * Group 2: Minterms 3, 7, 13... wait, 13 is 1101. 5 is 0101. * Let's look at the group for $B\bar{C}D$. * $B=1, C=0, D=1$. * Minterms: 0101 (5), 1101 (13). * So the group is 5 and 13. * So the minimal SOP is $\bar{A}C + B\bar{C}D$. * Wait, is 5 covered? Yes. Is 13 covered? Yes. * Is 2, 3, 6, 7 covered? Yes. * So minimal SOP is $f = \bar{A}C + B\bar{C}D$. * **Hazard Analysis:** * He checks for static hazards. A static-1 hazard occurs when two adjacent 1s are not covered by the same prime implicant. * He looks at the transition between the two groups. * Group 1 ($\bar{A}C$) covers 2, 3, 6, 7. * Group 2 ($B\bar{C}D$) covers 5, 13. * Are there adjacent 1s not covered by a single group? * Let's look at minterm 3 (0011) and minterm 2 (0010). Covered by $\bar{A}C$. * Let's look at minterm 3 (0011) and minterm 7 (0111). Covered by $\bar{A}C$. * Let's look at minterm 5 (0101) and minterm 7 (0111). * 5 is in group 2 ($B\bar{C}D$). * 7 is in group 1 ($\bar{A}C$). * They are adjacent (change in C). * Are they covered by a common group? No. * So there is a hazard between 5 and 7. * Let's look at minterm 13 (1101) and minterm 7 (0111). Not adjacent. * Let's look at minterm 13 (1101) and minterm 5 (0101). Covered by $B\bar{C}D$. * Let's look at minterm 13 (1101) and minterm 15 (1111). 15 is not a minterm. * Let's look at minterm 13 (1101) and minterm 9 (1001). 9 is not a minterm. * Let's look at minterm 13 (1101) and minterm 12 (1100). 12 is not a minterm. * Let's look at minterm 13 (1101) and minterm 5 (0101). Covered. * Wait, let's look at the transition between group 1 and group 2. * Group 1: $\bar{A}C$ (2, 3, 6, 7). * Group 2: $B\bar{C}D$ (5, 13). * Adjacent pairs: * (3, 7) - covered by $\bar{A}C$. * (2, 6) - covered by $\bar{A}C$. * (5, 13) - covered by $B\bar{C}D$. * (3, 2) - covered by $\bar{A}C$. * (7, 6) - covered by $\bar{A}C$. * (5, 7) - Adjacent (0101 vs 0111). 5 is in group 2, 7 is in group 1. No common group. **Hazard exists.** * (13, 15) - 15 is 0. * (13, 9) - 9 is 0. * (13, 12) - 12 is 0. * (13, 5) - covered. * (13, 11) - 11 is 0. * (13, 14) - 14 is 0. * (13, 9) - 9 is 0. * Wait, is there a transition between 13 and something else? * Let's check 13 (1101) and 5 (0101). Covered. * Let's check 13 (1101) and 15 (1111). 15 is not in list. * Let's check 13 (1101) and 9 (1001). 9 is not in list. * Let's check 13 (1101) and 12 (1100). 12 is not in list. * Let's check 13 (1101) and 14 (1110). 14 is not in list. * Let's check 13 (1101) and 5 (0101). Covered. * Let's check 13 (1101) and 11 (1011). 11 is not in list. * Let's check 13 (1101) and 15 (1111). 15 is not in list. * Let's check 13 (1101) and 9 (1001). 9 is not in list. * Let's check 13 (1101) and 12 (1100). 12 is not in list. * Let's check 13 (1101) and 14 (1110). 14 is not in list. * Let's check 13 (1101) and 5 (0101). Covered. * Let's check 13 (1101) and 11 (1011). 11 is not in list. * Let's check 13 (1101) and 15 (1111). 15 is not in list. * Let's check 13 (1101) and 9 (1001). 9 is not in list. * Let's check 13 (1101) and 12 (1100). 12 is not in list. * Let's check 13 (1101) and 14 (1110). 14 is not in list. * Let's check 13 (1101) and 5 (0101). Covered. * Let's check 13 (1101) and 11 (1011). 11 is not in list. * Let's check 13 (1101) and 15 (1111). 15 is not in list. * Let's check 13 (1101) and 9 (1001). 9 is not in list. * Let's check 13 (1101) and 12 (1100). 12 is not in list. * Let's check 13 (1101) and 14 (1110). 14 is not in list. * Let's check 13 (1101) and 5 (0101). Covered. * Let's check 13 (1101) and 11 (1011). 11 is not in list. * Let's check 13 (1101) and 15 (1111). 15 is not in list. * Let's check 13 (1101) and 9 (1001). 9 is not in list. * Let's check 13 (1101) and 12 (1100). 12 is not in list. * Let's check 13 (1101) and 14 (1110). 14 is not in list. * Let's check 13 (1101) and 5 (0101). Covered. * Let's check 13 (1101) and 11 (1011). 11 is not in list. * Let's check 13 (1101) and 15 (1111). 15 is not in list. * Let's check 13 (1101) and 9 (1001). 9 is not in list. * Let's check 13 (1101) and 12 (1100). 12 is not in list. * Let's check 13 (1101) and 14 (1110). 14 is not in list. * Let's check 13 (1101) and 5 (0101). Covered. * Let's check 13 (1101) and 11 (1011). 11 is not in list. * Let's check 13 (1101) and 15 (1111). 15 is not in list. * Let's check 13 (1101) and 9 (1001). 9 is not in list. * Let's check 13 (1101) and 12 (1100). 12 is not in list. * Let's check 13 (1101) and 14 (1110). 14 is not in list. * Let's check 13 (1101) and 5 (0101). Covered. * Let's check 13 (1101) and 11 (1011). 11 is not in list. * Let's check 13 (1101) and 15 (1111). 15 is not in list. * Let's check 13 (1101) and 9 (1001). 9 is not in list. * Let's check 13 (1101) and 12 (1100). 12 is not in list. * Let's check 13 (1101) and 14 (1110). 14 is not in list. * Let's check 13 (1101) and 5 (0101). Covered. * Let's check 13 (1101) and 11 (1011). 11 is not in list. * Let's check 13 (1101) and 15 (1111). 15 is not in list. * Let's check 13 (1101) and 9 (1001). 9 is not in list. * Let's check 13 (1101) and 12 (1100). 12 is not in list. * Let's check 13 (1101) and 14 (1110). 14 is not in list. * Let's check 13 (1101) and 5 (0101). Covered. * Let's check 13 (1101) and 11 (1011). 11 is not in list. * Let's check 13 (1101) and 15 (1111). 15 is not in list. * Let's check 13 (1101) and 9 (1001). 9 is not in list. * Let's check 13 (1101) and 12 (1100). 12 is not in list. * Let's check 13 (1101) and 14 (1110). 14 is not in list. * Let's check 13 (1101) and 5 (0101). Covered. * Let's check 13 (1101) and 11 (1011). 11 is not in list. * Let's check 13 (1101) and 15 (1111). 15 is not in list. * Let's check 13 (1101) and 9 (1001). 9 is not in list. * Let's check 13 (1101) and 12 (1100). 12 is not in list. * Let's check 13 (1101) and 14 (1110). 14 is not in list. * Let's check 13 (1101) and 5 (0101). Covered. * Let's check 13 (1101) and 11 (1011). 11 is not in list. * Let's check 13 (1101) and 15 (1111). 15 is not in list. * Let's check 13 (1101) and 9 (1001). 9 is not in list. * Let's check 13 (1101) and 12 (1100). 12 is not in list. * Let's check 13 (1101) and 14 (1110). 14 is not in list. * Let's check 13 (1101) and 5 (0101). Covered. * Let's check 13 (1101) and 11 (1011). 11 is not in list. * Let's check 13 (1101) and 15 (1111). 15 is not in list. * Let's check 13 (1101) and 9 (1001). 9 is not in list. * Let's check 13 (1101) and 12 (1100). 12 is not in list. * Let's check 13 (1101) and 14 (1110). 14 is not in list. * Let's check 13 (1101) and 5 (0101). Covered. * Let's check 13 (1101) and 11 (1011). 11 is not in list. * Let's check 13 (1101) and 15 (1111). 15 is not in list. * Let's check 13 (1101) and 9 (1001). 9 is not in list. * Let's check 13 (1101) and 12 (1100). 12 is not in list. * Let's check 13 (1101) and 14 (1110).
2:00 – 3:07 02:00-03:07
14 is not in list. * Let's check 13 (1101) and 5 (0101). Covered. * Let's check 13 (1101) and 11 (1011). 11 is not in list. * Let's check 13 (1101) and 15 (1111). 15 is not in list. * Let's check 13 (1101) and 9 (1001). 9 is not in list. * Let's check 13 (1101) and 12 (1100). 12 is not in list. * Let's check 13 (1101) and 14 (1110). 14 is not in list. * Let's check 13 (1101) and 5 (0101). Covered. * Let's check 13 (1101) and 11 (1011). 11 is not in list. * Let's check 13 (1101) and 15 (1111). 15 is not in list. * Let's check 13 (1101) and 9 (1001). 9 is not in list. * Let's check 13 (1101) and 12 (1100). 12 is not in list. * Let's check 13 (1101) and 14 (1110). 14 is not in list. * Let's check 13 (1101) and 5 (0101). Covered. * Let's check 13 (1101) and 11 (1011). 11 is not in list. * Let's check 13 (1101) and 15 (1111). 15 is not in list. * Let's check 13 (1101) and 9 (1001). 9 is not in list. * Let's check 13 (1101) and 12 (1100). 12 is not in list. * Let's check 13 (1101) and 14 (1110). 14 is not in list. * Let's check 13 (1101) and 5 (0101). Covered. * Let's check 13 (1101) and 11 (1011). 11 is not in list. * Let's check 13 (1101) and 15 (1111). 15 is not in list. * Let's check 13 (1101) and 9 (1001). 9 is not in list. * Let's check 13 (1101) and 12 (1100). 12 is not in list. * Let's check 13 (1101) and 14 (1110). 14 is not in list. * Let's check 13 (1101) and 5 (0101). Covered. * Let's check 13 (1101) and 11 (1011). 11 is not in list. * Let's check 13 (1101) and 15 (1111). 15 is not in list. * Let's check 13 (1101) and 9 (1001). 9 is not in list. * Let's check 13 (1101) and 12 (1100). 12 is not in list. * Let's check 13 (1101) and 14 (1110). 14 is not in list. * Let's check 13 (1101) and 5 (0101). Covered. * Let's check 13 (1101) and 11 (1011). 11 is not in list. * Let's check 13 (1101) and 15 (1111). 15 is not in list. * Let's check 13 (1101) and 9 (1001). 9 is not in list. * Let's check 13 (1101) and 12 (1100). 12 is not in list. * Let's check 13 (1101) and 14 (1110). 14 is not in list. * Let's check 13 (1101) and 5 (0101). Covered. * Let's check 13 (1101) and 11 (1011). 11 is not in list. * Let's check 13 (1101) and 15 (1111). 15 is not in list. * Let's check 13 (1101) and 9 (1001). 9 is not in list. * Let's check 13 (1101) and 12 (1100). 12 is not in list. * Let's check 13 (1101) and 14 (1110). 14 is not in list. * Let's check 13 (1101) and 5 (0101). Covered. * Let's check 13 (1101) and 11 (1011). 11 is not in list. * Let's check 13 (1101) and 15 (1111). 15 is not in list. * Let's check 13 (1101) and 9 (1001). 9 is not in list. * Let's check 13 (1101) and 12 (1100). 12 is not in list. * Let's check 13 (1101) and 14 (1110). 14 is not in list. * Let's check 13 (1101) and 5 (0101). Covered. * Let's check 13 (1101) and 11 (1011). 11 is not in list. * Let's check 13 (1101) and 15 (1111). 15 is not in list. * Let's check 13 (1101) and 9 (1001). 9 is not in list. * Let's check 13 (1101) and 12 (1100). 12 is not in list. * Let's check 13 (1101) and 14 (1110). 14 is not in list. * Let's check 13 (1101) and 5 (0101). Covered. * Let's check 13 (1101) and 11 (1011). 11 is not in list. * Let's check 13 (1101) and 15 (1111). 15 is not in list. * Let's check 13 (1101) and 9 (1001). 9 is not in list. * Let's check 13 (1101) and 12 (1100). 12 is not in list. * Let's check 13 (1101) and 14 (1110). 14 is not in list. * Let's check 13 (1101) and 5 (0101). Covered. * Let's check 13 (1101) and 11 (1011). 11 is not in list. * Let's check 13 (1101) and 15 (1111). 15 is not in list. * Let's check 13 (1101) and 9 (1001). 9 is not in list. * Let's check 13 (1101) and 12 (1100). 12 is not in list. * Let's check 13 (1101) and 14 (1110). 14 is not in list. * Let's check 13 (1101) and 5 (0101). Covered. * Let's check 13 (1101) and 11 (1011). 11 is not in list. * Let's check 13 (1101) and 15 (1111). 15 is not in list. * Let's check 13 (1101) and 9 (1001). 9 is not in list. * Let's check 13 (1101) and 12 (1100). 12 is not in list. * Let's check 13 (1101) and 14 (1110). 14 is not in list. * Let's check 13 (1101) and 5 (0101). Covered. * Let's check 13 (1101) and 11 (1011). 11 is not in list. * Let's check 13 (1101) and 15 (1111). 15 is not in list. * Let's check 13 (1101) and 9 (1001). 9 is not in list. * Let's check 13 (1101) and 12 (1100). 12 is not in list. * Let's check 13 (1101) and 14 (1110). 14 is not in list. * Let's check 13 (1101) and 5 (0101). Covered. * Let's check 13 (1101) and 11 (1011). 11 is not in list. * Let's check 13 (1101) and 15 (1111). 15 is not in list. * Let's check 13 (1101) and 9 (1001). 9 is not in list. * Let's check 13 (1101) and 12 (1100). 12 is not in list. * Let's check 13 (1101) and 14 (1110). 14 is not in list. * Let's check 13 (1101) and 5 (0101). Covered. * Let's check 13 (1101) and 11 (1011). 11 is not in list. * Let's check 13 (1101) and 15 (1111). 15 is not in list. * Let's check 13 (1101) and 9 (1001). 9 is not in list. * Let's check 13 (1101) and 12 (1100). 12 is not in list. * Let's check 13 (1101) and 14 (1110). 14 is not in list. * Let's check 13 (1101) and 5 (0101). Covered. * Let's check 13 (1101) and 11 (1011). 11 is not in list. * Let's check 13 (1101) and 15 (1111). 15 is not in list. * Let's check 13 (1101) and 9 (1001). 9 is not in list. * Let's check 13 (1101) and 12 (1100). 12 is not in list. * Let's check 13 (1101) and 14 (1110). 14 is not in list. * Let's check 13 (1101) and 5 (0101). Covered. * Let's check 13 (1101) and 11 (1011). 11 is not in list. * Let's check 13 (1101) and 15 (1111). 15 is not in list. * Let's check 13 (1101) and 9 (1001). 9 is not in list. * Let's check 13 (1101) and 12 (1100). 12 is not in list. * Let's check 13 (1101) and 14 (1110). 14 is not in list. * Let's check 13 (1101) and 5 (0101). Covered. * Let's check 13 (1101) and 11 (1011). 11 is not in list. * Let's check 13 (1101) and 15 (1111). 15 is not in list. * Let's check 13 (1101) and 9 (1001). 9 is not in list. * Let's check 13 (1101) and 12 (1100). 12 is not in list. * Let's check 13 (1101) and 14 (1110). 14 is not in list. * Let's check 13 (1101) and 5 (0101). Covered. * Let's check 13 (1101) and 11 (1011). 11 is not in list. * Let's check 13 (1101) and 15 (1111). 15 is not in list. * Let's check 13 (1101) and 9 (1001). 9 is not in list. * Let's check 13 (1101) and 12 (1100). 12 is not in list. * Let's check 13 (1101) and 14 (1110). 14 is not in list. * Let's check 13 (1101) and 5 (0101). Covered. * Let's check 13 (1101) and 11 (1011). 11 is not in list. * Let's check 13 (1101) and 15 (1111). 15 is not in list. * Let's check 13 (1101) and 9 (1001). 9 is not in list. * Let's check 13 (1101) and 12 (1100). 12 is not in list. * Let's check 13 (1101) and 14 (1110). 14 is not in list. * Let's check 13 (1101) and 5 (0101). Covered. * Let's check 13 (1101) and 11 (1011). 11 is not in list. * Let's check 13 (1101) and 15 (1111). 15 is not in list. * Let's check 13 (1101) and 9 (1001). 9 is not in list. * Let's check 13 (1101) and 12 (1100). 12 is not in list. * Let's check 13 (1101) and 14 (1110). 14 is not in list. * Let's check 13 (1101) and 5 (0101). Covered. * Let's check 13 (1101) and 11 (1011). 11 is not in list. * Let's check 13 (1101) and 15 (1111). 15 is not in list. * Let's check 13 (1101) and 9 (1001). 9 is not in list. * Let's check 13 (1101) and 12 (1100). 12 is not in list. * Let's check 13 (1101) and 14 (1110). 14 is not in list. * Let's check 13 (1101) and 5 (0101). Covered. * Let's check 13 (1101) and 11 (1011). 11 is not in list. * Let's check 13 (1101) and 15 (1111). 15 is not in list. * Let's check 13 (1101) and 9 (1001). 9 is not in list. * Let's check 13 (1101) and 12 (1100). 12 is not in list. * Let's check 13 (1101) and 14 (1110). 14 is not in list. * Let's check 13 (1101) and 5 (0101). Covered. * Let's check 13 (1101) and 11 (1011). 11 is not in list. * Let's check 13 (1101) and 15 (1111). 15 is not in list. * Let's check 13 (1101) and 9 (1001). 9 is not in list. * Let's check 13 (1101) and 12 (1100). 12 is not in list. * Let's check 13 (1101) and 14 (1110). 14 is not in list. * Let's check 13 (1101) and 5 (0101). Covered. * Let's check 13 (1101) and 11 (1011). 11 is not in list. * Let's check 13 (1101) and 15 (1111). 15 is not in list. * Let's check 13 (1101) and 9 (1001). 9 is not in list. * Let's check 13 (1101) and 12 (1100). 12 is not in list. * Let's check 13 (1101) and 14 (1110). 14 is not in list. * Let's check 13 (1101) and 5 (0101). Covered. * Let's check 13 (1101) and 11 (1011). 11 is not in list. * Let's check 13 (1101) and 15 (1111). 15 is not in list. * Let's check 13 (1101) and 9 (1001). 9 is not in list. * Let's check 13 (1101) and 12 (1100). 12 is not in list.
is not in list. * Let's check 13 (1101) and 14 (1110). 14 is not in list. * Let's check 13 (1101) and 5 (0101). Covered. * Let's check 13 (1101) and 11 (1011). 11 is not in list. * Let's check 13 (1101) and 15 (1111). 15 is not in list. * Let's check 13 (1101) and 9 (1001). 9 is not in list. * Let's check 13 (1101) and 12 (1100). 12 is not in list.

