How Many Different Function are Possible

Duration: 3 min

This video lesson is available to enrolled students.

Return to /learn/COAL-INDIA-MANAGEMENT-TRAINEE/engineering-maths/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-2 | Programming & 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
  3. Paper-2 | Databases / DBMS & SQL: 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
  4. Paper-2 | Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
  5. Paper-2 | Computer Networks & Security: 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 Access Technologies, Network Security
  6. Paper-2 | Digital Logic: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Floating Point Rep
  7. 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
  8. 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
  9. Paper-2 | Computer Organization & Architecture: Basics of COA, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Programming the Basic Computer
  10. 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
  11. Paper-1 | General Awareness: Polity, Physics, Biology, Chemistry, Static General Knowledge, GK- Current Affairs, History, Geography, Indian Economy, Environment
  12. Paper-1 | Logical Reasoning: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Data Interpretation, Blood Relations, Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Selection Decision Table (Decision Making), Clock, Calendar, Cubes & Dices, Directions (Direction Test), Analogy, Seating Arrangements, Analytical Reasoning (Counting Figures Reasoning)
  13. Paper-1 | Quantitative Aptitude: Ratio and Proportion (Ratios), Mixture and Alligation, Permutation and Combination, Number System, HCF LCM, Speed Time and Distance, Average, Age Problems, Percentage, Profit and Loss, Time and Work, Pipe and Cistern, Simple Interest and Compound Interest, Powers and Exponents (Surds and Indices), Mensuration and Geometry, Probability, Statistics, Arithmetic, Algebra
  14. Paper-1 | English: Vocabulary, Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Correction (Error Correction), Sentence Completion (Fill in the blanks), Sentence Construction, Cloze Test (Cloze Passage)
  15. Coal India Previous Year Paper:
  16. Engineering Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic, Linear Algebra, Calculus
  17. Coal India Mock Test:
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…