Practice question on Pointer

Duration: 4 min

This video lesson is available to enrolled students.

Return to /learn/COAL-INDIA-MANAGEMENT-TRAINEE/programming-data-structures/arrays-pointers/relationship-between-arrays-and-pointers/asset-practice-question-on-pointer after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. Paper-2 | Programming & Data Structures: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling, Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  3. Paper-2 | Databases / DBMS & SQL: 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
  4. Paper-2 | Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
  5. Paper-2 | Computer Networks & Security: 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, Network Access Technologies, Network Security
  6. 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
  7. 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
  8. 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
  9. Paper-2 | Computer Organization & Architecture: Basics of COA, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Programming the Basic Computer
  10. 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
  11. Paper-1 | General Awareness: Polity, Physics, Biology, Chemistry, Static General Knowledge, GK- Current Affairs, History, Geography, Indian Economy, Environment
  12. Paper-1 | Logical Reasoning: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Data Interpretation, Blood Relations, Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Selection Decision Table (Decision Making), Clock, Calendar, Cubes & Dices, Directions (Direction Test), Analogy, Seating Arrangements, Analytical Reasoning (Counting Figures Reasoning)
  13. Paper-1 | Quantitative Aptitude: Ratio and Proportion (Ratios), Mixture and Alligation, Permutation and Combination, Number System, HCF LCM, Speed Time and Distance, Average, Age Problems, Percentage, Profit and Loss, Time and Work, Pipe and Cistern, Simple Interest and Compound Interest, Powers and Exponents (Surds and Indices), Mensuration and Geometry, Probability, Statistics, Arithmetic, Algebra
  14. Paper-1 | English: Vocabulary, 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), Sentence Construction, Cloze Test (Cloze Passage)
  15. Coal India Previous Year Paper:
  16. Engineering Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic, Linear Algebra, Calculus
  17. Coal India Mock Test:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This lecture segment focuses on C programming pointer dereferencing, specifically analyzing how different levels of indirection affect output. The instructor uses a code example declaring an integer x, single pointer p, double pointer q, and another pointer r. Through handwritten annotations on the screen, he demonstrates that printing a pointer variable directly outputs its memory address (e.g., 100), while dereferencing with the asterisk operator (*) retrieves the stored value. The lesson establishes a critical rule: insufficient dereference dimensions yield an address, exact dimensions yield data, and exceeding dimensions cause errors. Visual diagrams map the memory linkage between x, p, and q to clarify these relationships.

Chapters

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

    The instructor introduces a C code snippet containing integer x and pointers p, q, r. He writes annotations like 'address -> 100' to show that printing pointer p displays its memory location rather than the value of x. Handwritten diagrams illustrate how p points to x, while q is a double pointer pointing to p. The instructor circles the asterisk in *p to emphasize dereferencing, distinguishing between printing an address versus the data stored at that address. This section establishes the foundational syntax for pointer declaration and basic memory visualization.

  2. 2:00 – 4:24 02:00-04:24

    The analysis deepens into double pointer behavior using variable q. The instructor categorizes output types based on the number of asterisks used: 'insufficient dim' results in an address, while 'exact dim' produces data. He draws a box around this rule summary to highlight its importance for exam revision. Red arrows on the screen trace the memory chain from x to p to q, visually reinforcing how multiple levels of indirection access different layers of memory. The instructor concludes by explaining that exceeding the dimensionality leads to errors, solidifying the relationship between code syntax and memory layout.

The video provides a structured explanation of pointer mechanics in C, moving from basic single-pointer usage to complex double-pointer logic. Key takeaways include the distinction between a pointer's address and its dereferenced value, demonstrated through on-screen code like int *p=&x; and printf statements. The instructor's handwritten notes serve as a visual guide, mapping abstract memory concepts to concrete code outputs. By categorizing outcomes into insufficient, exact, and exceeding dimensions, the lecture offers a clear heuristic for predicting program behavior. This progression from syntax to memory visualization ensures students understand not just how to write pointer code, but why it behaves as it does.

Loading lesson…