One Dimensional Array Access Formula

Duration: 5 min

This video lesson is available to enrolled students.

Return to /learn/BIHAR-POLYTECHNIC-LECTURER-COMPUTER-SCIENCE/paper-1-data-structures/array/1d-2d-addressing/asset-one-dimensional-array-access-formula after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. Discrete Mathematics: Permutation, Combination and Probability / क्रमचय, संचय एवं प्रायिकता, Set Theory, Relations, Functions, Propositional and Predicate Logic, Graph Theory, Group Theory
  2. Digital Logic: Digital Systems & Boolean Basics, Boolean Expression, Boolean Minimization, Logic Gates & Hardware, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Floating Point Rep
  3. Computer Organization and Architecture: Basics of COA, Programming the Basic Computer, Cache Memory Organization, Input Output Organisation, Instr Formats & Modes, Register Transfer and Microoperations, Control Unit Design, Pipelining, Multiprocessors
  4. Programming: Language Design, C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling, OOPS with C++
  5. Data Structures: Introduction to DS, Array, Linked List, Stack, Queue, Tree, Graphs, Hashing
  6. Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Advanced Algorithms
  7. Theory of Computation: Grammar, Regular Language Properties, Moore & Mealy Machines, Turing Machines
  8. 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, Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Pushdown Automata & CFG, Complexity Theory
  9. Operating Systems: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management, Unix OS, Linux OS, Security
  10. Database Management Systems: 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, ORDBMS, NoSQL
  11. 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, Transport Layer Services, TL: Congestion & UDP, Application Layer, Hardware basics, Network Security
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This lecture introduces the memory address calculation formula for one-dimensional arrays. The instructor begins by presenting a slide titled 'One Dimensional array' with the prompt 'Address of the element at kth index' and an incomplete formula 'a[k] ='. A visual array diagram is constructed at the bottom of the slide, showing a row of boxes with red handwritten addresses 100, 104, 108, 112, 116, 120, and 124 below them, and red index numbers 0 through 7 above. The instructor then derives the general formula step-by-step: a[k] = B + W * (k - Lower bound). The variables are defined as B for the base address, W for the size of each element, k for the target index, and Lower bound for the starting index. A worked example uses B=100, W=4, and k=6 to calculate the address as 100 + 4 * (6 - 0) = 124, which matches the diagram. The final slide summarizes the formula and variable definitions for reference.

Chapters

  1. 0:00 – 2:00 00:00-02:00

    The instructor introduces the concept of calculating memory addresses in a one-dimensional array. The slide displays 'One Dimensional array' and 'Address of the element at kth index' with the prompt 'a[k] ='. A row of array boxes is drawn at the bottom, labeled with red handwritten addresses 100, 104, 108, and 112. The instructor writes '100' below the first cell to establish the base address, then extends the addresses across the boxes to 124 and adds red index numbers 0 through 7 above them.

  2. 2:00 – 4:45 02:00-04:45

    The instructor derives the formula a[k] = B + W * (k - Lower bound) by building it incrementally. The base address 'B' is written first, followed by the element size 'W', and finally the offset term '[k - L]'. A red cross marks index 6 in the diagram for the example k=6. The instructor substitutes B=100, W=4, and K=6 into the formula, calculating 100 + 4 * (6 - 0) = 124, which matches the diagram. A final slide summarizes the general formula and defines B as base address, W as element size, K as index, and Lower bound as the first element's index.

The lesson progresses from a concrete visual example to an abstract formula. The array diagram with addresses 100-124 and indices 0-7 provides the numerical foundation. The formula a[k] = B + W * (k - Lower bound) is derived by identifying each component: base address, element size, and index offset. The worked example (k=6 yielding 124) verifies the formula against the diagram. The lower bound term accounts for arrays not starting at zero, making the formula general.

Loading lesson…