Functionally Complete Function

Duration: 7 min

This video lesson is available to enrolled students.

Return to /learn/SSC-JE-IMD-SCIENTIFIC-ASSISTANT-COMPUTER-SCIENCE/part-d-cs-it/boolean-expression/functional-completeness/asset-functionally-complete-function after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. General Intelligence & Reasoning: Analogy, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Blood Relations, Directions (Direction Test), Ranking, Order and Sequence, Logical Sequence Of Words, Syllogisms, Venn Diagram, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Selection Decision Table (Decision Making), Data Sufficiency, Puzzle Solving (Puzzles), Data Arrangement, Cubes & Dices, Calendar, Clock, Arithmetic, Number System, HCF LCM, Verbal Analogy (Word Based Analogy), Visual Recognition and Figure Completion, Paper Folding and Cutting, Transformation of Shapes, Clocks and Calendars, Direction Sense, Cubes and Dice, Patterns in Two-Dimensional Figures, Seating Arrangements, Analogy and Classification, Logical Deduction and Induction, Alphabet and Word Tests, Mathematical Operations, Series Completion, Simplification and Approximation, Coding and Decoding, Numerical Reasoning, Assembling and Grouping of Shapes, Three-Dimensional Patterns and Visualization, Vocabulary, Number System, Averages, Mixtures and Alligation, Simple and Compound Interest, Percentages, Algebra, Speed, Time and Distance, Seating and Arrangement Puzzles, Traverse Surveying, Order, Ranking and Sequence, Constraint Puzzles, Syllogisms and Venn Diagrams, Reading Comprehension, Critical Reasoning, Permutations and Combinations, Narrative Sequencing, Project Monitoring, Resources and Safety, Profit, Loss and Discount, Ratio and Proportion, Time and Work, Mensuration, Data Interpretation, Powers, Surds and Logarithms, Sequences and Series, Articles and Determiners, Sentence Completion, Data Sufficiency, Blood Relations, Simple Interest and Compound Interest, Mixture and Alligation, Sequence and Series (Series), Speed Time and Distance, Algebra, Profit and Loss, Powers and Exponents (Surds and Indices), Permutation and Combination
  2. General Awareness: Physics, Chemistry, Biology, History, Geography, Polity, Indian Economy, Environment, Static General Knowledge, GK- Current Affairs, Artificial Intelligence, MS Office Applications, Terms & Abbreviations, Keyboard Shortcuts, Evolution of Indian Banking (Banking & Financial Awareness), Emerging Tech Trends
  3. Engineering Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic, Linear Algebra, Calculus, Probability, Statistics, Signal Space and Optimum Detection, Probability, Statistics
  4. Digital Logic: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Floating Point Rep, Number Systems and Codes, Registers and Counters, Boolean Algebra and Logic Gates, Microprocessors and Microcontrollers, Logic Families and CMOS Logic, Microprocessors, Logic Gates and Boolean Algebra, Minimization of Boolean Functions, Timing, Hazards and Testing, Logic Families, Combinational Logic Design, Arithmetic Circuits, Waveform Generators and Timer Circuits, Semiconductor Memories and Programmable Logic Devices, Combinational Logic Circuits, Latches and Flip-Flops, Finite State Machines, Sequential Circuits and State Machines, Minimization of Boolean Functions, Arithmetic Circuits, Latches and Flip-Flops, Number Systems and Codes, Registers and Counters
  5. Computer Organisation & Architecture: Basics of COA, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Programming the Basic Computer, Register Transfer and Microoperations, Semiconductor Memories and Programmable Logic, Processor Organization and Instructions, Memory Hierarchy and Input/Output, Registers and Counters
  6. Programming & Data Structures: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling, Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, HTML Basics, OOPS with C++, Java, Object Oriented Technology
  7. Databases: 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, Database Security & Authorization
  8. Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
  9. 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, Complexity Theory
  10. Compiler Design: 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
  11. Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management, Security, Windows OS, Distributed Systems, Unix OS, Linux OS
  12. Computer Networks: Introduction to CN, 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, Data Communication, Website, Browser & Services, Web Design & Development, Network Security, Cyber Threats and Malware Attacks, Cyber Safety and Security
  13. Full Length Mock Tests:
  14. Sectional Tests:
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…