POINTERS DECLARATION

Duration: 4 min

This video lesson is available to enrolled students.

Return to /learn/UPPSC-COMPUTER-OPERATOR-GRADE-B/programming-languages/arrays-pointers/pointer-basics-declaration-initialization-and-dereferencing/asset-pointers-declaration after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. English Comprehension: Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Reading Comprehension, Vocabulary, Idioms and Phrases, Narrative Sequencing, Critical Reasoning
  2. Reasoning and Aptitude: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Analogy, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Blood Relations, Directions (Direction Test), Ranking, Order and Sequence, Logical Sequence Of Words, Seating Arrangements, Puzzle Solving (Puzzles), Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Data Sufficiency, Selection Decision Table (Decision Making), Calendar, Clock, Cubes & Dices, Data Arrangement, Venn Diagram, Analytical Reasoning (Counting Figures Reasoning), Number System, HCF LCM, Percentage, Ratio and Proportion (Ratios), Average, Profit and Loss, Simple Interest and Compound Interest, Speed Time and Distance, Mensuration and Geometry, Arithmetic, Mixture and Alligation, Age Problems, Data Interpretation, Alphabet and Word Tests, Numerical Reasoning, Number System, Averages, Mixtures and Alligation, Percentages, Series Completion, Analogy and Classification, Patterns in Two-Dimensional Figures, Coding and Decoding, Mathematical Operations, Direction Sense, Logical Deduction and Induction, Simplification and Approximation, Assembling and Grouping of Shapes, Transformation of Shapes, Three-Dimensional Patterns and Visualization, Cubes and Dice, Algebra, Traverse Surveying, Clocks and Calendars, Order, Ranking and Sequence, Constraint Puzzles, Syllogisms and Venn Diagrams, Ratio and Proportion, Mensuration, Permutations and Combinations, Project Monitoring, Resources and Safety, Profit, Loss and Discount, Sequences and Series, Powers, Surds and Logarithms, Subject-Verb Agreement, Sentence Completion, Geometry, Probability, Trigonometry, Measurement and Quantity Take-Off, Statistics, Data Sufficiency, Blood Relations, Speed, Time and Distance, Time and Work, Data Interpretation, Sequence and Series (Series), Algebra, Permutation and Combination, Combinatorics
  3. General Awareness: Physics, Chemistry, Biology, Geography, History, Polity, Indian Economy
  4. Computer Fundamentals: Basics of COA, Number System, Number Representation, Semiconductor Memories and Programmable Logic, Timing, Hazards and Testing, Processor Organization and Instructions, Number Systems and Codes, Combinational Logic Design, Combinational Logic Circuits, Number Systems and Codes
  5. Operating System: Introduction to OS, Unix OS, Linux OS
  6. C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  7. OOPS with C++ & Java: OOPS with C++, Java
  8. Database Management System: Basics of DBMS, SQL
  9. MS Office: MS Office Applications
  10. Internet & Web Technologies: Website, Browser & Services, Internet Fundamentals, Web Design & Development, Protocols & Services
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…