2D Array Row Major Implementation
Duration: 10 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- About Course: About the Course
- Paper 1 | Quantitative Aptitude: Percentage Ratio and Proportion (Ratios) Powers and Exponents (Surds and Indices) Logarithm Sequence and Series (Series) Mensuration and Geometry Data Interpretation Average Arithmetic Simplification and Approximation Algebra Sequences and Series Profit, Loss and Discount Percentages Number System Ratio and Proportion Averages, Mixtures and Alligation Permutations and Combinations Time and Work Vocabulary Subject-Verb Agreement Sentence Completion Geometry Reading Comprehension Powers, Surds and Logarithms Trigonometry Mensuration Speed, Time and Distance Patterns in Two-Dimensional Figures Probability Measurement and Quantity Take-Off Transformation of Shapes Three-Dimensional Patterns and Visualization Statistics Mathematical Operations Data Sufficiency Constraint Puzzles Data Interpretation Mixture and Alligation Speed Time and Distance HCF LCM Algebra Profit and Loss Venn Diagram
- Paper 1 | Logical Reasoning: Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning) Series (Number and Letter Series) (Numerical Relations and Reasoning) Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning) Analogy Cubes & Dices Syllogisms Numerical Reasoning Assembling and Grouping of Shapes Coding and Decoding Cubes and Dice Series Completion Alphabet and Word Tests Analogy and Classification Direction Sense Logical Deduction and Induction Order, Ranking and Sequence Critical Reasoning Syllogisms and Venn Diagrams Narrative Sequencing Project Monitoring, Resources and Safety Simple Interest and Compound Interest Coding Decoding Seating Arrangements
- Paper 1 | English Language: Vocabulary Noun Pronoun Verb Adjectives Adverb Preposition Conjunction Articles Tenses Subject Verb Agreement (Verb Noun Agreement) Modals Sentence Correction (Error Correction) Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions) Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing) Prepositions and Conjunctions Idioms and Phrases Verb Forms and Verb Patterns Sentence Basics, Nouns and Pronouns Adjectives and Adverbs Articles and Determiners Modals, Conditionals and Subjunctive Sentence Structure and Correction Voice and Reported Speech Tenses Vocabulary
- Paper 1 | Unit Tests:
- Paper 1 | Full-Length Mock Tests:
- Paper 2 | Engineering Mathematics: Set Theory Relations Functions Graph Theory Group Theory Propositional and Predicate Logic Linear Algebra Calculus Permutation and Combination Probability Statistics Signal Space and Optimum Detection Probability Statistics Combinatorics
- Paper 2 | Digital Logic: 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
- Paper 2 | 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
- Paper 2 | Programming and Data Structures: C Fundamentals Control Flow Functions Arrays & Pointers Storage Classes, Structures & Enums DMA, Macros, Scoping & File Handling Introduction to DS Array Stack Queue Linked List Tree Graphs Hashing
- Paper 2 | Algorithms: Algorithm Analysis Time Complexity Analysis Sorting Algorithms Greedy Algorithms Dynamic Programming Minimum Spanning Trees Shortest Path Algos
- Paper 2 | Theory Of Computation/Automata Theory: 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
- 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
- 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
- Paper 2 | DataBase Management System/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
- Paper 2 | 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 Hardware Basics
- Paper 2 | CS/IT Sectional Mock Tests:
- Complete Paper Full Mock Test:
AI summary & chapters
AI Summary
An AI-generated summary of this video lecture.
This educational video lecture provides a comprehensive overview of the implementation of two-dimensional arrays in computer memory. The session begins by defining the fundamental concepts of row-major and column-major orders, explaining how multidimensional arrays are stored in linear storage like random access memory. The instructor uses visual aids to illustrate the difference in memory contiguity between these methods. The lecture then transitions into a detailed examination of row-major implementation, demonstrating how elements are arranged sequentially row by row. Finally, the video culminates in a rigorous derivation of the address calculation formula for accessing elements in a 2D array, defining necessary variables such as base address and element size, and applying the formula to a specific example to calculate the memory address of a given element.
Chapters
0:00 – 2:00 00:00-02:00
The video opens with a slide titled 'Implementation of 2D array'. The instructor introduces the concepts of row-major and column-major order as methods for storing multidimensional arrays in linear storage. The slide text explicitly states that the difference between these orders lies in which elements of an array are contiguous in memory. A visual diagram of a 3x3 grid is displayed, labeling rows 0, 1, 2 and columns 0, 1, 2, with cells marked as x[0][0], x[0][1], etc., to represent the array structure. The instructor explains that these methods determine the physical layout of data in memory, setting the stage for understanding how 2D arrays are accessed computationally.
2:00 – 5:00 02:00-05:00
The focus shifts to 'Row Major implementation of 2D array'. A slide displays a 3x3 matrix containing numbers 1 through 9, color-coded by row: blue for the first row, pink for the second, and green for the third. An arrow points from this matrix to a linear array representation labeled 'row-major', showing the sequence 1, 2, 3, 4, 5, 6, 7, 8, 9. The instructor explains that in this method, elements are arranged sequentially row by row. He emphasizes that the elements of the first row occupy the first set of memory locations, followed by the second row, and so on. This visual mapping helps students understand how a 2D structure is flattened into a 1D memory space.
5:00 – 9:36 05:00-09:36
The instructor derives the formula for calculating the address of an element a[i][j]. He lists the variables: 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 grid on the board with row indices 0, 1, 2 and column indices 0, 1, 2, 3. He writes the formula: Address of a[i][j] = B + W * [(i - L1) * (U2 - L2 + 1) + (j - L2)]. He then substitutes values to calculate the address for a[2][2], showing the calculation steps like (2-0) and (3-0+1). This section provides the mathematical foundation for memory address calculation in row-major order.
The lecture effectively bridges the gap between abstract array concepts and concrete memory implementation. It starts by defining the storage orders, then visualizes the row-major layout using a numerical example, and finally provides the mathematical formula for address calculation. This progression ensures students understand not just the 'what' but also the 'how' of 2D array storage, equipping them with the necessary tools to solve problems related to memory addressing in programming and data structures.

