Rectangle Counting Tricks

Duration: 9 min

This video lesson is available to enrolled students.

Return to /learn/BPSC/part-2-primary-maths/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 the Course: About the Course
  2. Section 1 | Language (Hindi): भाषा, लिपि, ध्वनि, वर्ण, अक्षर, स्वर, व्यंजन, मात्रा और संयुक्ताक्षर, वर्तनी, वर्ण-विन्यास, अनुस्वार, अनुनासिक, चंद्रबिंदु और ‘र’ के रूप, शब्द, पद और शब्द-भेद, संज्ञा और सर्वनाम, विशेषण और क्रिया, लिंग, वचन, पुरुष और कारक, काल, वाच्य, वाक्य और वाक्य-भेद, संधि, समास, विलोम शब्द, पर्यायवाची शब्द, सामान्य अशुद्धियाँ, अनेक शब्दों के लिए एक शब्द, मुहावरे और लोकोक्तियाँ, अपठित गद्यांश और अपठित पद्यांश, Multi-Topic Content (Cross-Concept Material), वर्णमाला
  3. Section 1 | Language (उर्दू भाषा — 22 प्रश्न (निश्चित)): Spelling & Diacritics, Grammar (اسم, فعل, صفت, ضمیر), Vocabulary, Idioms & Proverbs, Comprehension
  4. Section 1 | Language (বাংলা / बांग्ला भाषा — 22 प्रश्न (निश्चित)): Bangla Script and Sounds, Bangla Grammar and Usage, Bangla Word Formation and Vocabulary, Reading and Text Interpretation
  5. Section 1 | Language (English): Vocabulary, Noun, Subject Verb Agreement (Verb Noun Agreement), Adjectives, Tenses, Pronoun, Verb, Adverb, Preposition, Articles, Determiner, Conjunction, Modals, Active Passive Voice (Voice), Direct and Indirect Speech, Sentence Correction (Error Correction), Sentence Completion (Fill in the blanks), Sentence Construction, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Cloze Test (Cloze Passage), Verbal Analogy (Word Based Analogy), Facts, Inference and Judgements
  6. Section 2 | Primary Maths & Reasoning: Ratio and Proportion (Ratios), Divisibility Rules, Mixture and Alligation, Permutation and Combination, Number System, HCF LCM, Sequence and Series (Series), Speed Time and Distance, Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Percentage, Average, Profit and Loss, Simple Interest and Compound Interest, Time and Work, Mensuration and Geometry, Age Problems, Arithmetic, Powers and Exponents (Surds and Indices), Algebra, Probability, Trigonometry, Syllogisms, Seating Arrangements, Blood Relations, Directions (Direction Test), Analytical Reasoning (Counting Figures Reasoning), Puzzle Solving (Puzzles), Calendar, Clock, Cubes & Dices, Venn Diagram, Data Arrangement, Inequality, Analogy, Ranking, Order and Sequence
  7. Section 2 | General Awareness (GK + Current Affairs): Polity, Physics, Biology, State Wise GK, Chemistry, History, Geography, Indian Economy, Environment, GK- Current Affairs, Static General Knowledge
  8. Section 3 | Computer System and Org. (CSO): Basics of COA, Floating Point Rep, Cache Memory Organization, Instr Formats & Modes, Programming the Basic Computer, Input Output Organisation, Register Transfer and Microoperations, Control Unit Design
  9. Section 3 | Database Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, SQL, File Organization & Indexing, Relational Algebra, Relational Calculus, Transaction Management, Concurrency Control
  10. Section 3 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Process Synchronization
  11. Section 3 | Computer Networks: Introduction to CN, Data Communication, DLL: Access Control, DLL: Flow Control, DLL: Error Control, Data Link Layer - Ethernet, Net Layer: IPv4 & Proto, Net Layer: IP Addressing, Transport Layer Services, TL: Congestion & UDP, Application Layer, Hardware basics
  12. Section 3 | Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Minimum Spanning Trees, Shortest Path Algos
  13. Section 3 | Theory Of Computation & Compiler Design: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Grammar, Regular Language Properties, Moore & Mealy Machines, Pushdown Automata & CFG, Turing Machines, Intro to Compilers, Lexical Analysis, Grammar & CFG, Syntax Analysis: Top-Down, Syntax Analysis: Bottom-Up, Semantic Analysis & SDT, Intermediate Code Gen, Code Optimization
  14. Section 3 | Emerging Trends (AI, Societal Ethics & MS Office): Artificial Intelligence, Emerging Tech Trends, Society, Law & Ethics, MS Office Applications
  15. Section 3 | Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Maintenance and Configuration Management, Software Testing
  16. Section 3 | C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  17. Section 3 | OOPS, C++, JAVA, HTML: OOPS with C++, Java, HTML Basics, CSS
  18. Section 3 | Java: Java Fundamentals, Array, String, IO & References
  19. Section 3 | Python: Introduction to Python, Tokens, Variables, Data Types, I/O, Operators & Expressions, Control Flow & Looping, Collections & Strings, Functions & Modules, File Handling & Data Analysis
  20. Section 3 | Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
  21. Section 3 | Multimedia: Multimedia
  22. BPSC Previous Year Papers:
  23. BPSC Full Mock Tests:
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…