Practice Question

Duration: 3 min

This video lesson is available to enrolled students.

Return to /learn/RSSB-BASIC-COMPUTER-INSTRUCTOR/paper-2-data-structures/array/1d-2d-addressing/asset-practice-question-4437 after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About the Course: About the Course
  2. Paper-1 & 2 | Basic Numeracy: Ratio and Proportion (Ratios), Divisibility Rules, Mixture and Alligation, Permutation and Combination, Logarithm, Number System, HCF LCM, Sequence and Series (Series), Speed Time and Distance, Percentage, Average, Mensuration and Geometry, Age Problems, Arithmetic, Statistics, Probability, Profit and Loss, Simple Interest and Compound Interest, Partnership, Speed Mathematics and Basic Mathematics, Algebra, Powers and Exponents (Surds and Indices), Time and Work, Pipe and Cistern, RSSB Specific Videos - Basic Numeracy
  3. Paper-1 & 2 | Data Interpretation: Data Interpretation
  4. Paper-1 & 2 | General Mental Ability: Mental Ability, RSSB Specific Videos - Mental Ability
  5. Paper-1 & 2 | Logical Reasoning and Analytical Ability: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Syllogisms, Seating Arrangements, Blood Relations, Directions (Direction Test), Analytical Reasoning (Counting Figures Reasoning), Puzzle Solving (Puzzles), Calendar, Clock, Cubes & Dices, Venn Diagram, Analogy, Ranking, Order and Sequence, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Data Arrangement, Logical Sequence Of Words, Crypt Arithmetic
  6. Paper-1 & 2 | Decision Making and Problem Solving: Selection Decision Table (Decision Making)
  7. Paper-1 | General Science: Physics, Biology, Chemistry, RSSB Specific Videos
  8. Paper-1 | General Awareness: State Wise GK, GK- Current Affairs
  9. Paper - 2 | Digital Logic Systems: Digital Systems & Boolean Basics, Logic Gates & Hardware, Combinational Circuit, Sequential Circuits
  10. Paper-2 | Database Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, Relational Calculus, Relational Algebra, SQL, NoSQL
  11. Paper-2 | Data Structures & Algorithms: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Algorithm Analysis, Sorting Algorithms, Intro to Compilers, Hashing
  12. Paper 2 | Data Communication and Network Security: Introduction to CN, Data Communication, Data Link Layer - Ethernet, DLL: Error Control, Net Layer: IPv4 & Proto, Net Layer: IP Addressing, Application Layer, Hardware basics, Network Security, Ethical Hacking
  13. Paper-2 | Operating Systems: Introduction to OS, Process Management, Memory Management, File Management, Deadlock
  14. Paper-2 | Computer Organization and Architecture: 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, Number System, Number Representation
  15. Paper 2 | System Analysis and Design: Fundamentals of Systems and Information Systems, Fundamentals of Software Engineering, SDLC and Development Approaches, Software Documentation and Software Requirements Specification (SRS), SDD and Quality Assurance, Security, Risk Management & Maintenance, Software Testing
  16. Paper-2 | C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  17. Paper 2 | OOPS , C++ , JAVA: Language Design, OOPS with C++, Java, .Net Programming, Java Fundamentals
  18. 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
  19. Emerging Trends and AI: Emerging Tech Trends, Artificial Intelligence
  20. Paper-2 | Data Processing (Ms-Office): MS Office Applications
  21. Paper-2 | Internet and Web Technologies: HTML Basics, CSS, XML, JavaScript-Basics, Internet Fundamentals, Protocols & Services, Web Publishing & Hosting, Server Side & Security, Emerging Technologies, Terms & Abbreviations, Cyber Threats and Malware Attacks, Role of Internet and Web Services, Security in Mobile and Wireless Computing
  22. Paper 2 | Pedagogy: Child Development, Theories, Concept of Pedagogy, Inclusive Education, Experiential Pedagogy, Assessment & Evaluation, Psychology, Curriculum Framework & Reforms, National Education Policy (NEP) 2020
  23. Live Classes: RSSB Live Sessions
  24. Paper 1 - Full Mock Tests:
  25. Paper 2 - Full Mock Tests:
  26. BCI Previous Year Papers:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This educational video demonstrates how to calculate the memory address of a specific element within a two-dimensional array using the Row Major Order storage scheme. The instructor presents a specific problem where the array A has non-standard indexing ranges: rows from 5 to 15 and columns from -8 to 8. The total dimensions are given as A[11][17]. The problem asks for the address of element A[8][5]. Essential parameters are provided: a Base Address of 800 and an element size of 4 memory cells. The lecture walks through the derivation of the address calculation formula and applies it to solve the numerical problem, highlighting the handling of negative lower bounds.

Chapters

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

    The session begins with the problem statement displayed on screen: Q A[5.....15, -8.....8] is A[11][17] and we are supposed to find A[8][5]. The instructor identifies the given values: Row Major Order, Base Address = 800, and element size w = 4. He writes the general formula for Row Major Order on the board: A[i, j] = B + w * [(i - li) (ul - ll + 1) + (j - lj)]. He explicitly defines the lower and upper limits for rows (li=5, ui=15) and columns (lj=-8, uj=8). He notes that the term (ul - ll + 1) represents the total number of columns, which is 17. He sets up the substitution for the target element A[8][5], identifying i=8 and j=5.

  2. 2:00 – 3:14 02:00-03:14

    The instructor performs the arithmetic substitution. He writes 800 + 4 * [(8 - 5) * 17 + (5 - (-8))]. He calculates the row difference (8 - 5) as 3. He calculates the column difference (5 - (-8)) as 13. He multiplies the row difference by the column count: 3 * 17 = 51. He adds the column difference to this product: 51 + 13 = 64. This sum represents the total number of elements skipped. He multiplies this by the element size: 4 * 64 = 256. Finally, he adds this offset to the base address: 800 + 256, resulting in the final address 1056.

The video provides a clear, step-by-step guide to memory address calculation for 2D arrays. It emphasizes the formula's structure, particularly how the row index is weighted by the total column count. The example with negative lower bounds serves as a practical test of understanding the (index - lower_limit) component of the formula. The final calculation confirms the address is 1056, reinforcing the method for handling non-zero-based indexing in programming and data structures.

Loading lesson…