Empirical Models

Duration: 5 min

This video lesson is available to enrolled students.

Return to /learn/ISRO/software-engineering/software-design-estimation-and-metrics/software-project-estimation/asset-empirical-models 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.

This educational video provides a lecture on software estimation models, specifically focusing on empirical models and the COCOMO (Construction Cost Model) framework. The presentation begins by defining empirical models as estimation techniques that use formulas derived from historical data, based on metrics like Lines of Code (LOC) or Function Points (FP). It then introduces the COCOMO model, developed by Barry Boehm in 1981, as the most widely used and universally accepted regression-based estimation technique. The lecture details the three primary software classes defined by COCOMO: Organic (application), Semidetached (utility), and Embedded (system), explaining that classification is based on product and team characteristics. The video concludes by presenting a worked example, writing the formula 'E = 100 pm' on the screen, which represents the effort (E) in person-months for a project, illustrating the application of the model.

Chapters

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

    The video opens with a title card for 'SOFTWARE ENGINEERING' from 'Knowledge Gate'. The lecture begins by defining 'Empirical models' as estimation models that use empirically derived formulas for predicting based on LOC or FP. The instructor explains that different authors provide different mathematical formulas for these models. The slide states that out of all COCOMO models, the most versatile and universally accepted one is being discussed. The instructor, visible in a small window, begins to explain the concept, and the text 'E = 100 pm' is written on the screen, representing a formula for effort estimation.

  2. 2:00 – 4:49 02:00-04:49

    The lecture transitions to the COCOMO (1981) model, which is described as the most widely used estimating technique. The instructor explains it is a regression-based model developed by Barry Boehm, which postulates three important classes of software. The slide lists these as Organic (application), Semidetached (utility), and Embedded (system). The instructor elaborates on the classification criteria, stating that product characteristics and development team characteristics are considered. Examples are given: data processing and scientific programs are applications, while compilers and linkers are utilities. The slide also mentions that the relative complexity of these three categories is in the ratio 1:3:9 for application, utility, and system programs, respectively. The instructor continues to explain the model's application, with the 'E = 100 pm' formula remaining visible on the screen as a key example.

The video presents a structured lesson on software cost estimation, progressing from the general concept of empirical models to the specific, widely-accepted COCOMO framework. It establishes the foundational idea that estimation relies on formulas derived from past data, then narrows the focus to COCOMO as the premier model. The core of the lesson is the classification of software into three distinct types—Organic, Semidetached, and Embedded—based on their complexity and development context. This classification is crucial for applying the COCOMO model correctly, as it dictates the parameters used in the estimation formula, which is exemplified by the 'E = 100 pm' equation. The synthesis of these concepts provides a clear methodology for estimating software project effort.

Loading lesson…