SCOPE RULE OF FUNCTION

Duration: 3 min

This video lesson is available to enrolled students.

Return to /learn/ISRO/programming/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. About Course: About the Course
  2. General Aptitude & Reasoning: Number System, Percentage, Ratio and Proportion (Ratios), Average, Profit and Loss, Simple Interest and Compound Interest, Time and Work, Speed Time and Distance, Mixture and Alligation, Data Interpretation, Algebra, Probability, Permutation and Combination, Venn Diagram, HCF LCM, Divisibility Rules, Age Problems, Pipe and Cistern, Partnership, Linear Algebra, Sequence and Series (Series), Statistics, Powers and Exponents (Surds and Indices), Arithmetic, Mensuration and Geometry, Calculus, Trigonometry, Vectors, Speed Mathematics and Basic Mathematics, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Analogy, Series (Number and Letter Series) (Numerical Relations and Reasoning), Puzzle Solving (Puzzles), Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Calendar, Seating Arrangements, Coding Decoding, Blood Relations, Directions (Direction Test), Clock, Analytical Reasoning (Counting Figures Reasoning), Ranking, Order and Sequence, Logical Sequence Of Words, Inequality, Data Sufficiency, Cubes & Dices
  3. Computer Networks & Cybersecurity: 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
  4. Programming, Data Structures & Algorithms: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling, OOPS with C++, Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Advanced Algorithms
  5. AI, Machine Learning, Big Data & Cloud: Emerging Tech Trends, Artificial Intelligence, Big Data Systems, Approaches to AI, Search Algorithms, Knowledge Representation, Cloud Computing
  6. Digital Logic & Computer Organization: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Register Transfer and Microoperations, Control Unit Design, Programming the Basic Computer
  7. TOC & Compiler: 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, 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
  8. Discrete Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic
  9. Operating System: 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, Distributed Systems
  10. Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management, Object Oriented Technology, HTML Basics, JavaScript-Basics, Java, XML
  11. Database Management System: 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, Data Warehousing & Mining, Enhanced Data Models, NoSQL
  12. Other Recurring CS Topics: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing, Multimedia
  13. Live Classes: ISRO Live classes
  14. Full Mock Test:
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…