2D Array Column Major Implementation
Duration: 5 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- Quantitative Aptitude and Math: Ratio and Proportion (Ratios), Divisibility Rules, Data Interpretation, Permutation and Combination, Logarithm, Number System, HCF LCM, Sequence and Series (Series), Speed Time and Distance, Algebra, Powers and Exponents (Surds and Indices), Arithmetic, Mensuration and Geometry, Statistics, Probability, Percentage, Profit and Loss, Simple Interest and Compound Interest, Time and Work, Average, Calculus, Trigonometry, Vectors, Linear Algebra
- Logical and Analytical Reasoning: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Analogy, Verbal Analogy (Word Based Analogy), Directions (Direction Test), Blood Relations, Ranking, Order and Sequence, Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Seating Arrangements, Puzzle Solving (Puzzles), Cubes & Dices, Analytical Reasoning (Counting Figures Reasoning)
- English Language & Comprehension: Vocabulary, Subject Verb Agreement (Verb Noun Agreement), Tenses, Verb, Articles, Preposition, Pronoun, Conjunction, Sentence Correction (Error Correction), Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Completion (Fill in the blanks), Sentence Construction, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Cloze Test (Cloze Passage)
- Computer Architecture: Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Register Transfer and Microoperations, Multiprocessors, Programming the Basic Computer
- Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
- Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Windows OS, Linux OS, Security, Distributed Systems, Virtual Machines
- 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, TL: Congestion & UDP, Application Layer, Hardware basics, Network Security, Cyber and Info Security
- 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, Advanced Algorithms
- Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
- 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, Database Recovery, ORDBMS, Database Security & Authorization, Query Processing & Optimization, Enhanced Data Models, Data Warehousing & Mining, Big Data Systems, NoSQL
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
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: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.

