Square Counting Tricks

Duration: 25 min

This video lesson is available to enrolled students.

Return to /learn/BIHAR-STET-COMPUTER-SCIENCE-COMPLETE-COURSE/logical-reasoning/analytical-reasoning-counting-figures-reasoning/counting-squares/asset-square-counting-tricks after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About the course: About the Course
  2. Mathematical Aptitude: संख्या पद्धति / Number System, महत्तम समापवर्तक और लघुत्तम समापवर्त्य / HCF and LCM, Divisibility Rules, प्रतिशत / Percentage, अनुपात और समानुपात / Ratio and Proportion, औसत / Average, लाभ, हानि और बट्टा / Profit, Loss and Discount, समय और कार्य / Time and Work, घन क्षेत्रमिति / Solid Mensuration, साधारण और चक्रवृद्धि ब्याज / Simple and Compound Interest, समय, चाल और दूरी / Time, Speed and Distance, Age Problems, मिश्रण और एलिगेशन / Mixture and Alligation, Algebra, सरलीकरण, घातांक और करणी / Simplification, Indices and Surds, Pipe and Cistern, Trigonometry, Statistics, आँकड़ा निर्वचन / Data Interpretation, Arithmetic, समुच्चय, संबंध, फलन और विविक्त गणित / Sets, Relations, Functions and Discrete Mathematics, संख्या पद्धति और संख्या सिद्धांत / Number Systems and Number Theory, निर्देशांक ज्यामिति, सदिश और त्रिविमीय ज्यामिति / Coordinate Geometry, Vectors and 3D Geometry, बहुपद, समीकरण और सम्मिश्र संख्याएँ / Polynomials, Equations and Complex Numbers
  3. Logical Reasoning: श्रेणी / Series, कूट लेखन एवं कूट वाचन / Coding-Decoding, सादृश्यता एवं वर्गीकरण / Analogy and Classification, रक्त संबंध / Blood Relations, दिशा एवं दूरी / Direction and Distance, क्रम एवं रैंकिंग / Order and Ranking, अशाब्दिक तर्क / Non-Verbal Reasoning, बैठक व्यवस्था एवं पहेलियाँ / Seating Arrangement and Puzzles, Syllogisms, वेन आरेख, न्याय वाक्य एवं असमानता / Venn Diagrams, Syllogism and Inequalities, गणितीय संक्रियाएँ एवं लुप्त संख्या / Mathematical Operations and Missing Numbers, वर्णमाला एवं संख्या परीक्षण / Alphabet and Number Test, कथन आधारित तार्किक विवेचन / Statement-Based Reasoning, Analytical Reasoning (Counting Figures Reasoning), घन, पासा एवं आकृतियों की गिनती / Cubes, Dice and Figure Counting, कैलेंडर एवं घड़ी / Calendar and Clock, Clock
  4. General Knowledge: वैज्ञानिक उपलब्धियाँ और अनुसंधान / Scientific Achievements and Research, Chemistry, Biology, History, Geography, Polity, Indian Economy, समसामयिकी / Current Affairs, Static General Knowledge
  5. Art of Teaching: शिक्षण-अधिगम प्रक्रिया एवं कक्षा प्रबंधन / Teaching-Learning Process and Classroom Management, Learners & Learning Process, Factors Affecting Teaching, शिक्षण विधियाँ एवं उपागम / Teaching Methods and Approaches, सूक्ष्म शिक्षण एवं कक्षा संप्रेषण / Microteaching and Classroom Communication, शिक्षण सहायक सामग्री एवं शैक्षिक तकनीकी / Teaching Aids and Educational Technology, आकलन एवं मूल्यांकन / Assessment and Evaluation, शिक्षक: गुण, व्यावसायिक नैतिकता एवं विकास / Teacher: Qualities, Professional Ethics and Development, शैक्षिक नीतियाँ, अधिनियम एवं प्रशासन / Educational Policies, Acts and Administration, पाठ्यचर्या, कला एवं सह-शैक्षिक क्षेत्र / Curriculum, Arts and Co-curricular Areas, निर्देशन एवं परामर्श / Guidance and Counselling, दिव्यांग बच्चों की शिक्षा / Education of Children with Disabilities, Micro-Teaching & Teaching Skills, पाठ योजना / Lesson Planning
  6. Environmental Science: Environment
  7. Unit 1 | Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
  8. Unit 2 | COA: Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Instr Formats & Modes, Control Unit Design, Register Transfer and Microoperations, Programming the Basic Computer
  9. Unit 3 | C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  10. Unit 3 | Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  11. Unit 4 | Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Advanced Algorithms
  12. Unit 5 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management
  13. Unit 6 | 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, Transaction Management, Concurrency Control
  14. Unit 7 | Computer Networks: 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
  15. Unit 8 | Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  16. Unit 9 | Object Oriented Programming: OOPS with C++
  17. Unit 10 | Web Development: HTML Basics, CSS, JavaScript-Basics, XML, Node.js
  18. Unit 11 | 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
  19. Unit 12 | IoT: Emerging Tech Trends, Cloud Computing, कंप्यूटर नेटवर्क / Computer Networks
  20. Unit 13 | Artificial Intelligence: Approaches to AI, Search Algorithms, Game Playing, Knowledge Representation, Natural Language Processing, Artificial Neural Networks, Genetic Algorithms
  21. Unit 14 | E-Commerce: Electronic Data Interchange and E-Commerce, Role of Internet and Web Services, Security in Mobile and Wireless Computing, Physical Security and Cryptography Basics, Cyber Safety and Security
  22. Unit 15 | Multimedia: Multimedia
  23. Unit 16 | Python: Introduction to Python, Tokens, Variables, Data Types, I/O, Operators & Expressions, Control Flow & Looping, Collections & Strings, Functions & Modules, File Handling & Data Analysis, DSA using Python
  24. Full Length Mock Tests — General Paper:
  25. Full Length Mock Tests — Computer Science (Paper II):
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This video is a comprehensive tutorial on counting squares in a grid, presented as a lecture. The instructor begins by introducing the topic with a title slide and then demonstrates a method for counting squares in a 4x4 grid by systematically summing the squares of different sizes: 4x4, 3x3, 2x2, and 1x1. He explains that the total number of squares is the sum of the squares of the first n natural numbers, where n is the number of rows or columns. The formula 1² + 2² + 3² + ... + n² = n(n+1)(2n+1)/6 is derived and applied to a 4x4 grid, yielding a total of 30 squares. The lecture then transitions to a more complex problem involving a 50x50 grid, where the same formula is used to calculate the total number of squares. The instructor also demonstrates a different type of grid, a 4x4 grid with overlapping squares, and applies the same counting method. The video concludes with a final summary of the key concepts and a 'Thanks for Watching' screen.

Chapters

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

    The video opens with a title slide that reads "SQUARE COUNTING TRICKS". The instructor, a man in a grey polo shirt, stands in front of a whiteboard and begins his lecture. He introduces the topic of counting squares in a grid, explaining that the number of squares can be found by summing the squares of the first n natural numbers, where n is the number of rows or columns. He mentions that this is a common question in competitive exams like the CAT and other national qualifier tests.

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

    The instructor draws a 4x4 grid on the whiteboard. He explains the method for counting squares by considering different sizes. He writes the numbers 1, 2, 3, 4 along the top and left side of the grid to represent the row and column indices. He then begins to count the squares of each size: 4x4, 3x3, 2x2, and 1x1. He explains that there is 1 square of size 4x4, 4 squares of size 3x3, 9 squares of size 2x2, and 16 squares of size 1x1. He writes the calculation 1 + 4 + 9 + 16 = 30 on the board.

  3. 5:00 – 10:00 05:00-10:00

    The instructor explains the formula for the sum of squares of the first n natural numbers: 1² + 2² + 3² + ... + n² = n(n+1)(2n+1)/6. He writes this formula on the whiteboard and explains that it can be used to quickly calculate the total number of squares in an n x n grid. He applies the formula to the 4x4 grid, substituting n=4, and calculates 4(4+1)(2*4+1)/6 = 4*5*9/6 = 30. He then moves on to a more complex problem involving a 50x50 grid, where he applies the same formula to calculate the total number of squares.

  4. 10:00 – 15:00 10:00-15:00

    The instructor draws a different type of grid on the whiteboard, a 4x4 grid with overlapping squares. He explains that the same method can be used to count the squares in this grid. He counts the squares of each size: 4x4, 3x3, 2x2, and 1x1. He writes the calculation 1 + 4 + 9 + 16 = 30 on the board. He then explains that the total number of squares in a 4x4 grid is 30, regardless of the arrangement of the squares.

  5. 15:00 – 20:00 15:00-20:00

    The instructor draws a 4x4 grid on the whiteboard and explains that the total number of squares in a 4x4 grid is 30. He then draws a 50x50 grid and applies the formula 1² + 2² + 3² + ... + n² = n(n+1)(2n+1)/6 to calculate the total number of squares. He substitutes n=50 into the formula and calculates 50(50+1)(2*50+1)/6 = 50*51*101/6 = 42925. He explains that the total number of squares in a 50x50 grid is 42925.

  6. 20:00 – 25:00 20:00-25:00

    The instructor draws a 4x4 grid on the whiteboard and explains that the total number of squares in a 4x4 grid is 30. He then draws a 50x50 grid and applies the formula 1² + 2² + 3² + ... + n² = n(n+1)(2n+1)/6 to calculate the total number of squares. He substitutes n=50 into the formula and calculates 50(50+1)(2*50+1)/6 = 50*51*101/6 = 42925. He explains that the total number of squares in a 50x50 grid is 42925.

  7. 25:00 – 25:28 25:00-25:28

    The video ends with a 'Thanks for Watching' screen. The screen has a blue background with a network of lines and dots. The text 'THANKS FOR WATCHING' is displayed in white capital letters in the center of the screen.

The video provides a clear and structured lesson on counting squares in a grid. It begins with a simple 4x4 grid, demonstrating the method of counting squares of different sizes and then introduces the mathematical formula for the sum of squares. The instructor then applies this formula to a larger 50x50 grid, showing how the method scales. The video also covers a more complex grid with overlapping squares, reinforcing the concept. The progression from a simple example to a more complex one, and the clear explanation of the formula, make the lesson effective for students preparing for competitive exams.

Loading lesson…