Official Class 11 Computer Science Revision Material: CBSE Class 11 Computer Science Functions Notes Set 02
Access comprehensive revision notes for Chapter 07 Functions using the CBSE Class 11 Computer Science Functions Notes Set 02. Designed to align with the 2026-27 academic syllabus for Class 11 Computer Science, these concept summaries help students streamline their exam preparation and review complex topics efficiently.
Chapter-wise Concept Summaries: Chapter 07 Functions
Navigate directly to the revision notes for Chapter 07 Functions using the digital viewer below. Each summary is structured to highlight high-weightage sections, allowing students to instantly access critical definitions and focus on core exam topics.
Function: A function is a named unit of a group of statements that can be invoked from other parts of the program. The advantages of using functions are:
• Functions enable us to break a program down into a number of smaller and smaller and simpler units. This makes the program more organized and structured and easier to debug.
• It helps in reusability of code and thus reduces program size. If similar code is required at several places in the program, the use of a function allows this code to be written just once, and to be called wherever it is required.
• It helps to execute the same set of statements with different set of values.
Function Declaration/Prototype: Just as any variable is declare before it is used in a program, it is necessary to declare a function to inform the compiler that the function would be referenced at a later point in the program. Function declaration is also called function prototype.
Syntax for function declaration:
<return type> <function name> ( <data type of parameter> [<parameter name>], …. );
Example: int sum ( int, int);
A declaration (prototype) tells the compiler that later on in our program we are going to write a particular function. It also informs the compiler about:
1. the type of result to be returned;
2. the identifier of the function;
3. the number and types of parameters;
It is terminated by a semicolon.
<return type>: It is the data type of the value that is returned to the calling function after the function is executed. It can be any of the data types, available in C++.
<function name>: It is the name of the function, which is given with accordance to the naming conventions used for naming an identifier. A function is called with the help of it’s name.
<data type of parameter>: These are the data types of the parameters/inputs that the function receives when it is called. In function declaration it is optional to give the name of the parameters. The different data types specify to the compiler, the total number of parameters, and the data type of these parameters that the function will receive, when it is called (invoked).
Function definition: The function definition contains the function header and the function body i.e. the set of statements which are executed when the function is called.
Syntax for function definition:
<return type> <function name> (<data type of parameter> <name of <parameter>, …. )
{
Statement 1;
Statement 2;
:
return ( value / variable / expression );
}
Example:
int sum ( int a, int b)
{
int s = a + b;
return s;
}
Note: The return statement is used to return a value to the calling function. It is always the last statement in the function definition (if the function has return type). The data type of the value returned should match with the return type of the function.
// Example 1
// Program to find the factorial of a number using a function Fact ()
#include<iostream.h>
#include<conio.h>
long Fact( long); // Function Prototype
void main()
{
long num;
clrscr();
cout<<”\n\tEnter a No. : “;
cin>>num;
cout<<num<<”! = ”<<Fact(num); // Function call with num as an actual parameter
getch();
}
// Definition of function
long Fact (long N) // Function header with N as a Formal parameter
{
long I, f=1;
Function Body
for( i=1; i<=N; i++)
f = f * i;
return f;
}
Order of Execution in the above program
main() // Execution starts from the main()
↓
Function call to Fact() // Control is passed to the function definition of Fact()
↓
Execution of the Fact() // All the statements in the function Definition of Fact() are executed
↓
Execution of statement getch() // Control returns to the main(), to the statement which follows the function call statement of Fact()
Function Header: It is the first line of the function definition, which specifies the following:
• Return type of the function
• Name of the function
• Name of the parameters, along with their data types
Note: It is not terminated with semicolon.
Chapter 07 Functions Concepts and Summary for Class 11 Computer Science
About Chapter 07 Functions Revision Notes
Explore reliable chapter overviews for Chapter 07 Functions tailored for Class 11 learners. Use these structured points to grasp difficult themes and ensure solid preparation for upcoming assessments.
How to Use These Revision Notes
Cross-reference your comprehension with comprehensive NCERT solutions for Class 11 to ensure absolute clarity across all sub-topics in this chapter.
Enhance Practice with MCQs and Worksheets
Explore our broader library of printable assignments, chapter notes, and mock tests designed to support continuous revision and secure higher marks in CBSE assessments.
FAQs
You can download the teacher prepared revision notes for CBSE Class 11 Computer Science Functions Notes Set 02 from StudiesToday.com. These notes are designed as per 2026-27 academic session to help Class 11 students get the best study material for Computer Science.
Yes, our CBSE Class 11 Computer Science Functions Notes Set 02 include 50% competency-based questions with focus on core logic, keyword definitions, and the practical application of Computer Science principles which is important for getting more marks in 2026 CBSE exams.
Yes, our CBSE Class 11 Computer Science Functions Notes Set 02 provide a detailed, topic wise breakdown of the chapter. Fundamental definitions, complex numerical formulas and all topics of CBSE syllabus in Class 11 is covered.
These notes for Computer Science are organized into bullet points and easy-to-read charts. By using CBSE Class 11 Computer Science Functions Notes Set 02, Class 11 students fast revise formulas, key definitions before the exams.
No, all study resources on StudiesToday, including CBSE Class 11 Computer Science Functions Notes Set 02, are available for immediate free download. Class 11 Computer Science study material is available in PDF and can be downloaded on mobile.