Cut and General cuboid rule

Duration: 8 min

This video lesson is available to enrolled students.

Return to /learn/IBPS-SO-IT-MAINS/quantitative-aptitude-numerical-ability/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. About Course: About the Course
  2. English Language: Vocabulary, Noun, Adjectives, Tenses, Pronoun, Adverb, Preposition, Conjunction, Active Passive Voice (Voice), Articles, Direct and Indirect Speech, Sentence Correction (Error Correction), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Completion (Fill in the blanks), Cloze Test (Cloze Passage)
  3. Quantitative Aptitude & Numerical Ability: Ratio and Proportion (Ratios), Data Interpretation, Mixture and Alligation, Permutation and Combination, Number System, Sequence and Series (Series), Speed Time and Distance, Algebra, Speed Mathematics and Basic Mathematics, Percentage, Average, Time and Work, Simple Interest and Compound Interest, Profit and Loss, Age Problems, Partnership, Mensuration and Geometry, Probability, IBPS Specific Videos
  4. Reasoning: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Puzzle Solving (Puzzles), Seating Arrangements, Blood Relations, Syllogisms, Inequality, Directions (Direction Test), Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Clock, Calendar, Analytical Reasoning (Counting Figures Reasoning), Selection Decision Table (Decision Making), Cubes & Dices, Machine Input-Output
  5. Data Structures- Professional Knowledge: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  6. Algorithms- Professional Knowledge: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
  7. Python- Professional Knowledge: Python for Placements by Yash Sir, Collections & Strings, Functions & Modules, File Handling & Data Analysis, Python Basics
  8. Operating System- Professional Knowledge: Introduction to OS, Process Management, Process Synchronization, CPU Scheduling, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Unix OS, Linux OS, Windows OS
  9. DBMS + SQL- Professional Knowledge: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), File Organization & Indexing, SQL, Transaction Management, Concurrency Control, Relational Algebra, Relational Calculus, NoSQL, Data Warehousing & Mining
  10. Computer Networks- Professional Knowledge: Introduction to CN, Data Communication, Net Layer: IP Addressing, Net Layer: IPv4 & Proto, Application Layer, Hardware basics, Network Security, Transport Layer Services, DLL: Flow Control, Cloud Computing
  11. Software Engineering- Professional Knowledge: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  12. Computer Organization & Microprocessor- Professional Knowledge: Basics of COA, Cache Memory Organization, Programming the Basic Computer, Instr Formats & Modes
  13. Digital Logic Design- Professional Knowledge: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
  14. Theory of Computation- Professional Knowledge: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Regular Language Properties, Pushdown Automata & CFG, Turing Machines
  15. Compiler Design- Professional Knowledge: Intro to Compilers, Lexical Analysis, Grammar & CFG, Syntax Analysis: Top-Down, Intermediate Code Gen, Code Optimization
  16. Programming Languages- Professional Knowledge: C Programming by Yash Sir, Language Design, DMA, Macros, Scoping & File Handling, Object Oriented Programming (OOPS), Programming in C++, Java, HTML, C Language Core
  17. Emerging Tech- Professional Knowledge: Emerging Tech Trends, MS Office Applications
  18. Artificial Intelligence: Artificial Intelligence
  19. Image Processing: Digital Image Fundamentals
  20. Internet & Web Technology: Website, Browser & Services, Internet Fundamentals, Server Side & Security, Cyber Threats and Malware Attacks, Role of Internet and Web Services, Security in Mobile and Wireless Computing, Electronic Data Interchange and E-Commerce, Physical Security and Cryptography Basics, Cyber Safety and Security, Ethical Hacking
  21. Descriptive Paper: English Writing Ability
  22. Mains - Unit Tests:
  23. Mains - Full Mock Tests:
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…