2D Array Column Major Implementation

Duration: 5 min

This video lesson is available to enrolled students.

Return to /learn/TPSC-ASSISTANT-TECHNICAL-OFFICER/data-structures-and-programming/array/1d-2d-addressing/asset-2d-array-column-major-implementation after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. Paper 2 | Digital Logic: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Floating Point Rep
  3. Paper 2 | Computer Organization And Architecture: Basics of COA, Cache Memory Organization, Input Output Organisation, Pipelining, Control Unit Design, Instr Formats & Modes, Programming the Basic Computer
  4. Paper 2 | Analog And Digital Communication: Introduction to Communication Systems & Random Signals, Analog Communication Systems, Information Theory & Digital Communication Fundamentals, Digital Modulation & Detection Techniques, Error Control, Synchronization & Multiple Access Techniques
  5. Paper 2 | Programming in C: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  6. Paper 2 | Data Structures And Programming: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Java, OOPS with C++, Java Fundamentals, Array, String, IO & References
  7. Paper 2 | Algorithms: Algorithm Analysis, Sorting Algorithms, Time Complexity Analysis, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
  8. Paper 2 | 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
  9. Paper 2 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management, Unix OS, Linux OS
  10. Paper 2 | Databases: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, Relational Algebra, SQL, Relational Calculus, File Organization & Indexing, Transaction Management, Concurrency Control
  11. Paper 2 | Information Systems and Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  12. Paper 2 | 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, Hardware Basics
  13. Paper 2 | Internet & Web Technologies: Website, Browser & Services, Internet Fundamentals, Web Design & Development, Protocols & Services, Web Publishing & Hosting, Server Side & Security, Emerging Technologies, HTML Basics, JavaScript-Basics, CSS, XML, HTML5
  14. Paper 2 | Cyber Security And Emerging Technologies: Emerging Tech Trends
  15. Paper 2 | Cloud Technology: Cloud Computing
  16. Paper 2 | Probability and statistics: Probability, Statistics
  17. Paper-1 English: Vocabulary, Preposition, Articles, Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Correction (Error Correction), Sentence Completion (Fill in the blanks), Cloze Test (Cloze Passage), Sentence Construction
  18. Paper 1 General Mental Ability & Logical reasoning: Ratio and Proportion (Ratios), Divisibility Rules, Data Interpretation, Mixture and Alligation, Permutation and Combination, 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, Average, Powers and Exponents (Surds and Indices), Algebra, Profit and Loss, Simple Interest and Compound Interest, Time and Work, Pipe and Cistern, Mensuration and Geometry, Mental Ability, Age Problems, Partnership, Arithmetic, Speed Mathematics and Basic Mathematics, 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, Analogy
  19. Paper-1 General Knowledge & Current Affairs: State Wise GK, History, Geography, GK- Current Affairs, Static General Knowledge
  20. Full Length Mock Test:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

The video lecture explains the Column Major implementation of 2D arrays in computer memory. It begins by defining the storage order where elements are arranged sequentially column by column. The instructor uses a visual 3x3 matrix example to demonstrate how memory locations are allocated, starting with the first column, followed by the second, and so on. The second half of the lecture focuses on deriving the mathematical formula to calculate the memory address of any specific element a[i][j] within this storage scheme. Key variables such as base address, element size, and row/column bounds are defined to construct the final address calculation equation. This dual approach of visualization and formula derivation provides a comprehensive understanding of the topic.

Chapters

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

    The instructor introduces the concept of Column Major order using a 3x3 matrix labeled with indices from 0,0 to 2,2. He visually demonstrates the storage sequence by highlighting the first column (0,0, 1,0, 2,0) in red, the second column (0,1, 1,1, 2,1) in green, and the third column (0,2, 1,2, 2,2) in blue. He draws red diagonal lines through the columns to emphasize that the entire first column is stored first, followed by the second, and then the third. This visual aid corresponds to the linear memory layout shown below the matrix, where the sequence is 0,0, 1,0, 2,0, 0,1, 1,1, 2,1, 0,2, 1,2, 2,2. The instructor explicitly states that elements of the first column occupy the first set of memory locations, the second column occupies the next set, and so on.

  2. 2:00 – 4:45 02:00-04:45

    The lecture transitions to deriving the address calculation formula. The instructor defines variables on the screen: B for Base address, W for Size of each element, L1 and U1 for Lower and Upper bounds of rows, and L2 and U2 for Lower and Upper bounds of columns. He draws a generic 4x4 grid to generalize the concept beyond the 3x3 example. He writes the formula Address of a[i][j] = B + W * [(j - L2) * (U1 - L1 + 1) + (i - L1)] on the whiteboard. He breaks down the formula components, explaining that (U1 - L1 + 1) represents the total number of rows, (j - L2) is the number of columns preceding the current column, and (i - L1) accounts for the elements before the target in the current column. He emphasizes that the term (j - L2) * (U1 - L1 + 1) calculates the total elements in all previous columns.

The video effectively bridges the gap between conceptual understanding and mathematical application. By first visualizing the storage order with a concrete 3x3 example, the instructor makes the abstract concept of column-major storage tangible. He then systematically derives the address formula, defining every variable clearly. This progression ensures students understand not just how the data is stored, but how to calculate the exact memory location of any element, which is crucial for low-level programming and memory management tasks. The clear distinction between row-major and column-major logic is established through these visual and algebraic steps.

Loading lesson…