Practice Question

Duration: 4 min

This video lesson is available to enrolled students.

Return to /learn/ISRO/digital-electronics/boolean-expression/functional-completeness/asset-practice-question-2541 after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. General Aptitude & Reasoning: Number System, Percentage, Ratio and Proportion (Ratios), Average, Profit and Loss, Simple Interest and Compound Interest, Time and Work, Speed Time and Distance, Mixture and Alligation, Data Interpretation, Algebra, Probability, Permutation and Combination, Venn Diagram, HCF LCM, Divisibility Rules, Age Problems, Pipe and Cistern, Partnership, Linear Algebra, Sequence and Series (Series), Statistics, Powers and Exponents (Surds and Indices), Arithmetic, Mensuration and Geometry, Calculus, Trigonometry, Vectors, Speed Mathematics and Basic Mathematics, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Analogy, Series (Number and Letter Series) (Numerical Relations and Reasoning), Puzzle Solving (Puzzles), Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Calendar, Seating Arrangements, Coding Decoding, Blood Relations, Directions (Direction Test), Clock, Analytical Reasoning (Counting Figures Reasoning), Ranking, Order and Sequence, Logical Sequence Of Words, Inequality, Data Sufficiency, Cubes & Dices
  3. Computer Networks & Cybersecurity: 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, Hardware Basics, Network Security
  4. Programming, Data Structures & Algorithms: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling, OOPS with C++, Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Advanced Algorithms
  5. AI, Machine Learning, Big Data & Cloud: Emerging Tech Trends, Artificial Intelligence, Big Data Systems, Approaches to AI, Search Algorithms, Knowledge Representation, Cloud Computing
  6. Digital Logic & Computer Organization: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Register Transfer and Microoperations, Control Unit Design, Programming the Basic Computer
  7. TOC & Compiler: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Grammar, Regular Language Properties, Moore & Mealy Machines, Pushdown Automata & CFG, Turing Machines, Complexity Theory, Intro to Compilers, Lexical Analysis, Grammar & CFG, Syntax Analysis: Top-Down, Syntax Analysis: Bottom-Up, Semantic Analysis & SDT, Intermediate Code Gen, Code Optimization, Run Time Environment
  8. Discrete Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic
  9. Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management, Unix OS, Linux OS, Distributed Systems
  10. Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management, Object Oriented Technology, HTML Basics, JavaScript-Basics, Java, XML
  11. 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, Relational Calculus, Transaction Management, Concurrency Control, Database Recovery, Data Warehousing & Mining, Enhanced Data Models, NoSQL
  12. Other Recurring CS Topics: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing, Multimedia
  13. Live Classes: ISRO Live classes
  14. Full Mock Test:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

The video lecture focuses on determining functional completeness in digital logic circuits, a critical concept for exams like GATE. The session begins with a problem from GATE 2015 involving two functions, f(X, Y, Z) and g(X, Y, Z), asking which set is functionally complete. The instructor then transitions to a multiple-choice question asking to identify the functionally complete set among four options involving XOR, NOT, constants, and OR. He analyzes the properties of these sets, specifically looking at linearity and preservation. He writes symbols like '~ +' and '~ .' on the whiteboard to check if the sets can generate universal gates. He selects option (b) {XOR, 1, +} as the answer. In the second half, he applies these concepts to specific functions f(a, b) = a' + b and f(a, b, c) = a' + bc'. He demonstrates how to test for preservation properties and gate generation to determine if a function is functionally complete.

Chapters

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

    The video starts with a GATE 2015 question about functions f and g. The instructor then moves to a multiple-choice question: 'Which of the following is functionally complete?' with options (a) XOR, not; (b) XOR, 1, +; (c) XOR, 1, not; (d) XNOR, 1, not. He analyzes the options, writing '~ +' and '~ .' on the board to represent NOT-OR and NOT-AND. He circles option (b) and marks it, explaining that {XOR, 1, +} is functionally complete because XOR with 1 generates NOT, and {NOT, OR} is a complete set. He notes that the other options are linear or affine sets, which are not complete.

  2. 2:00 – 4:00 02:00-04:00

    The instructor analyzes f(a, b) = a' + b. He writes f(a, a) = a' + a = 1 and f(b, b) = b' + b = 1 on the board. He explains that since the function preserves 1 (outputs 1 when inputs are 1), it cannot generate the constant 0, so it is not functionally complete. Next, he analyzes f(a, b, c) = a' + bc'. He shows f(a, a, a) = a' + aa' = a', generating NOT. Then he substitutes a', b, b' to get f(a', b, b') = a'' + bb' = a + b, generating OR. Since {NOT, OR} is complete, he concludes f(a, b, c) is functionally complete. He emphasizes checking preservation of 0 and 1, monotonicity, linearity, and self-duality.

The lecture provides a comprehensive guide to testing functional completeness. It starts with a GATE problem and a multiple-choice question to introduce the concept. The instructor explains that a set is functionally complete if it can generate all Boolean functions, typically by generating NAND or NOR, or by generating a known complete set like {NOT, OR}. He demonstrates this by analyzing operator sets like {XOR, 1, +} and specific functions like f(a, b) = a' + b. Key techniques include checking for preservation of 0 and 1, linearity, and monotonicity. If a set preserves 0 or 1, it cannot be complete. If it is linear, it cannot be complete. The instructor uses board work to show substitution steps, proving that f(a, b, c) can generate NOT and OR, thus confirming its completeness.

Loading lesson…