Size of an Array
Duration: 5 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- Quantitative Aptitude and Math: Ratio and Proportion (Ratios), Divisibility Rules, Data Interpretation, Permutation and Combination, Logarithm, Number System, HCF LCM, Sequence and Series (Series), Speed Time and Distance, Algebra, Powers and Exponents (Surds and Indices), Arithmetic, Mensuration and Geometry, Statistics, Probability, Percentage, Profit and Loss, Simple Interest and Compound Interest, Time and Work, Average, Calculus, Trigonometry, Vectors, Linear Algebra
- Logical and Analytical Reasoning: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Analogy, Verbal Analogy (Word Based Analogy), Directions (Direction Test), Blood Relations, Ranking, Order and Sequence, Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Seating Arrangements, Puzzle Solving (Puzzles), Cubes & Dices, Analytical Reasoning (Counting Figures Reasoning)
- English Language & Comprehension: Vocabulary, Subject Verb Agreement (Verb Noun Agreement), Tenses, Verb, Articles, Preposition, Pronoun, Conjunction, Sentence Correction (Error Correction), Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Completion (Fill in the blanks), Sentence Construction, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Cloze Test (Cloze Passage)
- Computer Architecture: Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Register Transfer and Microoperations, Multiprocessors, Programming the Basic Computer
- Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
- Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Windows OS, Linux OS, Security, Distributed Systems, Virtual Machines
- 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, TL: Congestion & UDP, Application Layer, Hardware basics, Network Security, Cyber and Info Security
- Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
- Algorithms: Algorithm Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Time Complexity Analysis, Advanced Algorithms
- Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
- DBMS: 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, Database Recovery, ORDBMS, Database Security & Authorization, Query Processing & Optimization, Enhanced Data Models, Data Warehousing & Mining, Big Data Systems, NoSQL
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
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: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.
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.

