POINTERS DECLARATION

Duration: 4 min

This video lesson is available to enrolled students.

Return to /learn/IOCL-ENGINEERS-OFFICERS-GRADE-A-PAPER-2/c-language/arrays-pointers/pointer-basics-declaration-initialization-and-dereferencing/asset-pointers-declaration after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. Paper 1 | Quantitative Aptitude: Percentage Ratio and Proportion (Ratios) Powers and Exponents (Surds and Indices) Logarithm Sequence and Series (Series) Mensuration and Geometry Data Interpretation Average Arithmetic Simplification and Approximation Algebra Sequences and Series Profit, Loss and Discount Percentages Number System Ratio and Proportion Averages, Mixtures and Alligation Permutations and Combinations Time and Work Vocabulary Subject-Verb Agreement Sentence Completion Geometry Reading Comprehension Powers, Surds and Logarithms Trigonometry Mensuration Speed, Time and Distance Patterns in Two-Dimensional Figures Probability Measurement and Quantity Take-Off Transformation of Shapes Three-Dimensional Patterns and Visualization Statistics Mathematical Operations Data Sufficiency Constraint Puzzles Data Interpretation Mixture and Alligation Speed Time and Distance HCF LCM Algebra Profit and Loss Venn Diagram
  3. Paper 1 | Logical Reasoning: Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning) Series (Number and Letter Series) (Numerical Relations and Reasoning) Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning) Analogy Cubes & Dices Syllogisms Numerical Reasoning Assembling and Grouping of Shapes Coding and Decoding Cubes and Dice Series Completion Alphabet and Word Tests Analogy and Classification Direction Sense Logical Deduction and Induction Order, Ranking and Sequence Critical Reasoning Syllogisms and Venn Diagrams Narrative Sequencing Project Monitoring, Resources and Safety Simple Interest and Compound Interest Coding Decoding Seating Arrangements
  4. Paper 1 | English Language: Vocabulary Noun Pronoun Verb Adjectives Adverb Preposition Conjunction Articles Tenses Subject Verb Agreement (Verb Noun Agreement) Modals Sentence Correction (Error Correction) Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions) Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing) Prepositions and Conjunctions Idioms and Phrases Verb Forms and Verb Patterns Sentence Basics, Nouns and Pronouns Adjectives and Adverbs Articles and Determiners Modals, Conditionals and Subjunctive Sentence Structure and Correction Voice and Reported Speech Tenses Vocabulary
  5. Paper 1 | Unit Tests:
  6. Paper 1 | Full-Length Mock Tests:
  7. Paper 2 | Engineering Mathematics: Set Theory Relations Functions Graph Theory Group Theory Propositional and Predicate Logic Linear Algebra Calculus Permutation and Combination Probability Statistics Signal Space and Optimum Detection Probability Statistics Combinatorics
  8. Paper 2 | Digital Logic: Digital Systems & Boolean Basics Logic Gates & Hardware Boolean Expression Boolean Minimization Combinational Circuit Sequential Circuits Number System Number Representation Registers and Counters Boolean Algebra and Logic Gates Microprocessors and Microcontrollers Logic Families and CMOS Logic Microprocessors Logic Gates and Boolean Algebra Number Systems and Codes Minimization of Boolean Functions Timing, Hazards and Testing Logic Families Combinational Logic Design Arithmetic Circuits Semiconductor Memories and Programmable Logic Devices Combinational Logic Circuits Sequential Circuits and State Machines Latches and Flip-Flops Finite State Machines Minimization of Boolean Functions Arithmetic Circuits Registers and Counters Latches and Flip-Flops Number Systems and Codes
  9. Paper 2 | Computer Architecture: Basics of COA Floating Point Rep Cache Memory Organization Input Output Organisation Pipelining Instr Formats & Modes Control Unit Design Semiconductor Memories and Programmable Logic Processor Organization and Instructions Memory Hierarchy and Input/Output
  10. Paper 2 | Programming and 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
  11. Paper 2 | Algorithms: Algorithm Analysis Time Complexity Analysis Sorting Algorithms Greedy Algorithms Dynamic Programming Minimum Spanning Trees Shortest Path Algos
  12. Paper 2 | Theory Of Computation/Automata Theory: 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 | Operating System: Introduction to OS Process Management CPU Scheduling Process Synchronization Threads & Process Creation Deadlock Memory Management Virtual Memory Disc Scheduling File Management
  15. Paper 2 | DataBase Management System/DBMS: 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 Database Recovery
  16. Paper 2 | Computer Networks: Introduction to CN 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
  17. Paper 2 | CS/IT Sectional Mock Tests:
  18. Complete Paper Full Mock Test:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

The lecture provides a detailed explanation of C pointer declarations and the advanced concept of pointers to pointers. It starts by defining pointers as variables capable of holding memory addresses, emphasizing that since addresses are whole numbers, pointers always contain whole numbers. The instructor clarifies common misconceptions, such as `float *s` storing an address of a float rather than a float value itself. The lesson then extends this concept to show that a variable can be a pointer to another pointer. Using the code `int i = 3, *j, **k;`, the instructor demonstrates how `j` holds the address of `i` and `k` holds the address of `j`. He begins analyzing the code's output, marking specific `printf` statements to distinguish between printing addresses and values.

Chapters

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

    The instructor introduces pointer declarations like `int *alpha`, `char *ch`, and `float *s`, explaining they hold addresses. He notes that addresses are always whole numbers. He then introduces a code snippet `int i = 3, *j, **k;` to demonstrate pointers to pointers. He explains the initialization `j = &i` and `k = &j`. He starts annotating the `printf` statements on the screen, marking the first few with an 'x' to indicate they print addresses. He writes on the board that `i` holds 3, `j` holds an address (e.g., 65524), and `k` holds an address (e.g., 65522).

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

    The instructor displays the program output and draws a memory diagram. The diagram shows `i` containing 3 at address 65524, `j` containing 65524 at address 65522, and `k` containing 65522 at address 65520. He explains the chain of pointers: `k` points to `j`, which points to `i`. He goes through the remaining `printf` statements, marking them with 'y' to show they print values. He explains that `*j` and `**k` both dereference to the value 3. The segment concludes with a slide titled 'Back to Function Calls', indicating a shift in topic.

The lesson progresses from fundamental pointer definitions to the more complex concept of pointers to pointers. By using a concrete code example with `i`, `j`, and `k`, the instructor visually demonstrates memory allocation and dereferencing. The transition from explaining declarations to analyzing specific `printf` outputs and memory diagrams solidifies the understanding of how pointers chain together to access values indirectly. This sets the stage for understanding function calls by reference.

Loading lesson…