Practice Question

Duration: 4 min

This video lesson is available to enrolled students.

Return to /learn/COAL-INDIA-MANAGEMENT-TRAINEE/engineering-maths/relations/bounded-unbounded-distributive-complemented-lattices-and-boolean-algebr/asset-practice-question-2171 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.

The video is an academic lecture focused on identifying which of the given mathematical structures form a lattice and a Boolean Algebra. The instructor systematically analyzes seven options, drawing Hasse diagrams to visualize the partial order relations (divisibility or subset inclusion) and checking for lattice properties like the existence of least upper bounds (LUB) and greatest lower bounds (GLB). He evaluates each set for Boolean algebra properties, such as the existence of complements and distributivity.

Chapters

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

    The lecture begins with option (1) `{1,2,3,4,6,9}` under divisibility. The instructor draws a Hasse diagram showing 4 and 9 at the top level, noting they are incomparable. He identifies that their LCM (36) is not in the set, concluding it is not a lattice (marked '0 L'). He then moves to option (2) `{2,3,4,6,12}`, drawing a diagram with 2 and 3 at the bottom and 12 at the top. He marks this structure as 'JSL' (Join Semilattice), indicating it lacks a GLB for some pairs (like 2 and 3).

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

    The instructor continues analyzing the remaining options. For (3) `{1,2,3,5,30}`, he draws a diagram with 1 at the bottom and 30 at the top, marking it 'CL'. For (4) `{1,2,3,6,9,18}`, he draws a diagram and marks it 'JSL'. For (5) `{2,3,4,9,12,18}`, he draws a diagram with 2 and 3 at the bottom and marks it 'CL'. He briefly mentions option (6) `[R, <=]` as a lattice but not Boolean. Finally, he focuses on option (7) `[P(A), subseteq], A = {1,2,3}`, drawing the complete power set lattice diagram, which represents a Boolean Algebra.

The lecture provides a step-by-step elimination process to identify the correct Boolean Algebra. By constructing Hasse diagrams for each candidate set, the instructor demonstrates that most options fail to be lattices (due to missing LUB or GLB) or fail to be Boolean algebras (due to lack of complements). The final example, the power set of a 3-element set, is identified as the correct Boolean Algebra because it satisfies all required properties, including having a unique bottom and top element and complements for every element.

Loading lesson…