Decomposition Based Estimation

Duration: 3 min

This video lesson is available to enrolled students.

Return to /learn/ISRO/software-engineering/software-design-estimation-and-metrics/software-project-estimation/asset-decomposition-based-estimation 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 video is an educational lecture on software engineering estimation techniques, presented by an instructor from Knowledge Gate. The first segment introduces 'Decomposition based estimation' as a method for large projects, explaining that it involves breaking down a problem into smaller parts. It details two primary approaches: 'Direct Estimation (White Box)', which uses size-oriented metrics like KLOC (thousands of lines of code), and 'Indirect Estimation (Black Box)', which uses function-oriented metrics like FP (function points). The second segment transitions to a set of fundamental formulas for project estimation, including Effort = Size / Productivity, Cost = Effort X Pay, and Duration = Effort / Team Size. The instructor uses a whiteboard to write and explain these equations, which are displayed on the screen. The video concludes with a 'Thanks for Watching' screen.

Chapters

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

    The video opens with a title card for 'SOFTWARE ENGINEERING' and '#knowledgegate'. It then transitions to a slide titled 'Decomposition based estimation'. The instructor explains that this method is used for large projects by decomposing them into smaller problems. The slide lists two estimation bases: 'Direct Estimation (White Box): Size oriented metrics (KLOC)' and 'Indirect Estimation (Black Box): Function oriented metrics (FP)'. The instructor, visible in a small window, elaborates on these concepts, with the on-screen text clearly defining the terms and their acronyms.

  2. 2:00 – 2:47 02:00-02:47

    The slide changes to display a list of formulas for project estimation. The instructor explains the relationships between key project variables. The formulas shown are: Effort = Size / Productivity, Productivity = Size / Effort, Size = Effort X Productivity, Cost = Effort X Pay, Duration = Effort / Team Size, Team Size = Effort / Duration, and Effort = Duration X Team Size. The instructor writes these equations on the whiteboard, and the text is clearly visible on the screen. The video ends with a 'THANKS FOR WATCHING' screen.

The lecture progresses from a high-level introduction to software estimation methods to the specific, quantitative formulas used to calculate project effort, cost, and duration. It first establishes the conceptual framework of decomposition-based estimation, distinguishing between direct (size-based) and indirect (function-based) methods. It then provides the core mathematical relationships that allow a project manager to derive one variable from others, forming the basis of a practical estimation process. The flow moves from theory to application.

Loading lesson…