POINTERS DECLARATION

Duration: 4 min

This video lesson is available to enrolled students.

Return to /learn/RSSB-BASIC-COMPUTER-INSTRUCTOR/paper-2-programming-fundamentals/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 the Course: About the Course
  2. Paper-1 & 2 | Basic Numeracy: Ratio and Proportion (Ratios), Divisibility Rules, Mixture and Alligation, Permutation and Combination, Logarithm, Number System, HCF LCM, Sequence and Series (Series), Speed Time and Distance, Percentage, Average, Mensuration and Geometry, Age Problems, Arithmetic, Statistics, Probability, Profit and Loss, Simple Interest and Compound Interest, Partnership, Speed Mathematics and Basic Mathematics, Algebra, Powers and Exponents (Surds and Indices), Time and Work, Pipe and Cistern, RSSB Specific Videos - Basic Numeracy
  3. Paper-1 & 2 | Data Interpretation: Data Interpretation
  4. Paper-1 & 2 | General Mental Ability: Mental Ability, RSSB Specific Videos - Mental Ability
  5. Paper-1 & 2 | Logical Reasoning and Analytical Ability: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Syllogisms, Seating Arrangements, Blood Relations, Directions (Direction Test), Analytical Reasoning (Counting Figures Reasoning), Puzzle Solving (Puzzles), Calendar, Clock, Cubes & Dices, Venn Diagram, Analogy, Ranking, Order and Sequence, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Data Arrangement, Logical Sequence Of Words, Crypt Arithmetic
  6. Paper-1 & 2 | Decision Making and Problem Solving: Selection Decision Table (Decision Making)
  7. Paper-1 | General Science: Physics, Biology, Chemistry, RSSB Specific Videos
  8. Paper-1 | General Awareness: State Wise GK, GK- Current Affairs
  9. Paper - 2 | Digital Logic Systems: Digital Systems & Boolean Basics, Logic Gates & Hardware, Combinational Circuit, Sequential Circuits
  10. Paper-2 | Database Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, Relational Calculus, Relational Algebra, SQL, NoSQL
  11. Paper-2 | Data Structures & Algorithms: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Algorithm Analysis, Sorting Algorithms, Intro to Compilers, Hashing
  12. Paper 2 | Data Communication and Network Security: Introduction to CN, Data Communication, Data Link Layer - Ethernet, DLL: Error Control, Net Layer: IPv4 & Proto, Net Layer: IP Addressing, Application Layer, Hardware basics, Network Security, Ethical Hacking
  13. Paper-2 | Operating Systems: Introduction to OS, Process Management, Memory Management, File Management, Deadlock
  14. Paper-2 | Computer Organization and Architecture: Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Instr Formats & Modes, Control Unit Design, Register Transfer and Microoperations, Programming the Basic Computer, Number System, Number Representation
  15. Paper 2 | System Analysis and Design: Fundamentals of Systems and Information Systems, Fundamentals of Software Engineering, SDLC and Development Approaches, Software Documentation and Software Requirements Specification (SRS), SDD and Quality Assurance, Security, Risk Management & Maintenance, Software Testing
  16. Paper-2 | C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  17. Paper 2 | OOPS , C++ , JAVA: Language Design, OOPS with C++, Java, .Net Programming, Java Fundamentals
  18. 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
  19. Emerging Trends and AI: Emerging Tech Trends, Artificial Intelligence
  20. Paper-2 | Data Processing (Ms-Office): MS Office Applications
  21. Paper-2 | Internet and Web Technologies: HTML Basics, CSS, XML, JavaScript-Basics, Internet Fundamentals, Protocols & Services, Web Publishing & Hosting, Server Side & Security, Emerging Technologies, Terms & Abbreviations, Cyber Threats and Malware Attacks, Role of Internet and Web Services, Security in Mobile and Wireless Computing
  22. Paper 2 | Pedagogy: Child Development, Theories, Concept of Pedagogy, Inclusive Education, Experiential Pedagogy, Assessment & Evaluation, Psychology, Curriculum Framework & Reforms, National Education Policy (NEP) 2020
  23. Live Classes: RSSB Live Sessions
  24. Paper 1 - Full Mock Tests:
  25. Paper 2 - Full Mock Tests:
  26. BCI Previous Year Papers:
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…