Cut and General cuboid rule

Duration: 8 min

This video lesson is available to enrolled students.

Return to /learn/GATE-GUIDANCE-BY-SANCHIT-SIR/general-aptitude/mensuration-and-geometry/3d-mensuration-solid-figures/asset-cut-and-general-cuboid-rule after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. Discrete Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic
  2. DataBase Management System/DBMS: 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
  3. Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
  4. Computer Architecture: Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design
  5. Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management
  6. C Language: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  7. Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  8. Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
  9. Computer Networks: Introduction to CN, 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
  10. Theory Of Computation/Automata Theory: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Grammar, Regular Language Properties, Moore & Mealy Machines, Pushdown Automata & CFG, Turing Machines, Complexity Theory
  11. 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
  12. Engineering Mathematics: Permutation and Combination, Linear Algebra, Calculus, Probability, Statistics
  13. General Aptitude: Ratio and Proportion (Ratios), Divisibility Rules, Data Interpretation, Logarithm, Number System, HCF LCM, Sequence and Series (Series), Speed Time and Distance, Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Percentage, Mensuration and Geometry, Mental Ability, Arithmetic, Profit and Loss, Powers and Exponents (Surds and Indices), Average, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Syllogisms, Venn Diagram, Seating Arrangements, Blood Relations, Directions (Direction Test), Analogy, Algebra, Time and Work, Analytical Reasoning (Counting Figures Reasoning), Puzzle Solving (Puzzles), Cubes & Dices, Ranking, Order and Sequence, Mixture and Alligation, Age Problems, Clock, Selection Decision Table (Decision Making), Data Arrangement
  14. English (Verbal Aptitude): Vocabulary, Noun, Subject Verb Agreement (Verb Noun Agreement), Adjectives, Tenses, Pronoun, Preposition, Direct and Indirect Speech, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Completion (Fill in the blanks), Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Correction (Error Correction), Verbal Analogy (Word Based Analogy), Conjunction, Interjection, Verb, Articles, Adverb, Modals, Sentence Construction
  15. Live Classes Recordings(Earlier Batch): GATE 2026 Live Class
  16. Full Mock Test:
  17. Previous Year Papers:
  18. GATE 2026 Counselling: Counselling and Guidance Sessions
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This lecture covers two main geometry topics: the cut and general cuboid rule, and calculating the longest diagonal of a cuboid. The first section explains that cutting a cube or cuboid into smaller pieces increases the number of pieces and surface area but does not change the total volume. Formulas are provided for calculating the side length of small cubes (a/n), the number of pieces (n^3 or pqr for a cuboid), and the cuts required without stacking (3(n-1) for a cube or (p-1)+(q-1)+(r-1) for a cuboid). The instructor uses visual grids and handwritten annotations to illustrate these concepts. The second section transitions to finding the longest diagonal of a cuboid using the formula d = √(a² + b² + h²). A worked example with dimensions 1.2 cm × 1.3 cm × 1.5 cm is solved, yielding an answer of approximately 2.23 cm from the given options (2.22, 2.32, 2.23, 2.35 cm). The final section briefly introduces a problem on cube surface area to diagonal, where a surface area of 13.5 m² is used with the formula S = 6a² to find a² = 2.25 and a = 1.5 m.

Chapters

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

    The instructor introduces the concept that cutting a cube or cuboid into smaller pieces increases the number of pieces and surface area but does not change total volume. On-screen text displays key formulas: 'Side of each small cube = a/n', 'Number of small cubes = n^3', and 'Cuts required without stacking = 3(n - 1)'. The instructor draws a red grid on the screen to visually represent dividing a cube's faces, writing '1' inside one square. The general cuboid rule is introduced with text showing 'Number of pieces = pqr' and 'Cuts required without rearranging or stacking = (p - 1) + (q - 1) + (r - 1)'. The instructor circles 'a/n' and writes 'a/3' below it, suggesting a specific example where n=3.

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

    The lecture continues with the general cuboid rule, emphasizing that cutting does not change total volume. The instructor highlights formulas for side length, number of small cubes, and cuts required, drawing red circles around key terms like 'n', 'n^3', and 'a^3'. The slide then transitions to a new topic: finding the longest diagonal of a cuboid. A problem is presented with dimensions '1.2 cm × 1.3 cm × 1.5 cm' and four options listed (2.22, 2.32, 2.23, 2.35 cm). A wireframe cuboid with a red diagonal arrow is shown at the bottom left. The instructor writes 'd = √' in red handwriting, completing it as 'd = √(a² + b² + h²)' and substituting the values '1.2² + 1.5² + 1.3²'.

  3. 5:00 – 7:34 05:00-07:34

    The instructor completes the longest diagonal calculation, showing 'd = √1.49' with a note and a circled value under the radical sign, arriving at an answer of 2.23 cm from the options. The slide then switches to a new topic titled 'Cube Surface Area to Diagonal', stating the surface area is '13.5 m²'. A red-boxed formula 'S = 6a²' is displayed, with step-by-step work computing 'a² = 13.5/6 = 2.25' and a circled value of '1.5'. This section demonstrates how to find the side length from surface area, which can then be used to calculate the diagonal of a cube.

The lecture progresses from theoretical rules about cutting cuboids to practical applications involving diagonals and surface area. The first part establishes foundational formulas for pieces and cuts, using visual aids like grids to make abstract concepts concrete. The transition to diagonal calculation shows how these geometric principles apply to real problems, with a clear worked example demonstrating the formula d = √(a² + b² + h²). The final section on surface area to diagonal extends the learning by showing how one property (surface area) can be used to find another (side length, and subsequently diagonal). The teaching style combines on-screen text formulas with handwritten annotations, creating a layered explanation that reinforces key concepts through multiple representations. The use of specific numerical examples helps students see how the general rules apply to concrete problems.

Loading lesson…