Address Operation - Substraction

Duration: 2 min

This video lesson is available to enrolled students.

Return to /learn/MPPSC-ASSISTANT-PROFESSOR-COMPUTER-SCIENCE-PAPER-2/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. 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 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…