Painted & Cut Cube Problems
Duration: 42 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- Database Management System: 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
- Discrete Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic
- Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Registers and Counters, Boolean Algebra and Logic Gates, Microprocessors and Microcontrollers, Logic Families and CMOS Logic, Microprocessors, Logic Gates and Boolean Algebra, Number Systems and Codes, Minimization of Boolean Functions, Timing, Hazards and Testing, Logic Families, Combinational Logic Design, Arithmetic Circuits, Semiconductor Memories and Programmable Logic Devices, Combinational Logic Circuits, Sequential Circuits and State Machines, Latches and Flip-Flops, Finite State Machines, Minimization of Boolean Functions, Arithmetic Circuits, Registers and Counters, Latches and Flip-Flops, Number Systems and Codes
- Computer Architecture: Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Semiconductor Memories and Programmable Logic, Processor Organization and Instructions, Memory Hierarchy and Input/Output
- Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Virtual Memory, Disc Scheduling, File Management, Memory Management, Threads & Process Creation
- 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, Network Security, Hardware Basics
- Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
- Algorithms: Algorithm Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Time Complexity Analysis
- 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, Complexity Theory
- 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
- C language: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums
- Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
- Emerging Trends & AI: Emerging Tech Trends, Artificial Intelligence, Cloud Computing, Internet of Things
- Computer Graphics: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing
- Aptitude: Percentage, Ratio and Proportion (Ratios), Logarithm, HCF LCM, Average, Sequence and Series (Series), Number System, Powers and Exponents (Surds and Indices), Algebra, Permutation and Combination, Probability, Profit and Loss, Simple Interest and Compound Interest, Pipe and Cistern, Speed Time and Distance, Mixture and Alligation, Mensuration and Geometry, Mental Ability, Age Problems, Partnership, Statistics, Data Interpretation, Arithmetic, Linear Algebra, Trigonometry, Percentages, Simplification and Approximation, Number System, Ratio and Proportion, Averages, Mixtures and Alligation, Permutations and Combinations, Profit, Loss and Discount, Sequences and Series, Vocabulary, Subject-Verb Agreement, Sentence Completion, Geometry, Reading Comprehension, Powers, Surds and Logarithms, Mathematical Operations, Alphabet and Word Tests, Transformation of Shapes, Signal Space and Optimum Detection, Constraint Puzzles, Mensuration, Patterns in Two-Dimensional Figures, Measurement and Quantity Take-Off, Three-Dimensional Patterns and Visualization, Numerical Reasoning, Sentence Structure and Correction, Critical Reasoning, Syllogisms and Venn Diagrams, Coding and Decoding, Series Completion, Order, Ranking and Sequence, Data Sufficiency, Differential Calculus, Wireless, Satellite and Optical Communication Systems, Complex Analysis, Vector Analysis, Trigonometry, Probability, Statistics, Differential Calculus, Algebra, Time and Work, Speed, Time and Distance, Data Interpretation, Combinatorics
- Reasoning: Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Seating Arrangements, Blood Relations, Directions (Direction Test), Analytical Reasoning (Counting Figures Reasoning), Puzzle Solving (Puzzles), Calendar, Clock, Cubes & Dices, Selection Decision Table (Decision Making), Logical Sequence Of Words, Venn Diagram, Data Arrangement, Inequality, Analogy, Ranking, Order and Sequence, TCS NQT Advanced Reasoning Ability, Assembling and Grouping of Shapes, Cubes and Dice, Analogy and Classification, Direction Sense, Algebra, Logical Deduction and Induction, Speed, Time and Distance, Narrative Sequencing, Project Monitoring, Resources and Safety, Traverse Surveying, Time and Work, Clocks and Calendars, Data Interpretation, Blood Relations, Data Sufficiency
- English (Verbal Ability): Vocabulary, Noun, Pronoun, Adjectives, Preposition, Articles, Direct and Indirect Speech, Tenses, Conjunction, Subject Verb Agreement (Verb Noun Agreement), Modals, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Correction (Error Correction), Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Cloze Test (Cloze Passage), Verbal Analogy (Word Based Analogy), Adverb, Verb, Prepositions and Conjunctions, Idioms and Phrases, Verb Forms and Verb Patterns, Sentence Basics, Nouns and Pronouns, Adjectives and Adverbs, Articles and Determiners, Voice and Reported Speech, Modals, Conditionals and Subjunctive, Blood Relations, Tenses, Vocabulary
- Engineering Mathematics: Calculus, Vectors
- GATE Live Class Recordings 2026: GATE 2026 Live Class
AI summary & chapters
AI Summary
An AI-generated summary of this video lecture.
This educational video provides a comprehensive tutorial on Painted & Cut Cube Problems, designed to help students master spatial reasoning and combinatorial counting techniques. The lesson begins by establishing a foundational understanding of cube geometry, specifically focusing on how the position of smaller cubes within a larger structure determines the number of painted faces. The instructor systematically introduces four key categories: corner cubes (3 painted faces), edge cubes excluding corners (2 painted faces), face-center cubes (1 painted face), and inner cubes (0 painted faces). The teaching flow progresses from these basic definitions to the derivation of algebraic formulas for various painting scenarios, including all six faces painted, one face painted, two adjacent or opposite faces painted, and three mutually adjacent faces painted. The video also extends these concepts to cuboids with unequal dimensions (l, b, h) and introduces color-specific problems where specific colors are assigned to faces. Throughout the lecture, the instructor utilizes a mix of theoretical explanations and practical problem-solving examples, guiding students through step-by-step calculations using variables like 'n' to represent the number of divisions per edge. Key formulas such as Total small cubes = n^3, 2 painted faces = 12(n-2), and 0 painted faces = (n-2)^3 are emphasized as essential tools for solving these problems efficiently. The lesson concludes with complex applications involving conditions like 'at most one painted face,' requiring the summation of multiple categories to arrive at a final answer.
Chapters
0:00 – 2:00 00:00-02:00
The video opens with an introduction to the topic of 'Painted & Cut Cube Problems' and 'Rotation & Comparison of Dice'. The instructor presents a visual learning roadmap displayed on screen, which outlines the study plan in both English and Hindi. The roadmap explicitly lists the progression of topics: first understanding cube positions (corner, edge, face-centre, inner), then counting painted faces using direct formulas. The visual aids include a diagram of a cube labeled with actions like 'Paint', 'Cut', and 'Rotate' to illustrate the core concepts. The instructor emphasizes that students must first understand cube positions before attempting to solve complex cases involving painted faces and dice rolling. This initial segment sets the stage for a structured approach to mastering spatial geometry problems, ensuring students grasp the fundamental language of cubes before moving to advanced calculations.
2:00 – 5:00 02:00-05:00
The instructor delves into the 'Basic Language of Cubes', defining how cutting a large cube into smaller ones determines the number of painted faces based on position. Visual aids include diagrams showing corner, edge, and face-centre cubes with their respective painted faces. The lesson defines four types of smaller cubes: corner, edge, face-center, and inner, detailing how many outer faces are painted for each. Specifically, the text on screen states 'Corner = 3 faces painted', 'Edge = 2 faces painted', and 'Face centre = 1 face painted'. The instructor draws a 3D cube diagram and writes down dimensions, starting with an example of an '8 cm' side length. He demonstrates the calculation of smaller cubes (n) by dividing the total dimension by a hypothetical unit length, setting up for further analysis of painted faces. This section establishes the critical rule that position decides painted faces, a concept reinforced by color-coded grids showing the distribution of painted faces.
5:00 – 10:00 05:00-10:00
The lesson focuses on the fundamental rules for counting painted faces, emphasizing that the number of painted faces depends entirely on the position of the small cube within the larger structure. The instructor explains that corner small cubes touch 3 outer faces, edge small cubes (excluding corners) touch 2 outer faces, face-center cubes touch only 1 outer face, and inner small cubes touch no outer faces. A visual aid shows a 3x3 grid representing the faces of a cube to illustrate how many sides are painted for each position type. The instructor summarizes this as the 'Master Counting Idea', stating that 3 painted faces come only from corners and 2 painted faces come from edges, excluding corner cubes. This segment reinforces the concept that understanding position is paramount before applying any formulas, ensuring students can visualize the physical arrangement of cubes within a larger structure.
10:00 – 15:00 10:00-15:00
The instructor introduces the standard model for a cube with all six faces painted and cut into smaller cubes. He demonstrates how to calculate the number of small cubes with specific face counts using formulas involving 'n', where n is the number of divisions per edge. The text on screen displays key formulas: 'Total small cubes = n^3', '3 faces painted = 8', '2 faces painted = 12(n-2)', '1 face painted = 6(n-2)^2', and '0 face painted = (n-2)^3'. The lesson transitions from theoretical formulas to a specific practice problem where n=4. Question 1 is presented: 'A cube is painted on all six faces and cut into 4 equal parts along each edge.' The instructor emphasizes the importance of identifying 'n' as the number of equal parts along an edge and selecting the correct formula based on the required painted face count. This segment bridges theory and practice, showing students how to apply algebraic expressions to solve real problems.
15:00 – 20:00 15:00-20:00
This segment covers solved examples of cube cutting problems where all faces are painted. The instructor demonstrates how to calculate the number of small cubes with specific face counts using standard formulas based on the number of cuts per edge. For Question 1, where n=4 and the goal is to find cubes with exactly two painted faces, he applies the formula 12(n-2), resulting in an answer of 24. For Question 2, where n=5 and the goal is to find cubes with no painted faces, he applies the formula (n-2)^3, resulting in an answer of 27. The instructor also reviews a concept slide summarizing formulas for all six faces painted scenarios. He highlights the process of identifying 'n' as the number of equal parts along an edge and substituting values into algebraic expressions. This section reinforces the application of formulas through concrete examples, ensuring students can verify their answers against multiple-choice options.
20:00 – 25:00 20:00-25:00
The video segment covers two specific problems involving painted cubes cut into smaller units. The first problem calculates the number of small cubes with exactly one painted face from a 12 cm cube cut into 3 cm pieces. The instructor calculates n = 12/3 = 4 and uses the formula (n-2)^2 * 6 or similar logic for single painted faces. The second problem asks for the number of small cubes with at least one painted face when a cube is cut into 6 equal parts along each edge. The instructor applies the total cubes formula n^3 and subtracts unpainted ones for 'at least one' painted face. Finally, the instructor transitions to a general formula slide for cuboids with different dimensions (l, b, h). This segment introduces the concept of 'at least one' painted face and extends the learning to cuboids, broadening the scope of problems students can solve.
25:00 – 30:00 25:00-30:00
The video segment covers the 'Cuboid Model' and its application in solving problems where cubes are painted and cut. It transitions from general formulas for different numbers of painted faces to specific examples involving cuboids with dimensions 6x5x4. The lesson then moves to a scenario where only one face of a cube is painted, followed by a concept slide explaining the case where two opposite faces are painted. The instructor introduces formulas for cuboids: '3 painted faces = 8 if all six faces are painted', '2 painted faces = 4[(l-2)+(b-2)+(h-2)]', '1 painted face = 2[(l-2)(b-2)+(b-2)(h-2)+(l-2)(h-2)]', and '0 painted face = (l-2)(b-2)(h-2)'. Question 6 is presented: 'A cuboid has dimensions 6 x 5 x 4 small cubes.' Question 7 involves a cube divided into 4 equal parts with only one face painted. This segment expands the curriculum to include non-cubic shapes and varying painting conditions.
30:00 – 35:00 30:00-35:00
The video lesson progresses through formulas for painted cube problems involving adjacent faces. It first covers the case of two adjacent faces being painted, detailing formulas for cubes with exactly 2, 1, or 0 painted faces. The instructor then transitions to three adjacent faces being painted, presenting the corresponding formulas for cubes with 3, 2, or 1 painted faces. Specifically, 'Exactly 3 painted faces = 1', 'Exactly 2 painted faces = 3(n-1)', and 'Exactly 1 painted face = 3(n-1)^2'. Finally, a specific practice question is introduced involving a cube divided into 5 parts with three mutually adjacent faces painted, asking for the count of small cubes with exactly one painted face. The instructor highlights specific formulas for different painted face counts and connects theoretical formulas to a practical problem-solving example. This segment addresses more complex painting scenarios that require careful application of derived formulas.
35:00 – 40:00 35:00-40:00
The instructor explains the rules for 'Colour-Specific Cube Questions', focusing on how small cubes with two specific colors are located. The lesson highlights that adjacent color pairs appear on common edges, while opposite faces result in zero cubes having both colors. A specific example problem is presented where a cube cut into 4 parts per edge has red and blue adjacent faces, asking for the count of small cubes with both colors. The instructor uses handwritten notes to label 'Top' and 'Front' and highlights the formula for adjacent colour pairs: 'Number of cubes having both those adjacent colours = n'. The text on screen states 'Adjacent colour pair = n; opposite colour pair = 0'. The instructor transitions to a new topic on 'Unequal Cuts' involving cuboids, where parts are calculated as actual dimension divided by small cube side. This segment introduces color-based logic and unequal cutting scenarios, adding another layer of complexity to the problem-solving toolkit.
40:00 – 41:42 40:00-41:42
The instructor transitions from Question 13 to Question 14, which involves a cube painted on all six faces and cut into 7 parts along each edge. The core concept being taught is determining the number of small cubes with 'at most one painted face,' which requires calculating cubes with zero painted faces plus those with exactly one painted face. The instructor demonstrates the formulas for internal cubes (0 painted) and face-center cubes (1 painted), summing them to find the final answer. The text on screen shows '0 Painted = (7-2)^3 = 125' and '1 Painted = 6(7-2)^2 = 150'. The final sum is calculated as '125 + 150 = 275', matching option A. The instructor explains the logic behind 'at most one' condition and verifies the final answer against multiple-choice options. This concluding segment demonstrates how to combine different categories of cubes to solve complex conditions, reinforcing the importance of careful interpretation of problem statements.
The video systematically builds a comprehensive framework for solving Painted & Cut Cube Problems, starting from basic geometric definitions and progressing to complex algebraic applications. The core pedagogical strategy involves establishing a clear 'Basic Language of Cubes' where students learn to categorize small cubes by position (corner, edge, face-center, inner) and associate each with a specific number of painted faces. This foundational knowledge is then leveraged to derive and apply standard formulas for various painting scenarios, including all six faces painted, one face painted, two adjacent or opposite faces painted, and three mutually adjacent faces painted. The instructor emphasizes the variable 'n' as a critical parameter representing the number of divisions per edge, which serves as the input for all algebraic formulas. The lesson also extends these concepts to cuboids with unequal dimensions (l, b, h) and introduces color-specific problems where specific colors are assigned to faces. Throughout the video, the instructor uses a mix of theoretical explanations and practical problem-solving examples, guiding students through step-by-step calculations. Key formulas such as Total small cubes = n^3, 2 painted faces = 12(n-2), and 0 painted faces = (n-2)^3 are repeatedly emphasized as essential tools. The video concludes with complex applications involving conditions like 'at most one painted face,' requiring the summation of multiple categories to arrive at a final answer. This structured approach ensures students can tackle a wide range of spatial reasoning problems with confidence and accuracy.

