Functionally Complete Function

Duration: 7 min

This video lesson is available to enrolled students.

Return to /learn/ISRO/digital-electronics/boolean-expression/functional-completeness/asset-functionally-complete-function 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 provides a comprehensive overview of functionally complete functions within the domain of Boolean algebra and digital logic design. It begins by establishing the foundation that all Boolean operators are derived from three fundamental ones: NOT, AND, and OR. The instructor then introduces the concept of "universal gates," specifically highlighting NAND and NOR, stating that any Boolean operation can be implemented using only these gates. The lecture transitions into the specific criteria required for a function to be considered functionally complete. The instructor emphasizes that a function must be able to implement the NOT operation along with either the AND or OR operation. Crucially, he notes a constraint that the function cannot rely on external support of constants (0 or 1) or pre-complemented variables to achieve this. The session concludes with a detailed walkthrough of a GATE 2015 exam problem, where the instructor analyzes two specific three-variable Boolean functions, f and g, to determine their functional completeness through variable substitution.

Chapters

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

    The video opens with a slide titled "Functionally Complete Function" presented by Sanchit Jain Sir. The instructor explains that there are only three fundamental Boolean operators: NOT, AND, and OR, with all others derived from them. He points out that NOT along with OR (forming NOR) and NOT along with AND (forming NAND) are used as universal gates. The slide text explicitly states, "Any Boolean operation or function can be implemented with NAND or NOR operation." The instructor gestures towards the text, emphasizing that these two gates are sufficient to build any digital circuit.

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

    The instructor moves to the whiteboard to define the conditions for functional completeness. He writes, "If any function can implement NOT along with it either AND or OR then, we indirectly prove that the function can also implement any other function, so function can said to be functionally complete." He adds a critical constraint: "Support of 0, 1 or complemented form of variables are not allowed." To illustrate, he writes a function f(a, b) = a' + b and evaluates it under different inputs, such as f(a, a) = 1 and f(a, 0) = a', demonstrating how to test for basic operations. He draws arrows connecting the function to NAND and NOR concepts.

  3. 5:00 – 7:17 05:00-07:17

    The final segment focuses on a specific problem from GATE 2015. The slide displays two functions: f(X, Y, Z) = X'YZ + XY' + Y'Z' and g(X, Y, Z) = X'YZ + X'YZ' + XY. The instructor analyzes f by substituting x, x, x into the equation, deriving f(x, x, x) = x', which proves it can implement NOT. He then analyzes g by substituting x, x, y, deriving g(x, x, y) = x + y, proving it can implement OR. The slide lists multiple-choice options (A, B, C, D) regarding the functional completeness of these functions. This practical application solidifies the theoretical concepts discussed earlier.

The lecture effectively bridges theory and practice. It starts by defining the building blocks of digital logic (NOT, AND, OR) and identifying NAND and NOR as the universal set. It then rigorously defines functional completeness, stressing the independence from external constants. Finally, it applies these rules to a complex exam problem, showing students exactly how to test a function's completeness by substituting variables to isolate fundamental operations like NOT and OR. This progression ensures students understand not just the definition, but the method of verification required for competitive exams like GATE.

Loading lesson…