Skip to content
geeksforgeeks
  • Tutorials
    • Python
    • Java
    • Data Structures & Algorithms
    • ML & Data Science
    • Interview Corner
    • Programming Languages
    • Web Development
    • CS Subjects
    • DevOps And Linux
    • School Learning
    • Practice Coding Problems
  • Courses
    • DSA to Development
    • Get IBM Certification
    • Newly Launched!
      • Master Django Framework
      • Become AWS Certified
    • For Working Professionals
      • Interview 101: DSA & System Design
      • Data Science Training Program
      • JAVA Backend Development (Live)
      • DevOps Engineering (LIVE)
      • Data Structures & Algorithms in Python
    • For Students
      • Placement Preparation Course
      • Data Science (Live)
      • Data Structure & Algorithm-Self Paced (C++/JAVA)
      • Master Competitive Programming (Live)
      • Full Stack Development with React & Node JS (Live)
    • Full Stack Development
    • Data Science Program
    • All Courses
  • Software Engineering Tutorial
  • Software Development Life Cycle
  • Waterfall Model
  • Software Requirements
  • Software Measurement and Metrics
  • Software Design Process
  • System configuration management
  • Software Maintenance
  • Software Development Tutorial
  • Software Testing Tutorial
  • Product Management Tutorial
  • Project Management Tutorial
  • Agile Methodology
  • Selenium Basics
Open In App
Next Article:
Software Engineering | Calculation of Function Point (FP)
Next article icon

Software Engineering | Calculation of Function Point (FP)

Last Updated : 28 Jun, 2020
Comments
Improve
Suggest changes
Like Article
Like
Report
Function Point (FP) is an element of software development which helps to approximate the cost of development early in the process. It may measures functionality from user's point of view. Counting Function Point (FP):
  • Step-1:
    F = 14 * scale
    Scale varies from 0 to 5 according to character of Complexity Adjustment Factor (CAF). Below table shows scale:
    0 - No Influence  1 - Incidental  2 - Moderate  3 - Average  4 - Significant  5 - Essential 
  • Step-2: Calculate Complexity Adjustment Factor (CAF).
    CAF = 0.65 + ( 0.01 * F )
  • Step-3: Calculate Unadjusted Function Point (UFP). TABLE (Required)
    Function Units Low Avg High
    EI 3 4 6
    EO 4 5 7
    EQ 3 4 6
    ILF 7 10 15
    EIF 5 7 10
    Multiply each individual function point to corresponding values in TABLE.
  • Step-4: Calculate Function Point.
    FP = UFP * CAF
Example: Given the following values, compute function point when all complexity adjustment factor (CAF) and weighting factors are average.
User Input = 50  User Output = 40  User Inquiries = 35  User Files = 6  External Interface = 4 
Explanation:
  • Step-1: As complexity adjustment factor is average (given in question), hence,
    scale = 3.  F = 14 * 3 = 42 
  • Step-2:
    CAF = 0.65 + ( 0.01 * 42 ) = 1.07 
  • Step-3: As weighting factors are also average (given in question) hence we will multiply each individual function point to corresponding values in TABLE.
    UFP = (50*4) + (40*5) + (35*4) + (6*10) + (4*7) = 628 
  • Step-4:
    Function Point = 628 * 1.07 = 671.96 
    This is the required answer.
Program to calculate Function Point is as follows :- CPP
#include <bits/stdc++.h> using namespace std;   // Function to calculate Function Point void calfp(int frates[][3], int fac_rate) {       // Function Units     string funUnits[5] = {         "External Inputs",         "External Outputs",         "External Inquiries",         "Internal Logical Files",         "External Interface Files"     };       // Weight Rates     string wtRates[3] = { "Low", "Average", "High" };       // Weight Factors     int wtFactors[5][3] = {         { 3, 4, 6 },         { 4, 5, 7 },         { 3, 4, 6 },         { 7, 10, 15 },         { 5, 7, 10 },     };       int UFP = 0;       // Calculating UFP (Unadjusted Function Point)     for (int i = 0; i < 5; i++) {           for (int j = 0; j < 3; j++) {               int freq = frates[i][j];               UFP += freq * wtFactors[i][j];         }     }       // 14 factors     string aspects[14] = {         "reliable backup and recovery required ?",         "data communication required ?",         "are there distributed processing functions ?",         "is performance critical ?",         "will the system run in an existing heavily utilized operational environment ?",         "on line data entry required ?",         "does the on line data entry require the input transaction to be built over multiple screens or operations ?",         "are the master files updated on line ?",         "is the inputs, outputs, files or inquiries complex ?",         "is the internal processing complex ?",         "is the code designed to be reusable ?",         "are the conversion and installation included in the design ?",         "is the system designed for multiple installations in different organizations ?",         "is the application designed to facilitate change and ease of use by the user ?"     };       /*     Rate Scale of Factors     Rate the following aspects on a scale of 0-5 :-     0 - No influence      1 - Incidental      2 - Moderate      3 - Average      4 - Significant      5 - Essential      */       int sumF = 0;       // Taking Input of factors rate     for (int i = 0; i < 14; i++) {           int rate = fac_rate;           sumF += rate;     }       // Calculate CFP     double CAF = 0.65 + 0.01 * sumF;       // Calculate Function Point (FP)     double FP = UFP * CAF;       // Output Values     cout << "Function Point Analysis :-" << endl;       cout << "Unadjusted Function Points (UFP) : " << UFP << endl;       cout << "Complexity Adjustment Factor (CAF) : " << CAF << endl;       cout << "Function Points (FP) : " << FP << endl; }   // driver function int main() {     int frates[5][3] = {         { 0, 50, 0 },         { 0, 40, 0 },         { 0, 35, 0 },         { 0, 6, 0 },         { 0, 4, 0 }     };       int fac_rate = 3;       calfp(frates, fac_rate);       return 0; } 
Output:
  Function Point Analysis :-  Unadjusted Function Points (UFP) : 628  Complexity Adjustment Factor (CAF) : 1.07  Function Points (FP) : 671.96  

Next Article
Software Engineering | Calculation of Function Point (FP)

P

pp_pankaj
Improve
Article Tags :
  • Software Engineering

Similar Reads

    Differentiate between LOC and Function Point in Software Engineering
    1. Lines of Code (LOC) : The line of code (LOC) metric is any line of text in a code that is not a comment or blank line, in any case of the number of statements or fragments of statements on the line. LOC consists of all lines containing program header files, declaration of any variable, and execut
    3 min read
    How to Find Number of Function Arguments in MATLAB?
    The number of function arguments passed in MATLAB will be determined in the following article. Unlike C, C++, and Java, MATLAB can accommodate a variable amount of parameters provided into a function without throwing an error. We'll go through how we determine the actual amount of parameters supplie
    4 min read
    User defined function in MATLAB
    Functions let you do a specific task. User defined functions are the functions created by the users according to their needs. This article explains how the user defined function in MATLAB is created. Syntax : function [a1,...,an] = func(x1,...,xm) func is the function name a1,...,an are outputs x1,.
    2 min read
    Extended Function Point (EFP) Metrics
    Function Point (FP) measure was inadequate for many engineering and embedded systems. To overcome this, A number of extensions to the basic function point measure have been proposed. These are as follows: Feature Points: Feature Points are computed by counting the information domain values. It can b
    3 min read
    Root Locus using MATLAB
    In control systems, root locus analysis is a graphical strategy for looking at how the foundations of a system change with variety of a specific system boundary, generally an addition inside a feedback system. Purpose of root locus in control system are as follows: To find the stability To check a p
    2 min read
geeksforgeeks-footer-logo
Corporate & Communications Address:
A-143, 7th Floor, Sovereign Corporate Tower, Sector- 136, Noida, Uttar Pradesh (201305)
Registered Address:
K 061, Tower K, Gulshan Vivante Apartment, Sector 137, Noida, Gautam Buddh Nagar, Uttar Pradesh, 201305
GFG App on Play Store GFG App on App Store
Advertise with us
  • Company
  • About Us
  • Legal
  • Privacy Policy
  • In Media
  • Contact Us
  • Advertise with us
  • GFG Corporate Solution
  • Placement Training Program
  • Languages
  • Python
  • Java
  • C++
  • PHP
  • GoLang
  • SQL
  • R Language
  • Android Tutorial
  • Tutorials Archive
  • DSA
  • Data Structures
  • Algorithms
  • DSA for Beginners
  • Basic DSA Problems
  • DSA Roadmap
  • Top 100 DSA Interview Problems
  • DSA Roadmap by Sandeep Jain
  • All Cheat Sheets
  • Data Science & ML
  • Data Science With Python
  • Data Science For Beginner
  • Machine Learning
  • ML Maths
  • Data Visualisation
  • Pandas
  • NumPy
  • NLP
  • Deep Learning
  • Web Technologies
  • HTML
  • CSS
  • JavaScript
  • TypeScript
  • ReactJS
  • NextJS
  • Bootstrap
  • Web Design
  • Python Tutorial
  • Python Programming Examples
  • Python Projects
  • Python Tkinter
  • Python Web Scraping
  • OpenCV Tutorial
  • Python Interview Question
  • Django
  • Computer Science
  • Operating Systems
  • Computer Network
  • Database Management System
  • Software Engineering
  • Digital Logic Design
  • Engineering Maths
  • Software Development
  • Software Testing
  • DevOps
  • Git
  • Linux
  • AWS
  • Docker
  • Kubernetes
  • Azure
  • GCP
  • DevOps Roadmap
  • System Design
  • High Level Design
  • Low Level Design
  • UML Diagrams
  • Interview Guide
  • Design Patterns
  • OOAD
  • System Design Bootcamp
  • Interview Questions
  • Inteview Preparation
  • Competitive Programming
  • Top DS or Algo for CP
  • Company-Wise Recruitment Process
  • Company-Wise Preparation
  • Aptitude Preparation
  • Puzzles
  • School Subjects
  • Mathematics
  • Physics
  • Chemistry
  • Biology
  • Social Science
  • English Grammar
  • Commerce
  • World GK
  • GeeksforGeeks Videos
  • DSA
  • Python
  • Java
  • C++
  • Web Development
  • Data Science
  • CS Subjects
@GeeksforGeeks, Sanchhaya Education Private Limited, All rights reserved
We use cookies to ensure you have the best browsing experience on our website. By using our site, you acknowledge that you have read and understood our Cookie Policy & Privacy Policy
Lightbox
Improvement
Suggest Changes
Help us improve. Share your suggestions to enhance the article. Contribute your expertise and make a difference in the GeeksforGeeks portal.
geeksforgeeks-suggest-icon
Create Improvement
Enhance the article with your expertise. Contribute to the GeeksforGeeks community and help create better learning resources for all.
geeksforgeeks-improvement-icon
Suggest Changes
min 4 words, max Words Limit:1000

Thank You!

Your suggestions are valuable to us.

What kind of Experience do you want to share?

Interview Experiences
Admission Experiences
Career Journeys
Work Experiences
Campus Experiences
Competitive Exam Experiences