Call by Address

Duration: 2 min

This video lesson is available to enrolled students.

Return to /learn/BIHAR-POLYTECHNIC-LECTURER-COMPUTER-SCIENCE/paper-1-programming-language/arrays-pointers/call-by-addressreference/asset-call-by-address after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. Discrete Mathematics: Permutation, Combination and Probability / क्रमचय, संचय एवं प्रायिकता, Set Theory, Relations, Functions, Propositional and Predicate Logic, Graph Theory, Group Theory
  2. Digital Logic: Digital Systems & Boolean Basics, Boolean Expression, Boolean Minimization, Logic Gates & Hardware, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Floating Point Rep
  3. Computer Organization and Architecture: Basics of COA, Programming the Basic Computer, Cache Memory Organization, Input Output Organisation, Instr Formats & Modes, Register Transfer and Microoperations, Control Unit Design, Pipelining, Multiprocessors
  4. Programming: Language Design, C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling, OOPS with C++
  5. Data Structures: Introduction to DS, Array, Linked List, Stack, Queue, Tree, Graphs, Hashing
  6. Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Advanced Algorithms
  7. Theory of Computation: Grammar, Regular Language Properties, Moore & Mealy Machines, Turing Machines
  8. 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, Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Pushdown Automata & CFG, Complexity Theory
  9. Operating Systems: 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, Security
  10. Database Management Systems: 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, ORDBMS, NoSQL
  11. 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, Network Security
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This lecture segment introduces the 'Call by Address' mechanism in C programming, demonstrating how pointers enable functions to modify original variables. The instructor utilizes a `swap` function to illustrate pass-by-reference semantics, contrasting it implicitly with value passing. The core concept revolves around passing memory addresses using the address-of operator `&` and dereferencing them with `*` to access or alter data at specific locations.

Chapters

  1. 0:00 – 1:52 00:00-01:52

    The instructor explains 'Call by Address' using a `swap` function, initializing variables x=5 and y=10 at memory addresses 100 and 200. The code `void swap(int *a, int *b)` is shown alongside the main function call `swap(&x, &y)`. Visual diagrams depict arrows from parameters a and b pointing to x and y's addresses. The logic `temp = *a; *a = *b; *b = temp;` is traced step-by-step, showing how values are exchanged at the memory level. The final output confirms x=10 and y=5, proving that modifications inside the function persist in main due to direct address access.

The video effectively visualizes pointer mechanics by mapping abstract memory addresses to concrete variable values. By tracing the execution of `swap`, students observe that passing `&x` and `&y` allows the function to manipulate the original stack variables rather than copies. The use of temporary storage `int temp` is critical for preserving data during the exchange process.

Loading lesson…