SCOPE RULE OF FUNCTION

Duration: 3 min

This video lesson is available to enrolled students.

Return to /learn/BIHAR-POLYTECHNIC-LECTURER-COMPUTER-SCIENCE/paper-1-programming-language/functions-ca695d/function-basics-definition-declaration-and-calling-mechanisms/asset-scope-rule-of-function 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.

The lecture begins by examining the scope rules of functions in C, using a code example where main() calls display(). The instructor emphasizes that variables like i in main and k in display are local and inaccessible to other functions without explicit passing or returning. He then transitions to calling conventions, explaining that C passes arguments from right to left. This is demonstrated with a complex printf statement involving increment operators, where he writes the output 3 3 1 to show the evaluation order. The session concludes by addressing printf's variable argument list, noting that mismatched format specifiers compile but cause runtime garbage output. Finally, he introduces advanced features like function prototypes and the default int return type for functions.

Chapters

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

    The instructor presents a C program with main() and display() functions to illustrate scope. He writes int j != 20 on the screen to clarify that the parameter j does not automatically take the value of i from main. He explains that scope is local to the function definition. He then introduces Calling Convention, stating C passes arguments right-to-left. He writes 3 3 1 under a printf example printf("%d %d %d", a, ++a, a++) to demonstrate how the right-to-left evaluation affects the output when side effects are involved. He notes that while simple calls like fun(a, b, c, d) are unaffected by order, complex expressions depend on it.

  2. 2:00 – 2:55 02:00-02:55

    The lecture shifts to printf behavior with mismatched arguments. The code printf("%d %d %d", i, j); is shown, where only two variables are provided for three format specifiers. The instructor explains this compiles because printf accepts a variable number of arguments, but prints garbage at runtime. He then lists Advanced Features of Functions, including prototypes and recursion. He explains that functions default to returning int unless specified otherwise, necessitating explicit declaration for other types. He sets up a simple program to find the square of a number to demonstrate this.

The video systematically builds understanding of C function mechanics, starting with variable scope limitations, moving to the specific right-to-left argument passing order, and concluding with the implications of variable arguments and default return types.

Loading lesson…