Practice Question
Duration: 3 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- Prelims: General Knowledge: Physics Chemistry Biology History Geography Polity Indian Economy Static General Knowledge GK- Current Affairs Environment
- Prelims: General English: Vocabulary Noun Pronoun Adjectives Preposition Articles Direct and Indirect Speech Tenses Conjunction Subject Verb Agreement (Verb Noun Agreement) Modals Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing) Sentence Correction (Error Correction) Sentence Completion (Fill in the blanks) Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions) Cloze Test (Cloze Passage) Verbal Analogy (Word Based Analogy) Sentence Construction Adverb Verb
- Prelims: Quantitative Aptitude: Percentage Ratio and Proportion (Ratios) HCF LCM Divisibility Rules Average Sequence and Series (Series) Number System Powers and Exponents (Surds and Indices) Algebra Profit and Loss Simple Interest and Compound Interest Time and Work Pipe and Cistern Speed Time and Distance Mixture and Alligation Mensuration and Geometry Age Problems Partnership Statistics Data Interpretation Arithmetic
- Prelims: General Agriculture: Agriculture in India and Tripura Natural Resource Management Fundamentals of Crop Production Horticulture Crop Improvement Crop Protection Social Science
- IT Mains: Operating System: Introduction to OS Process Management CPU Scheduling Process Synchronization Threads & Process Creation Deadlock Memory Management Virtual Memory Disc Scheduling File Management Distributed Systems
- IT Mains: Computer Networking: Introduction to CN DLL: Access Control DLL: Flow Control DLL: Error Control 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 Network Security
- IT Mains: DBMS: Basics of DBMS ER Diagram Relational Model & Functional Dependencies Keys & Integrity Constraints Normalization (1NF - BCNF) Decomposition Properties & 4NF Relational Algebra SQL Relational Calculus Transaction Management Concurrency Control Database Recovery Big Data Systems Database Security & Authorization Enhanced Data Models NoSQL
- IT Mains: Software Engineering: Fundamentals of Software Engineering Software Requirements and Quality Assurance Software Design, Estimation and Metrics Software Testing Software Maintenance and Configuration Management
- IT Mains: Data Structures & Algorithms: Introduction to DS Array Stack Queue Linked List Tree Graphs Hashing Algorithm Analysis Time Complexity Analysis Sorting Algorithms
- IT Mains: OOPS with C++ & Java: C Fundamentals OOPS with C++ Java Fundamentals Array, String, IO & References OOPS with Java Generic & Collections Multithreading File Handling & I/O
- IT Mains: Python: Introduction to Python Tokens, Variables, Data Types, I/O Operators & Expressions Control Flow & Looping Collections & Strings Functions & Modules
- IT Mains: Website Development: Website, Browser & Services Internet Fundamentals Web Design & Development Protocols & Services Web Publishing & Hosting Server Side & Security Emerging Technologies HTML Basics HTML5 CSS JavaScript-Basics .Net Programming PHP
- IT Mains: Mobile App Development: Mobile Computing Multimedia
- IT Mains: Linux / Windows Server Admin: Unix OS Linux OS
AI summary & chapters
AI Summary
An AI-generated summary of this video lecture.
This educational video demonstrates how to calculate the memory address of a specific element within a two-dimensional array using the Row Major Order storage scheme. The instructor presents a specific problem where the array A has non-standard indexing ranges: rows from 5 to 15 and columns from -8 to 8. The total dimensions are given as A[11][17]. The problem asks for the address of element A[8][5]. Essential parameters are provided: a Base Address of 800 and an element size of 4 memory cells. The lecture walks through the derivation of the address calculation formula and applies it to solve the numerical problem, highlighting the handling of negative lower bounds.
Chapters
0:00 – 2:00 00:00-02:00
The session begins with the problem statement displayed on screen: Q A[5.....15, -8.....8] is A[11][17] and we are supposed to find A[8][5]. The instructor identifies the given values: Row Major Order, Base Address = 800, and element size w = 4. He writes the general formula for Row Major Order on the board: A[i, j] = B + w * [(i - li) (ul - ll + 1) + (j - lj)]. He explicitly defines the lower and upper limits for rows (li=5, ui=15) and columns (lj=-8, uj=8). He notes that the term (ul - ll + 1) represents the total number of columns, which is 17. He sets up the substitution for the target element A[8][5], identifying i=8 and j=5.
2:00 – 3:14 02:00-03:14
The instructor performs the arithmetic substitution. He writes 800 + 4 * [(8 - 5) * 17 + (5 - (-8))]. He calculates the row difference (8 - 5) as 3. He calculates the column difference (5 - (-8)) as 13. He multiplies the row difference by the column count: 3 * 17 = 51. He adds the column difference to this product: 51 + 13 = 64. This sum represents the total number of elements skipped. He multiplies this by the element size: 4 * 64 = 256. Finally, he adds this offset to the base address: 800 + 256, resulting in the final address 1056.
The video provides a clear, step-by-step guide to memory address calculation for 2D arrays. It emphasizes the formula's structure, particularly how the row index is weighted by the total column count. The example with negative lower bounds serves as a practical test of understanding the (index - lower_limit) component of the formula. The final calculation confirms the address is 1056, reinforcing the method for handling non-zero-based indexing in programming and data structures.

