Practice Question

Duration: 4 min

This video lesson is available to enrolled students.

Return to /learn/MPPSC-ASSISTANT-PROFESSOR-COMPUTER-SCIENCE-PAPER-2/unit-i-discrete-mathematical-structure/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. Paper 1 | General Studies: State Wise GK
  3. Paper 1 | Information and Communication Technology: Role of Internet and Web Services, Security in Mobile and Wireless Computing
  4. Paper 1 | Current Affairs: GK- Current Affairs
  5. Paper 2 | Discrete Mathematical Structure: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic, Probability
  6. Paper 2 | Digital Computer Organization And Architecture: Number System, Number Representation, Sequential Circuits, Combinational Circuit, 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. Paper 2 | C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  8. Paper 2 | Programming Languages & Object-Oriented Programming Concepts: Java, OOPS with C++, Java Fundamentals, Array, String, IO & References
  9. Paper 2 | Python: Introduction to Python, Tokens, Variables, Data Types, I/O, Operators & Expressions, Control Flow & Looping, Collections & Strings, Functions & Modules, File Handling & Data Analysis
  10. Paper 2 | Data Structure And Algorithms: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Minimum Spanning Trees, Advanced Algorithms
  11. Paper 2 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Unix OS
  12. Paper 2 | 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
  13. Paper 2 | 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
  14. Paper 2 | Database Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, Relational Algebra, SQL, Transaction Management, Concurrency Control, Database Recovery, Database Security & Authorization, Enhanced Data Models
  15. Paper 2 | Computer Network And Information Security: Introduction to CN, Data Communication, Application Layer, Hardware basics, Cyber Threats and Malware Attacks, Network Security, 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
  16. Paper 2 | Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  17. Paper 2 | Current Trends & Technologies: Emerging Tech Trends, Approaches to AI, Search Algorithms, Game Playing, Knowledge Representation, Planning, Multi Agent Systems, Fuzzy Sets, Natural Language Processing, Artificial Neural Networks, Genetic Algorithms, Artificial Intelligence, Data Warehousing & Mining, Electronic Data Interchange and E-Commerce, Terms & Abbreviations
  18. Paper 2 | Full Length Mock Tests:
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…