2D Array Row Major Implementation

Duration: 10 min

This video lesson is available to enrolled students.

Return to /learn/BPSC/data-structures/array/1d-2d-addressing/asset-2d-array-row-major-implementation after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About the Course: About the Course
  2. Section 1 | Language (Hindi): भाषा, लिपि, ध्वनि, वर्ण, अक्षर, स्वर, व्यंजन, मात्रा और संयुक्ताक्षर, वर्तनी, वर्ण-विन्यास, अनुस्वार, अनुनासिक, चंद्रबिंदु और ‘र’ के रूप, शब्द, पद और शब्द-भेद, संज्ञा और सर्वनाम, विशेषण और क्रिया, लिंग, वचन, पुरुष और कारक, काल, वाच्य, वाक्य और वाक्य-भेद, संधि, समास, विलोम शब्द, पर्यायवाची शब्द, सामान्य अशुद्धियाँ, अनेक शब्दों के लिए एक शब्द, मुहावरे और लोकोक्तियाँ, अपठित गद्यांश और अपठित पद्यांश, Multi-Topic Content (Cross-Concept Material), वर्णमाला
  3. Section 1 | Language (उर्दू भाषा — 22 प्रश्न (निश्चित)): Spelling & Diacritics, Grammar (اسم, فعل, صفت, ضمیر), Vocabulary, Idioms & Proverbs, Comprehension
  4. Section 1 | Language (বাংলা / बांग्ला भाषा — 22 प्रश्न (निश्चित)): Bangla Script and Sounds, Bangla Grammar and Usage, Bangla Word Formation and Vocabulary, Reading and Text Interpretation
  5. Section 1 | Language (English): Vocabulary, Noun, Subject Verb Agreement (Verb Noun Agreement), Adjectives, Tenses, Pronoun, Verb, Adverb, Preposition, Articles, Determiner, Conjunction, Modals, Active Passive Voice (Voice), Direct and Indirect Speech, Sentence Correction (Error Correction), Sentence Completion (Fill in the blanks), Sentence Construction, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Cloze Test (Cloze Passage), Verbal Analogy (Word Based Analogy), Facts, Inference and Judgements
  6. Section 2 | Primary Maths & Reasoning: Ratio and Proportion (Ratios), Divisibility Rules, Mixture and Alligation, Permutation and Combination, Number System, HCF LCM, Sequence and Series (Series), Speed Time and Distance, Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Percentage, Average, Profit and Loss, Simple Interest and Compound Interest, Time and Work, Mensuration and Geometry, Age Problems, Arithmetic, Powers and Exponents (Surds and Indices), Algebra, Probability, Trigonometry, Syllogisms, Seating Arrangements, Blood Relations, Directions (Direction Test), Analytical Reasoning (Counting Figures Reasoning), Puzzle Solving (Puzzles), Calendar, Clock, Cubes & Dices, Venn Diagram, Data Arrangement, Inequality, Analogy, Ranking, Order and Sequence
  7. Section 2 | General Awareness (GK + Current Affairs): Polity, Physics, Biology, State Wise GK, Chemistry, History, Geography, Indian Economy, Environment, GK- Current Affairs, Static General Knowledge
  8. Section 3 | Computer System and Org. (CSO): Basics of COA, Floating Point Rep, Cache Memory Organization, Instr Formats & Modes, Programming the Basic Computer, Input Output Organisation, Register Transfer and Microoperations, Control Unit Design
  9. Section 3 | Database Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, SQL, File Organization & Indexing, Relational Algebra, Relational Calculus, Transaction Management, Concurrency Control
  10. Section 3 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Process Synchronization
  11. Section 3 | Computer Networks: Introduction to CN, Data Communication, DLL: Access Control, DLL: Flow Control, DLL: Error Control, Data Link Layer - Ethernet, Net Layer: IPv4 & Proto, Net Layer: IP Addressing, Transport Layer Services, TL: Congestion & UDP, Application Layer, Hardware basics
  12. Section 3 | Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Minimum Spanning Trees, Shortest Path Algos
  13. Section 3 | Theory Of Computation & Compiler Design: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Grammar, Regular Language Properties, Moore & Mealy Machines, Pushdown Automata & CFG, Turing Machines, Intro to Compilers, Lexical Analysis, Grammar & CFG, Syntax Analysis: Top-Down, Syntax Analysis: Bottom-Up, Semantic Analysis & SDT, Intermediate Code Gen, Code Optimization
  14. Section 3 | Emerging Trends (AI, Societal Ethics & MS Office): Artificial Intelligence, Emerging Tech Trends, Society, Law & Ethics, MS Office Applications
  15. Section 3 | Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Maintenance and Configuration Management, Software Testing
  16. Section 3 | C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  17. Section 3 | OOPS, C++, JAVA, HTML: OOPS with C++, Java, HTML Basics, CSS
  18. Section 3 | Java: Java Fundamentals, Array, String, IO & References
  19. Section 3 | Python: Introduction to Python, Tokens, Variables, Data Types, I/O, Operators & Expressions, Control Flow & Looping, Collections & Strings, Functions & Modules, File Handling & Data Analysis
  20. Section 3 | Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
  21. Section 3 | Multimedia: Multimedia
  22. BPSC Previous Year Papers:
  23. BPSC Full Mock Tests:
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

  1. 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. 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.

  3. 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.

Loading lesson…