11.1 Practice Question

Duration: 5 min

This video lesson is available to enrolled students.

Return to /learn/COAL-INDIA-MANAGEMENT-TRAINEE/engineering-maths/group-theory/commutative-property-and-abelian-groups/asset-111-practice-question 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 lecture segment presents a practice problem on abstract algebra, specifically focusing on determining the highest algebraic structure formed by sets of odd and even numbers under addition and multiplication. The instructor systematically evaluates four options: (A, +), (A, *), (B, +), and (B, *), where A represents the set of odd numbers {1, 3, 5, ..., ∞} and B represents the set of even numbers {2, 4, 6, ..., ∞}. The core task involves testing closure, associativity, identity elements, and inverses to classify each structure as an Algebraic Structure, Semigroup, Monoid, or Group.

Chapters

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

    The video begins by displaying a multiple-choice question on screen defining set A as odd numbers and set B as even numbers. The instructor introduces the problem asking for the highest structure achieved by any combination of these sets with addition or multiplication. Visible text on screen lists options 1) (A, +), 2) (A, *), 3) (B, +), and 4) (B, *) against choices a) Algebraic Structure, b) Semi Group, c) Monoid. The instructor starts by analyzing option 1 (A, +), writing '1+3=4' on the board to demonstrate that adding two odd numbers results in an even number, which is not contained within set A. This failure of the closure property leads to crossing out option 1 as invalid.

  2. 2:00 – 4:44 02:00-04:44

    The instructor proceeds to evaluate option 2 (A, *), demonstrating closure by writing '1x3=3' and '3x5=15', showing that the product of odd numbers remains in set A. He verifies associativity using the general form '(axb)xc = ax(bxc)' and identifies '1' as the identity element, marking (A, *) as a Monoid. Next, he examines option 3 (B, +), noting that the sum of even numbers is closed within set B. However, he crosses out option 4 (B, *) likely due to lack of inverses or other structural limitations. The final conclusion identifies (A, *) as the highest structure achieved among the options, specifically a Monoid, based on satisfying closure, associativity, and identity properties.

The lecture effectively demonstrates the hierarchical nature of algebraic structures through a concrete example. By testing specific numerical cases like '1+3=4' and '1x3=3', the instructor makes abstract definitions of closure tangible. The progression from checking basic closure to verifying identity elements illustrates the logical steps required to classify structures. Key takeaway: Set A under multiplication forms a Monoid because it is closed, associative, and has an identity (1), whereas Set A under addition fails closure. This distinction is crucial for understanding why certain operations preserve set membership while others do not.

Loading lesson…