Rectangle Counting Tricks

Duration: 9 min

This video lesson is available to enrolled students.

Return to /learn/COAL-INDIA-MANAGEMENT-TRAINEE/logical-reasoning/analytical-reasoning-counting-figures-reasoning/counting-rectangles/asset-rectangle-counting-tricks 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 is a tutorial on counting rectangles in a grid, presented by an instructor named Yash Jain. The lesson begins with a 3x3 grid, where the instructor demonstrates a method to count all possible rectangles by summing the number of rectangles of each size. He explains that the total count is the product of the sum of the first n natural numbers for the rows and the sum for the columns. For a 3x3 grid, this is (1+2+3) * (1+2+3) = 6 * 6 = 36. The instructor then extends this concept to a 4x4 grid, showing the calculation as (1+2+3+4) * (1+2+3+4) = 10 * 10 = 100. The video uses a whiteboard to illustrate the method, writing out the sums and the final multiplication. The core idea is that for an n x n grid, the total number of rectangles is [n(n+1)/2]^2. The video concludes with a thank you message.

Chapters

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

    The video opens with a title card reading "RECTANGLE COUNTING TRICKS". The scene then transitions to a classroom setting where an instructor, identified as Yash Jain Sir, stands in front of a whiteboard. On the board, a 3x3 grid is drawn. The instructor begins to explain the problem of counting all the rectangles within this grid, setting up the lesson. The on-screen text identifies the instructor as a Knowledge Gate Educator and promotes a placement preparation course.

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

    The instructor demonstrates the method for counting rectangles in the 3x3 grid. He writes the sum of the first 3 natural numbers, 1+2+3, and calculates it to be 6. He then explains that this sum represents the number of ways to choose a vertical line for the rectangle's width. He repeats this for the horizontal lines, writing 1+2+3=6. He then multiplies these two sums, writing 6 x 6 = 36, to find the total number of rectangles. He explains that this method works because any rectangle is defined by choosing two vertical lines and two horizontal lines from the grid.

  3. 5:00 – 8:46 05:00-08:46

    The instructor moves on to a 4x4 grid, drawing it on the whiteboard. He applies the same method, writing the sum 1+2+3+4 and calculating it to be 10. He then multiplies 10 by 10, writing 10 x 10 = 100, to find the total number of rectangles in the 4x4 grid. He explains that the formula for an n x n grid is [n(n+1)/2]^2. The video ends with a "THANKS FOR WATCHING" screen.

The video provides a clear, step-by-step demonstration of a mathematical trick for counting rectangles in a grid. It starts with a simple 3x3 grid, breaking down the counting process into the sum of natural numbers for rows and columns, and then multiplying the results. The instructor then applies this same logic to a 4x4 grid, reinforcing the concept. The core of the lesson is the formula for the total number of rectangles in an n x n grid, which is derived from the sum of the first n natural numbers, a fundamental concept in combinatorics.

Loading lesson…