Address Operation - Substraction

Duration: 2 min

This video lesson is available to enrolled students.

Return to /learn/UP-LT-GRADE-ASSISTANT-TEACHER-2025/cs-04-problem-solving-through-c-programming/arrays-pointers/relationship-between-arrays-and-pointers/asset-address-operation-substraction after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. CS | 01 | Digital Logic and Circuits and Discrete Mathematical Structures: Digital Systems & Boolean Basics, Number System, Number Representation, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic, Permutation and Combination
  3. CS | 02 | Computer Organization and Architecture: Basics of COA, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Multiprocessors
  4. CS | 03 | Data Structures and Algorithm: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Complexity Theory, Advanced Algorithms
  5. CS | 04 | Problem Solving through C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  6. CS | 05 | Object Oriented Techniques: Object Oriented Technology, Java
  7. CS | 06 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management, Windows OS, Unix OS
  8. CS | 07 | Database Management Systems: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, Relational Algebra, SQL, Relational Calculus, Transaction Management, Concurrency Control, Database Recovery, Database Security & Authorization, Query Processing & Optimization, File Organization & Indexing
  9. CS | 08 | 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
  10. CS | 09 | Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  11. CS | 10 | Internet Technology, Web Design and Web Technology: Internet Fundamentals, Web Design & Development, Protocols & Services, Web Publishing & Hosting, Server Side & Security, Emerging Technologies, JavaScript-Basics, HTML Basics
  12. CS | 11 | System Analysis And Design: Fundamentals of Systems and Information Systems, SDLC and Development Approaches, Software Documentation and Software Requirements Specification (SRS), SDD and Quality Assurance, Security, Risk Management & Maintenance
  13. CS | 12 | Information Security and Cyber Laws: Cyber Threats and Malware Attacks, Role of Internet and Web Services, Security in Mobile and Wireless Computing, Electronic Data Interchange and E-Commerce, Physical Security and Cryptography Basics, Intrusion Detection Systems (IDS), Cyber Safety and Security
  14. CS | 13 | Computer Graphics: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing, 3-D Object Representation, Geometric Transformations and Viewing
  15. GS Paper | 01 | Indian and World Geography: Geography
  16. GS Paper | 02 | History: History
  17. GS Paper | 03 | Indian Economy & Social Development: Indian Economy
  18. GS Paper | 04 | General Science: Biology, Chemistry, Physics
  19. GS Paper | 05 | Elementary Maths: Number System, Divisibility Rules, HCF LCM, Percentage, Profit and Loss, Simple Interest and Compound Interest, Ratio and Proportion (Ratios), Average, Time and Work, Speed Time and Distance, Algebra, Mensuration and Geometry, Data Interpretation, Arithmetic, Statistics, Probability, Sequence and Series (Series), Mixture and Alligation, Calculus, Trigonometry, Vectors
  20. GS Paper | 06 | Indian Polity and Governance: Polity
  21. GS Paper | 07 | Current Events: GK- Current Affairs
  22. UPLT Live Classes Notes: UPLT Live Classes
  23. UPLT Full Mock Tests Tier 1:
  24. UPLT Full Mock Tests Tier 2:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This lecture segment introduces pointer subtraction in C programming, specifically focusing on subtracting a constant from an address. The instructor explains that when a constant is subtracted from a pointer, the pointer moves backward by multiples of its data type's size. The syntax `ptr = ptr - n;` is presented as the standard method for this operation. A concrete example uses an integer array `int arr[5] = {10, 20, 30, 40, 50};` where a pointer `p` is initialized to the fourth element (`&arr[3]`). By executing `p = p - 1;`, the pointer moves back one integer size to point to `arr[2]`. Visual aids include hand-drawn memory diagrams and on-screen text calculations showing address changes, such as moving from address 1006 to 1004 assuming a 2-byte integer size.

Chapters

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

    The video begins by defining pointer subtraction rules, stating that subtracting a constant moves the pointer backward by `n * sizeof(data_type)`. On-screen text displays the syntax `ptr = ptr - n;` alongside an integer array example. The instructor sketches a hand-drawn memory diagram to visualize the array structure, showing elements 10 through 50. A pointer `p` is initialized to index 3 (`&arr[3]`). The operation `p = p - 1;` is demonstrated, resulting in the pointer moving from index 3 to index 2. The visual evidence confirms that the address changes based on the data type size, with text explicitly noting `p now points to arr[2], i.e., address of 30`.

  2. 2:00 – 2:19 02:00-02:19

    In the final segment, the lesson concludes with a specific numerical calculation of pointer arithmetic. The instructor shows that subtracting 1 from the pointer `p` (initialized at address 1006) results in a new address of 1004. This calculation is derived from the formula `1006 - 1 * 2 = 1004`, explicitly assuming a 2-byte integer size. The on-screen text reiterates the rule that pointers move backward by multiples of their data type's size. The visual diagram reinforces this by showing the pointer shifting from index 3 back to index 2, confirming that `p` now points to the address of value 30.

The lecture effectively demonstrates pointer subtraction by combining syntax rules with visual memory diagrams. The core concept is that `ptr - n` moves the pointer backward by `n * sizeof(type)`. The example of decrementing an integer pointer from index 3 to 2 serves as a practical application, showing how address arithmetic works in memory. The calculation `1006 - 2 = 1004` provides a concrete numerical verification of the theoretical rule. This progression from abstract syntax to specific memory addresses ensures students understand both the code and the underlying hardware behavior.

Loading lesson…