Address Operation - Substraction

Duration: 2 min

This video lesson is available to enrolled students.

Return to /learn/TPSC-ASSISTANT-TECHNICAL-OFFICER/programming-in-c/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 2 | Digital Logic: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Floating Point Rep
  3. Paper 2 | Computer Organization And Architecture: Basics of COA, Cache Memory Organization, Input Output Organisation, Pipelining, Control Unit Design, Instr Formats & Modes, Programming the Basic Computer
  4. Paper 2 | Analog And Digital Communication: Introduction to Communication Systems & Random Signals, Analog Communication Systems, Information Theory & Digital Communication Fundamentals, Digital Modulation & Detection Techniques, Error Control, Synchronization & Multiple Access Techniques
  5. Paper 2 | Programming in C: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  6. Paper 2 | Data Structures And Programming: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Java, OOPS with C++, Java Fundamentals, Array, String, IO & References
  7. Paper 2 | Algorithms: Algorithm Analysis, Sorting Algorithms, Time Complexity Analysis, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
  8. 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
  9. Paper 2 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management, Unix OS, Linux OS
  10. Paper 2 | Databases: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, Relational Algebra, SQL, Relational Calculus, File Organization & Indexing, Transaction Management, Concurrency Control
  11. Paper 2 | Information Systems and Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  12. Paper 2 | 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
  13. Paper 2 | Internet & Web Technologies: Website, Browser & Services, Internet Fundamentals, Web Design & Development, Protocols & Services, Web Publishing & Hosting, Server Side & Security, Emerging Technologies, HTML Basics, JavaScript-Basics, CSS, XML, HTML5
  14. Paper 2 | Cyber Security And Emerging Technologies: Emerging Tech Trends
  15. Paper 2 | Cloud Technology: Cloud Computing
  16. Paper 2 | Probability and statistics: Probability, Statistics
  17. Paper-1 English: Vocabulary, Preposition, Articles, Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Correction (Error Correction), Sentence Completion (Fill in the blanks), Cloze Test (Cloze Passage), Sentence Construction
  18. Paper 1 General Mental Ability & Logical reasoning: Ratio and Proportion (Ratios), Divisibility Rules, Data Interpretation, Mixture and Alligation, Permutation and Combination, Logarithm, Number System, HCF LCM, Sequence and Series (Series), Speed Time and Distance, Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Percentage, Average, Powers and Exponents (Surds and Indices), Algebra, Profit and Loss, Simple Interest and Compound Interest, Time and Work, Pipe and Cistern, Mensuration and Geometry, Mental Ability, Age Problems, Partnership, Arithmetic, Speed Mathematics and Basic Mathematics, Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Seating Arrangements, Blood Relations, Directions (Direction Test), Analytical Reasoning (Counting Figures Reasoning), Puzzle Solving (Puzzles), Calendar, Clock, Cubes & Dices, Selection Decision Table (Decision Making), Logical Sequence Of Words, Venn Diagram, Analogy
  19. Paper-1 General Knowledge & Current Affairs: State Wise GK, History, Geography, GK- Current Affairs, Static General Knowledge
  20. Full Length Mock Test:
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…