No of Function possible
Duration: 8 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- About Course: About the Course
- Paper 1 | Quantitative Aptitude: Percentage Ratio and Proportion (Ratios) Powers and Exponents (Surds and Indices) Logarithm Sequence and Series (Series) Mensuration and Geometry Data Interpretation Average Arithmetic Simplification and Approximation Algebra Sequences and Series Profit, Loss and Discount Percentages Number System Ratio and Proportion Averages, Mixtures and Alligation Permutations and Combinations Time and Work Vocabulary Subject-Verb Agreement Sentence Completion Geometry Reading Comprehension Powers, Surds and Logarithms Trigonometry Mensuration Speed, Time and Distance Patterns in Two-Dimensional Figures Probability Measurement and Quantity Take-Off Transformation of Shapes Three-Dimensional Patterns and Visualization Statistics Mathematical Operations Data Sufficiency Constraint Puzzles Data Interpretation Mixture and Alligation Speed Time and Distance HCF LCM Algebra Profit and Loss Venn Diagram
- Paper 1 | Logical Reasoning: Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning) Series (Number and Letter Series) (Numerical Relations and Reasoning) Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning) Analogy Cubes & Dices Syllogisms Numerical Reasoning Assembling and Grouping of Shapes Coding and Decoding Cubes and Dice Series Completion Alphabet and Word Tests Analogy and Classification Direction Sense Logical Deduction and Induction Order, Ranking and Sequence Critical Reasoning Syllogisms and Venn Diagrams Narrative Sequencing Project Monitoring, Resources and Safety Simple Interest and Compound Interest Coding Decoding Seating Arrangements
- Paper 1 | English Language: Vocabulary Noun Pronoun Verb Adjectives Adverb Preposition Conjunction Articles Tenses Subject Verb Agreement (Verb Noun Agreement) Modals Sentence Correction (Error Correction) Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions) Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing) Prepositions and Conjunctions Idioms and Phrases Verb Forms and Verb Patterns Sentence Basics, Nouns and Pronouns Adjectives and Adverbs Articles and Determiners Modals, Conditionals and Subjunctive Sentence Structure and Correction Voice and Reported Speech Tenses Vocabulary
- Paper 1 | Unit Tests:
- Paper 1 | Full-Length Mock Tests:
- Paper 2 | Engineering Mathematics: Set Theory Relations Functions Graph Theory Group Theory Propositional and Predicate Logic Linear Algebra Calculus Permutation and Combination Probability Statistics Signal Space and Optimum Detection Probability Statistics Combinatorics
- Paper 2 | Digital Logic: Digital Systems & Boolean Basics Logic Gates & Hardware Boolean Expression Boolean Minimization Combinational Circuit Sequential Circuits Number System Number Representation Registers and Counters Boolean Algebra and Logic Gates Microprocessors and Microcontrollers Logic Families and CMOS Logic Microprocessors Logic Gates and Boolean Algebra Number Systems and Codes Minimization of Boolean Functions Timing, Hazards and Testing Logic Families Combinational Logic Design Arithmetic Circuits Semiconductor Memories and Programmable Logic Devices Combinational Logic Circuits Sequential Circuits and State Machines Latches and Flip-Flops Finite State Machines Minimization of Boolean Functions Arithmetic Circuits Registers and Counters Latches and Flip-Flops Number Systems and Codes
- Paper 2 | Computer Architecture: Basics of COA Floating Point Rep Cache Memory Organization Input Output Organisation Pipelining Instr Formats & Modes Control Unit Design Semiconductor Memories and Programmable Logic Processor Organization and Instructions Memory Hierarchy and Input/Output
- Paper 2 | Programming and 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
- Paper 2 | Algorithms: Algorithm Analysis Time Complexity Analysis Sorting Algorithms Greedy Algorithms Dynamic Programming Minimum Spanning Trees Shortest Path Algos
- Paper 2 | Theory Of Computation/Automata Theory: 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
- 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
- Paper 2 | Operating System: Introduction to OS Process Management CPU Scheduling Process Synchronization Threads & Process Creation Deadlock Memory Management Virtual Memory Disc Scheduling File Management
- Paper 2 | DataBase Management System/DBMS: 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
- Paper 2 | 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
- Paper 2 | CS/IT Sectional Mock Tests:
- Complete Paper Full Mock Test:
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
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: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.
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)}$.

