Size of an Array

Duration: 5 min

This video lesson is available to enrolled students.

Return to /learn/BIHAR-STET-COMPUTER-SCIENCE-COMPLETE-COURSE/unit-3-data-structures/array/array-basics-ops/asset-size-of-an-array after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About the course: About the Course
  2. Mathematical Aptitude: Number System, HCF LCM, Divisibility Rules, Percentage, Ratio and Proportion (Ratios), Average, Profit and Loss, Time and Work, Mensuration and Geometry, Simple Interest and Compound Interest, Speed Time and Distance, Age Problems, Mixture and Alligation, Algebra, Powers and Exponents (Surds and Indices), Pipe and Cistern, Trigonometry, Statistics, Data Interpretation, Arithmetic
  3. Logical Reasoning: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Analogy, Blood Relations, Directions (Direction Test), Ranking, Order and Sequence, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Seating Arrangements, Syllogisms, Venn Diagram, Puzzle Solving (Puzzles), Logical Sequence Of Words, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Analytical Reasoning (Counting Figures Reasoning), Cubes & Dices, Calendar, Clock
  4. General Knowledge: Physics, Chemistry, Biology, History, Geography, Polity, Indian Economy, GK- Current Affairs, Static General Knowledge
  5. Art of Teaching: Nature, Objectives & Characteristics of Teaching, Learners & Learning Process, Factors Affecting Teaching, Methods of Teaching, Classroom Management & Communication, Teaching-Learning Aids & ICT Integration, Evaluation, Assessment & Measurement, Professional Development & Ethics, Policies, Acts & Contemporary Issues, Curriculum & School Environment, Guidance, Counselling & Mental Health, Inclusive Education & Special Needs, Micro-Teaching & Teaching Skills, Lesson Planning
  6. Environmental Science: Environment
  7. Unit 1 | Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
  8. Unit 2 | COA: Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Instr Formats & Modes, Control Unit Design, Register Transfer and Microoperations, Programming the Basic Computer
  9. Unit 3 | C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  10. Unit 3 | Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  11. Unit 4 | Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Advanced Algorithms
  12. Unit 5 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management
  13. Unit 6 | Database Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, File Organization & Indexing, Relational Algebra, SQL, Transaction Management, Concurrency Control
  14. Unit 7 | 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
  15. Unit 8 | Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  16. Unit 9 | Object Oriented Programming: OOPS with C++
  17. Unit 10 | Web Development: HTML Basics, CSS, JavaScript-Basics, XML
  18. Unit 11 | 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
  19. Unit 12 | IoT: Emerging Tech Trends, Cloud Computing
  20. Unit 13 | Artificial Intelligence: Approaches to AI, Search Algorithms, Game Playing, Knowledge Representation, Natural Language Processing, Artificial Neural Networks, Genetic Algorithms
  21. Unit 14 | E-Commerce: Electronic Data Interchange and E-Commerce, Role of Internet and Web Services, Security in Mobile and Wireless Computing, Physical Security and Cryptography Basics, Cyber Safety and Security
  22. Unit 15 | Multimedia: Multimedia
  23. Unit 16 | Python: Introduction to Python, Tokens, Variables, Data Types, I/O, Operators & Expressions, Control Flow & Looping, Collections & Strings, Functions & Modules, File Handling & Data Analysis, DSA using Python
  24. Full Length Mock Tests — General Paper:
  25. Full Length Mock Tests — Computer Science (Paper II):
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…