WHAT IS FUNCTIONS
Duration: 9 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- About Course: About the Course
- General Aptitude & Reasoning: Number System, Percentage, Ratio and Proportion (Ratios), Average, Profit and Loss, Simple Interest and Compound Interest, Algebra, Probability, Permutation and Combination, Venn Diagram, HCF LCM, Pipe and Cistern, Linear Algebra, Sequence and Series (Series), Statistics, Powers and Exponents (Surds and Indices), Arithmetic, Mensuration and Geometry, Calculus, Trigonometry, Vectors, 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, Cubes & Dices, Number System, Powers, Surds and Logarithms, Mathematical Operations, Simplification and Approximation, Percentages, Ratio and Proportion, Averages, Mixtures and Alligation, Permutations and Combinations, Profit, Loss and Discount, Sequences and Series, Vocabulary, Subject-Verb Agreement, Sentence Completion, Geometry, Reading Comprehension, Transformation of Shapes, Signal Space and Optimum Detection, Alphabet and Word Tests, Syllogisms and Venn Diagrams, Analogy and Classification, Mensuration, Constraint Puzzles, Patterns in Two-Dimensional Figures, Three-Dimensional Patterns and Visualization, Differential Calculus, Wireless, Satellite and Optical Communication Systems, Complex Analysis, Vector Analysis, Numerical Reasoning, Assembling and Grouping of Shapes, Coding and Decoding, Cubes and Dice, Series Completion, Direction Sense, Logical Deduction and Induction, Order, Ranking and Sequence, Clocks and Calendars, Critical Reasoning, Narrative Sequencing, Project Monitoring, Resources and Safety, Traverse Surveying, Algebra, Data Interpretation, Time and Work, Probability, Speed, Time and Distance, Statistics, Data Sufficiency, Trigonometry, Differential Calculus, Blood Relations, Mixture and Alligation, Speed Time and Distance, Combinatorics
- 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
- 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
- AI, Machine Learning, Big Data & Cloud: Emerging Tech Trends, Artificial Intelligence, Big Data Systems, Approaches to AI, Search Algorithms, Knowledge Representation, Cloud Computing
- 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, Registers and Counters, Boolean Algebra and Logic Gates, Microprocessors and Microcontrollers, Logic Families and CMOS Logic, Microprocessors, Logic Gates and Boolean Algebra, Number Systems and Codes, Minimization of Boolean Functions, Timing, Hazards and Testing, Logic Families, Combinational Logic Design, Arithmetic Circuits, Waveform Generators and Timer Circuits, Semiconductor Memories and Programmable Logic Devices, Combinational Logic Circuits, Sequential Circuits and State Machines, Latches and Flip-Flops, Finite State Machines, Processor Organization and Instructions, Memory Hierarchy and Input/Output, Minimization of Boolean Functions, Arithmetic Circuits, Registers and Counters, Latches and Flip-Flops, Number Systems and Codes, Semiconductor Memories and Programmable Logic
- 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
- Discrete Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic
- 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
- 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
- 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
- Other Recurring CS Topics: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing, Multimedia
- Live Classes: ISRO Live classes
- Full Mock Test:
AI summary & chapters
AI Summary
An AI-generated summary of this video lecture.
The video provides a foundational lecture on functions in the C programming language. It begins by defining a function as a self-contained block of statements that performs a coherent task, using the analogy of hiring a person to do a specific job. The instructor explains the mechanism of "calling" a function, where control transfers from the calling function (typically main) to the called function and returns upon completion. The lesson covers the mandatory presence of the main function in every C program and demonstrates that the order of function definition does not dictate the order of execution. Finally, it distinguishes between library functions, which are pre-written and provided by the compiler, and user-defined functions created by the programmer. This lecture serves as an introduction to modular programming in C.
Chapters
0:00 – 2:00 00:00-02:00
The video starts with a "Break" slide before transitioning to a slide titled "1 – What is a Function". The instructor introduces the concept by stating, "Knowingly or unknowingly we rely on so many persons for so many things." He compares human reliance on others (like a mechanic or gardener) to a computer program's need for assistance. The slide text explains that a computer program "cannot handle all the tasks by itself" and instead "requests other program like entities—called ‘functions’ in C—to get its tasks done." This section establishes the conceptual basis for why functions are necessary in programming. The instructor emphasizes that even though man is an intelligent species, he "cannot perform all of life’s tasks all alone." He mentions that a program finds itself in a similar situation.
2:00 – 5:00 02:00-05:00
The instructor presents a code example where main() calls message(). He explains that when main() calls message(), "control passes to the function message(). The activity of main() is temporarily suspended." He illustrates this with a red arrow pointing from message(); in main() to the message() definition. He then shows a more complex example where main() calls italy(), brazil(), and argentina(). He draws red circles around each function block to emphasize they are separate entities. He concludes this section by stating, "If a C program contains more than one function, then one (and only one) of these functions must be main(), because program execution always begins with main()." He also notes that "Any C program contains at least one function." He explains that if a program contains only one function, it must be main().
5:00 – 9:20 05:00-09:20
The lecture addresses the order of function definitions. A code snippet shows main() calling message1() and message2(), but message2() is defined before message1(). The instructor circles the function blocks and states, "The order in which the functions are defined in a program and the order in which they get called need not necessarily be same." He then summarizes the two types of functions: "Library functions Ex. printf(), scanf() etc." and "User-defined functions Ex. argentina(), brazil() etc." He explains that library functions are "commonly required functions grouped together and stored in what is called a Library," written by compiler writers, whereas user-defined functions are created by the programmer. He adds that "The procedure of calling both types of functions is exactly same." He also mentions that "Almost always a compiler comes with a library of standard functions."
The lesson systematically builds an understanding of C functions from concept to implementation. It moves from the high-level analogy of outsourcing tasks to the technical details of control flow and function calls. By demonstrating that definition order is flexible and distinguishing between standard library and custom functions, the instructor provides a comprehensive overview of how functions structure a C program, preparing students for writing modular and efficient code. The progression from simple examples to more complex calls ensures a clear understanding of the core concepts.

