ADDRESS CALCULATION IN 1D & 2D ARRAY | DATA STRUCTURE | L02 | MANOJ KUMAR | AKGEC

ADDRESS CALCULATION IN 1D & 2D ARRAY | DATA STRUCTURE | L02 | MANOJ KUMAR | AKGEC

Title history
  • ADDRESS CALCULATION IN 1D & 2D ARRAY | DATA STRUCTURE | L02 | MANOJ KUMAR | AKGEC — observed on 20261103-1138 UTC (YouTube)

by Manoj Kumar · View the channel on PSI

Formal & Physical Sciences Computing & Cybersecurity UMComputer programmingUMBAlgorithms and data structures
🎙 Manoj Kumar 👥 23K 📅 November 2, 2026 ⏱ 18 min 👁 25 📄 tutorial 🧭 2026-11-03
Available in: English (current) Français

Keywords

1D array2D arraybase addressrow-majorcolumn-major

Summary

This lecture from AKGEC Digital School explains how to compute the memory address of elements in one-dimensional and two-dimensional arrays. Starting with 1D arrays, the presenter derives the formula Address of A[i] = Base + (i - LB) * W, where LB is the lower bound and W is the element size in bytes. Two examples are solved, including one with a non-zero lower bound. The second half covers 2D arrays, distinguishing between row-major and column-major storage orders. For row-major, the address formula is Base + (I - LR) * N + (J - LC) * W, where N is the number of columns. For column-major, it becomes Base + (J - LC) * M + (I - LR) * W, with M being the number of rows. Detailed numerical problems illustrate both methods, including cases with negative lower bounds. The lecture ends by indicating that 3D arrays will be discussed in the next session.

155 words

Critical Evaluation

Value of the Information & Strength of the Argument

The value of this lecture lies in its clear, methodical presentation of a fundamental topic in computer science. The instructor systematically introduces each formula, explains the meaning of every symbol, and applies it to concrete numerical examples. The argumentation is solid: the step-by-step calculations are transparent, and the reasoning behind row-major versus column-major storage is explained intuitively. While the content is basic, it fulfills its educational purpose effectively, making it a useful resource for students learning data structures.

Scientific Rigor, Source Quality, Title Accuracy

The scientific rigor is appropriate for an introductory tutorial. The presenter uses standard, well-known formulas that are consistent with typical data structures curricula. No external sources are cited beyond the institutional website (akgec.ac.in), which is expected for a lecture video. The title accurately describes the content, and the examples are properly solved. The lecture does not introduce any novel research but rather consolidates established knowledge in an accessible manner.

162 words

Title / Content Match

The title accurately reflects the content; the video thoroughly covers address calculation for 1D and 2D arrays.

Quality & Reliability

8/10

The lecture presents standard formulas for array address calculation with clear numerical examples. No contradictory or erroneous statements were identified, and the methodology aligns with common data structures textbooks.

Key Moments

Markers derived by PSI from the transcript: the creator did not define chapters.

Cited Sources

  • AKGEC Official Website — Institutional website of Ajay Kumar Garg Engineering College, referenced in the video description.

Contribution & Novelties

This video is an educational tutorial that clearly explains the formulas for calculating memory addresses of array elements, including the distinction between row-major and column-major orders for 2D arrays. Its contribution is primarily pedagogical, offering a step-by-step approach with worked examples that reinforce understanding. It does not introduce new research but serves as a solid foundation for students.

Pour aller plus loin :

98 words

Radar Profile

The scores indicate a balanced profile: quantity of information is moderate (7), quality is high (8), technical level is moderate (7), and global reliability is high (8). This suggests a focused, well-presented tutorial suitable for beginners.

Reliability 8/10