How Many Different Function are Possible

Duration: 3 min

This video lesson is available to enrolled students.

Return to /learn/BIHAR-POLYTECHNIC-LECTURER-COMPUTER-SCIENCE/paper-1-discrete-structures-and-theory-of-logic/functions/definition-of-a-function-domain-co-domain-range-and-count-of-possible-functions/asset-how-many-different-function-are-possible after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. Discrete Mathematics: Permutation, Combination and Probability / क्रमचय, संचय एवं प्रायिकता, Set Theory, Relations, Functions, Propositional and Predicate Logic, Graph Theory, Group Theory
  2. Digital Logic: Digital Systems & Boolean Basics, Boolean Expression, Boolean Minimization, Logic Gates & Hardware, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Floating Point Rep
  3. Computer Organization and Architecture: Basics of COA, Programming the Basic Computer, Cache Memory Organization, Input Output Organisation, Instr Formats & Modes, Register Transfer and Microoperations, Control Unit Design, Pipelining, Multiprocessors
  4. Programming: Language Design, C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling, OOPS with C++
  5. Data Structures: Introduction to DS, Array, Linked List, Stack, Queue, Tree, Graphs, Hashing
  6. Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Advanced Algorithms
  7. Theory of Computation: Grammar, Regular Language Properties, Moore & Mealy Machines, Turing Machines
  8. 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, Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Pushdown Automata & CFG, Complexity Theory
  9. Operating Systems: 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, Security
  10. Database Management Systems: 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, ORDBMS, NoSQL
  11. Computer Networks: 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
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This video lecture explains the formula for calculating the number of possible functions from one set to another. The instructor presents a problem: given sets A and B with cardinalities |A| = m and |B| = n, determine the number of functions from A to B. He underlines the cardinalities and writes the answer $n^m$. He uses a concrete example. He defines set A with elements 'a' and 'b' and set B with '1', '2', '3'. He demonstrates the counting principle. For each element in the domain, there are 'n' choices in the codomain. Since there are 'm' elements in the domain, the total is $n^m$.

Chapters

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

    The instructor introduces the problem statement on the slide: "If |A| = m and |B| = n, then number of functions possible from A to B = ?". He underlines the cardinalities and writes the answer $n^m$. He draws two sets, A and B. He populates set A with 'a' and 'b' and set B with '1', '2', '3'. He writes |A| = m = 2 and |B| = n = 3. He writes "x3" next to 'a'. He writes another "x3" next to 'b'. He explains the choices for mapping. This section establishes the specific example used to derive the general formula.

  2. 2:00 – 2:34 02:00-02:34

    The instructor completes the calculation. He writes "3 x 3 = 9" to show the total number of functions for the specific case where m=2 and n=3. He writes $3^2$ and circles it, connecting the numerical result back to the general formula $n^m$. He circles the $n^m$ on the original slide text to reinforce the final answer. He emphasizes the relationship between the base and exponent. This concludes the derivation.

The lecture bridges abstract set theory notation and concrete counting principles. By starting with the general formula $n^m$ and grounding it in a specific example with sets of size 2 and 3, the instructor makes the concept accessible. The visual aid of drawing arrows and writing "x3" next to each element in set A clearly demonstrates the multiplication principle of counting. The final step of circling $n^m$ ties the specific calculation (3x3=9) back to the general rule, ensuring students understand that the exponent 'm' represents the number of elements in the domain (set A) and the base 'n' represents the number of elements in the codomain (set B). This ensures a clear understanding of the formula's application.

Loading lesson…