Number of Injective Functions are Possible

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/functions/one-to-one-injective-function-definition-count-and-properties/asset-number-of-injective-functions-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 educational video segment explains the mathematical principles for determining the number of possible functions between two sets, specifically focusing on one-to-one mappings. The instructor begins by presenting the standard permutation formula, $^nP_m = P(n, m)$, as the general method for counting these functions. He highlights a specific scenario where the cardinality of both sets is equal ($|A| = |B| = n$), resulting in $n!$ possible functions. To illustrate the general case, he introduces variables $m$ and $n$ for the sizes of sets A and B respectively. He then constructs a visual example on the whiteboard, defining set A with five distinct elements (1, 2, 3, 4, 5) and set B with six distinct elements (a, b, c, d, e, f). He demonstrates the concept of a function by drawing arrows from elements in set A to elements in set B, showing how each element in the domain must map to exactly one element in the codomain.

Chapters

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

    The instructor starts by writing the formula for the number of possible functions as $^nP_m = P(n, m)$. He immediately follows this with a special case: if the size of set A equals the size of set B ($|A| = |B| = n$), then the number of functions possible is $n!$. He then begins a practical demonstration by writing $|A| = m$ and $|B| = n$. He draws two vertical ovals representing the sets. Inside the first oval, labeled A, he lists the numbers 1 through 5. Inside the second oval, labeled B, he lists the letters a through f. He draws arrows originating from the elements of set A pointing towards set B to visualize the mapping process. Below the diagram, he writes out the multiplication sequence $6 imes 5 imes 4 imes 3 imes 2$, representing the number of choices available for mapping each element of A to B.

  2. 2:00 – 3:47 02:00-03:47

    Continuing the example, the instructor writes the formal permutation formula $^nP_m = rac{n!}{(n-m)!}$ on the board. He substitutes the specific values from his example, writing $^6P_5 = rac{6!}{(6-5)!}$. He simplifies the denominator to $1!$ and then to $1$, leaving the result as $6!$. He expands $6!$ into its full product form: $6 imes 5 imes 4 imes 3 imes 2 imes 1$. This confirms the manual calculation he performed earlier in the diagram section. He concludes the segment by summarizing the relationship between the set sizes, writing $|A| = m ightarrow |B| = n$ to reinforce the variables used in the permutation formula for one-to-one functions.

The lecture effectively bridges the gap between abstract formulas and concrete counting methods. By starting with the general permutation formula and then applying it to a specific numerical example, the instructor clarifies how to calculate the number of one-to-one functions. The visual aid of drawing sets and arrows helps students understand the underlying logic of the multiplication principle used in the formula. The final expansion of the factorial confirms the consistency between the algebraic formula and the step-by-step counting method.

Loading lesson…