How Many Different Function are Possible

Duration: 3 min

This video lesson is available to enrolled students.

Return to /learn/MPPSC-ASSISTANT-PROFESSOR-COMPUTER-SCIENCE-PAPER-2/unit-i-discrete-mathematical-structure/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. 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 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…