Practice Questions

Duration: 7 min

This video lesson is available to enrolled students.

Return to /learn/COAL-INDIA-MANAGEMENT-TRAINEE/engineering-maths/propositional-and-predicate-logic/implication-and-bi-conditional-operators-in-logic/asset-practice-questions-2354 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 lecture focuses on determining the validity of six logical arguments presented on screen: Modus Ponens, Modus Tollens, and four numbered arguments (1-4). The instructor systematically analyzes each argument form, using truth tables and logical equivalences to verify if the conclusion follows from the premises. He writes out logical expressions like $[(p o q) \land p] o q$ to demonstrate tautologies. The lecture progresses from standard forms to more complex implications, ultimately confirming the validity of the arguments through step-by-step deduction. The visual aids include tables with premises ($P_1, P_2$) and conclusions ($Q$), which the instructor annotates with red ink to highlight key logical steps.

Chapters

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

    The video opens with the question "consider the following arguments and find which of them are valid?" displayed at the top. Six argument tables are visible: Modus Ponens, Modus Tollens, and four numbered boxes (1-4). The instructor begins with Modus Ponens, writing the premises $P_1: p o q$ and $P_2: p$ with conclusion $Q: q$. He writes a truth table for $p$ and $q$, marking rows where premises are true. He writes the logical expression $[(p o q) \land p] o q$ to show it is a tautology. He then moves to Modus Tollens, analyzing premises $P_1: p o q$ and $P_2: eg q$ leading to conclusion $Q: eg p$. He writes the expression $[(p o q) \land eg q] o eg p$. He uses red ink to underline and circle key parts of the tables.

  2. 2:00 – 5:00 02:00-05:00

    The instructor proceeds to analyze the numbered arguments. For argument 1, he examines premise $P_1: eg p$ and conclusion $Q: p o q$. He writes a truth table with columns for $p, q, p o q$. He marks truth values (F, T) to show that whenever $ eg p$ is true, $p o q$ is also true. For argument 2, he analyzes premise $P_1: q$ and conclusion $Q: p o q$. He demonstrates that if $q$ is true, $p o q$ is necessarily true. For argument 3, he looks at premise $P_1: eg(p o q)$ and conclusion $Q: eg q$. He explains that if $p o q$ is false, then $q$ must be false. For argument 4, he analyzes premise $P_1: eg(p o q)$ and conclusion $Q: p$. He shows that if $p o q$ is false, $p$ must be true. He writes truth values like F, T, T, T on the board to support his claims.

  3. 5:00 – 6:45 05:00-06:45

    The instructor concludes the analysis by summarizing the validity of all arguments. He writes final logical expressions and truth values on the board. He puts red marks (crosses or checks) on each argument box, likely indicating they are all valid. He writes $p \lor 1$ and $1$ to show tautologies. He emphasizes that validity is determined by the logical structure. The video ends with the instructor looking at the camera, having completed the analysis of all six argument forms. He uses the red pen to circle specific truth values and write logical equivalences like $p o v$ (possibly $p o q$).

The lecture provides a comprehensive guide to validating logical arguments. It starts with fundamental forms like Modus Ponens and Modus Tollens, establishing the criteria for validity. It then applies these criteria to non-standard argument forms, demonstrating that validity depends on the logical relationship between premises and conclusion, not just the form. The instructor uses truth tables and algebraic manipulation of logical expressions to prove that all presented arguments are valid. The visual progression from standard to non-standard forms helps students understand the universality of logical validity. The use of red ink highlights the critical steps in the deduction process, ensuring students can follow the logical flow from premises to conclusion.

Loading lesson…