No of Function possible

Duration: 8 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/boolean-function-counts/asset-no-of-function-possible 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.

This educational video lecture explains the mathematical derivation for determining the total number of possible Boolean functions given 'n' Boolean variables. The instructor begins by presenting the problem on a slide, stating that with n binary variables, there are $2^n$ possible input combinations. Since a Boolean function can only output two values (0 or 1), the total number of distinct functions is calculated as $2^{(2^n)}$. The lecturer then generalizes this concept using the notation $x^{(y^z)}$, where x represents the nature of the function, y represents the nature of the variable, and z represents the number of variables. He transitions to a whiteboard to illustrate this with a concrete example using two variables, 'a' and 'b', demonstrating how the 4 input combinations lead to 16 possible functions.

Chapters

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

    The video opens with a slide titled 'No of functions possible'. The instructor poses the question: 'With n-Boolean variables how many different Boolean functions are possible?'. He reads the solution provided on the screen, explaining that n binary variables generate $2^n$ combinations. He notes that a Boolean function has only 2 possible values (0 or 1). Consequently, the total number of different functions possible is $2^{(2^n)}$. He introduces a generalized formula $x^{(y^z)}$ to represent this, defining x as the nature of the function, y as the nature of the variable, and z as the number of variables.

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

    The instructor moves to a whiteboard to visualize the concept. He writes two variables, 'a' and 'b', and lists their 4 possible binary combinations: 00, 01, 10, and 11. He draws two ovals labeled 'A' and 'B' to represent the input and output sets. Inside 'A', he writes 'a', 'b', and '2' to indicate 2 variables. Inside 'B', he writes '1' and '2' to indicate 2 possible output values. He explains that for each of the 4 rows in the truth table, the output can be either 0 or 1. He begins drawing a truth table with columns labeled $f_1, f_2, f_3, f_4$ to show different function mappings, eventually concluding that there are 16 possible functions ($2^4$) for 2 variables.

  3. 5:00 – 8:02 05:00-08:02

    The instructor reinforces the generalization on the whiteboard. He writes 'nature of function -> 2' and 'nature of variable -> 2'. He writes the formula $2^{(2^n)}$ clearly. He explains the components: x (nature of function) is 2, y (nature of variable) is 2, and z (number of variables) is n. He writes examples like $2^{(2^3)}$ to show how the formula applies to 3 variables, solidifying the derivation of the total number of Boolean functions. He emphasizes that the base is the number of output values and the exponent is the number of input combinations.

The lecture provides a clear, step-by-step derivation of the formula for the number of Boolean functions. It starts with the fundamental property of binary variables ($2^n$ combinations) and combines it with the binary nature of the output (2 values) to arrive at the final formula $2^{(2^n)}$. The instructor effectively uses both slide text and whiteboard diagrams to bridge the gap between abstract formulas and concrete examples, specifically demonstrating the 16 functions possible with 2 variables before generalizing to 'n' variables using the notation $x^{(y^z)}$.

Loading lesson…