Size of an Array

Duration: 5 min

This video lesson is available to enrolled students.

Return to /learn/MPPSC-ASSISTANT-PROFESSOR-COMPUTER-SCIENCE-PAPER-2/data-structure-and-algorithms/array/array-basics-ops/asset-size-of-an-array after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. Paper 1 | General Studies: State Wise GK
  3. Paper 1 | Information and Communication Technology: Role of Internet and Web Services, Security in Mobile and Wireless Computing
  4. Paper 1 | Current Affairs: GK- Current Affairs
  5. Paper 2 | Discrete Mathematical Structure: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic, Probability
  6. Paper 2 | Digital Computer Organization And Architecture: Number System, Number Representation, Sequential Circuits, Combinational Circuit, Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Register Transfer and Microoperations, Control Unit Design, Programming the Basic Computer
  7. Paper 2 | C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  8. Paper 2 | Programming Languages & Object-Oriented Programming Concepts: Java, OOPS with C++, Java Fundamentals, Array, String, IO & References
  9. Paper 2 | Python: Introduction to Python, Tokens, Variables, Data Types, I/O, Operators & Expressions, Control Flow & Looping, Collections & Strings, Functions & Modules, File Handling & Data Analysis
  10. Paper 2 | Data Structure And Algorithms: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Minimum Spanning Trees, Advanced Algorithms
  11. Paper 2 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Unix OS
  12. Paper 2 | Theory Of Computation: 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
  13. 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
  14. Paper 2 | Database Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, Relational Algebra, SQL, Transaction Management, Concurrency Control, Database Recovery, Database Security & Authorization, Enhanced Data Models
  15. Paper 2 | Computer Network And Information Security: Introduction to CN, Data Communication, Application Layer, Hardware basics, Cyber Threats and Malware Attacks, Network Security, 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
  16. Paper 2 | Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  17. Paper 2 | Current Trends & Technologies: Emerging Tech Trends, Approaches to AI, Search Algorithms, Game Playing, Knowledge Representation, Planning, Multi Agent Systems, Fuzzy Sets, Natural Language Processing, Artificial Neural Networks, Genetic Algorithms, Artificial Intelligence, Data Warehousing & Mining, Electronic Data Interchange and E-Commerce, Terms & Abbreviations
  18. Paper 2 | Full Length Mock Tests:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This lecture introduces how to calculate the size of an array using bounds and element byte sizes. It begins with the formula Number of elements = (Upper bound – Lower Bound) + 1, defining lower and upper bounds as the first and last indices. The instructor then uses a hand-drawn array diagram with indices 1 through 8, labeling LB at index 1 and UB at index 8, and substitutes values to show (8 - 1) + 1. Additional examples include zero-based indexing and negative indices, such as (2-0)+1=3 and (1-(-6))+1 = 7+1 = 8, demonstrating that the formula works regardless of indexing style. The lesson transitions to types of array indexing—zero-based, one-based, and n-based—and later returns to the size formula. Finally, it introduces memory size calculation using Size = number of elements * Size of each element in bytes, with a worked example showing 8 × 2B = 16B. A memory location table maps indices to stored letters, reinforcing how array elements occupy consecutive addresses.

Chapters

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

    The slide titled “Size of an array” displays the formula “Number of elements = (Upper bound – Lower Bound) + 1,” with bullets defining the lower bound as the index of the first element and the upper bound as the index of the last element. The instructor gestures with a pen while explaining, then draws a row of boxes to represent an array. Numbers 1 through 8 are written above the boxes, and arrows label the first index as LB and the last as UB. The instructor substitutes these values into the formula, showing (8 - 1) + 1 to calculate the number of elements.

  2. 2:00 – 5:00 02:00-05:00

    The instructor continues applying the size formula to different indexing schemes. A second example uses indices from 0 to -7, with calculations such as (2-0)+1=3 and (1-(-6))+1 = 7+1 = 8, illustrating that negative bounds still yield the correct element count. The lecture then shows a slide titled “Types of indexing in array:” listing zero-based, one-based, and n-based indexing, with red underlines emphasizing the options. Returning to the “Size of an array” slide, the instructor writes 8 - 1 + 1 above the formula and reinforces the LB/UB diagram. A cartoon appears with a doctor saying “Array Index starts from 1,” humorously reinforcing one-based indexing.

  3. 5:00 – 5:18 05:00-05:18

    The final section shifts to calculating total memory size using the formula “Size = number of elements * Size of each element in bytes.” A green table labeled “Memory Location” shows columns 200–206 containing letters U, B, F, D, A, E, C over indices 0–6. The instructor underlines “number of elements” and then the entire formula, followed by a red worked example: = 8 X 2B, then = 16B. This connects the earlier element-count formula to byte-level memory allocation for a one-dimensional array.

The lecture progresses from defining array bounds to applying the element-count formula across multiple indexing conventions, then extends to memory size calculation. The central idea is that array size in elements depends only on the difference between upper and lower bounds plus one, independent of whether indices are positive, negative, zero-based, or one-based. The instructor supports this with visual diagrams and step-by-step substitutions, ensuring students can identify LB and UB in any array representation. The final transition to byte size introduces the practical memory formula, linking logical element count to physical storage requirements. Key exam-relevant points include memorizing both formulas, recognizing indexing types, and interpreting memory location tables.

Loading lesson…