Decomposition Based Estimation

Duration: 3 min

This video lesson is available to enrolled students.

Return to /learn/AMCAT-PREPARATION/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. Quantitative Ability: Percentage, Profit and Loss, Ratio and Proportion (Ratios), Average, Time and Work, Speed Time and Distance, Simple Interest and Compound Interest, Age Problems, Number System, Divisibility Rules, HCF LCM, Algebra, Permutation and Combination, Probability, Data Interpretation, Logarithm, Sequence and Series (Series), Powers and Exponents (Surds and Indices), Speed Mathematics and Basic Mathematics
  2. Logical Reasoning: Seating Arrangements, Puzzle Solving (Puzzles), Data Arrangement, Coding Decoding, Blood Relations, Directions (Direction Test), Ranking, Order and Sequence, Data Sufficiency, Venn Diagram, Inequality, Series (Number and Letter Series) (Numerical Relations and Reasoning), Logical Sequence Of Words, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Selection Decision Table (Decision Making), Analogy, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning)
  3. Verbal Ability: Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Subject Verb Agreement (Verb Noun Agreement), Tenses, Articles, Preposition, Conjunction, Modals, Active Passive Voice (Voice), Direct and Indirect Speech, Vocabulary, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Completion (Fill in the blanks), Sentence Correction (Error Correction), Cloze Test (Cloze Passage), Facts, Inference and Judgements
  4. Programming Fundamentals (Technical): C Fundamentals
  5. Data Structures (Technical): Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  6. Algorithms (Technical): Algorithm Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Time Complexity Analysis, Advanced Algorithms
  7. OOPs (Technical): Object Oriented Programming (OOPS)
  8. DBMS (Technical): Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, File Organization & Indexing, Relational Algebra, Relational Calculus, Transaction Management, Concurrency Control, Database Recovery, ORDBMS, Database Security & Authorization, Query Processing & Optimization, Enhanced Data Models, Data Warehousing & Mining, Big Data Systems, NoSQL
  9. SQL (Technical): SQL
  10. Operating Systems (Technical): Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Windows OS, Linux OS, Security, Distributed Systems, Virtual Machines
  11. Computer Networks (Technical): 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, Cloud Computing and IoT, Cyber and Info Security
  12. Software Engineering (Technical): Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  13. Coding/Automata Round: Coding Questions by Yash Sir, C Programming by Yash Sir, Programming in C++, Java, Python for Placements by Yash Sir, Pseudo Codes
  14. Personality / Behavioral Assessment: Behavioral Assessment (Behavioral Competency Profiling) (Psychometric Test)
  15. Writing Assessment: English Writing Ability
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…