Detailed cocomo

Duration: 2 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-detailed-cocomo 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 project estimation models, presented by an instructor from Knowledge Gate. It begins with an introduction to the Detailed COCOMO model, which is described as the most comprehensive and accurate model for estimating software projects. The model's definition is provided, highlighting that it divides a project into multiple components or modules and accounts for interactions between cost drivers and project phases. The lecture explains that the model estimates effort and duration for each component using the Intermediate COCOMO model and then sums these up. It also notes that the Detailed COCOMO model considers factors such as software reuse, hardware constraints, and personnel/team attributes. The presentation then transitions to a slide titled 'Other Empirical models,' which lists several formulas for estimating effort (E) based on the number of lines of code (KLOC). These include the Watson & Felix Model (E = 5.2 x KLOC^0.91), the Bailey-Basili Model (E = 5.2 + 0.73 x KLOC^1.16), the Simple Boehm Model (E = 3.2 x KLOC^1.05), and the Doty Model (E = 5.288 x KLOC^1.047). The video concludes with a 'Thanks for watching' screen.

Chapters

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

    The video starts with a title card for 'SOFTWARE ENGINEERING' and '#knowledgegate'. It then transitions to a lecture slide titled 'Detailed COCOMO'. The instructor, Sanchit Jain, explains the definition of the Detailed COCOMO model, which is described as the most comprehensive and accurate model that divides a software project into multiple components or modules and accounts for interactions between cost drivers and project phases. The slide lists that the model estimates effort and duration for each component using the Intermediate COCOMO model and then sums them up, and it considers software reuse, hardware constraints, and personnel/team attributes. The presentation then moves to a slide titled 'Other Empirical models', which displays several formulas for effort estimation: E = 5.2 x KLOC^0.91 (Watson & Felix Model), E = 5.2 + 0.73 x KLOC^1.16 (Bailey-Basili Model), E = 3.2 x KLOC^1.05 (Simple Boehm Model), and E = 5.288 x KLOC^1.047 (Doty Model). The video ends with a 'Thanks for watching' screen.

The lecture provides a structured overview of software estimation techniques, starting with the most detailed model, Detailed COCOMO, which emphasizes a component-based approach and considers multiple project factors. It then contrasts this with a set of simpler, empirical models that use a direct mathematical relationship between effort and lines of code. This progression highlights the difference between a comprehensive, multi-factor model and more straightforward, formulaic approaches, giving students a comparative understanding of estimation methodologies.

Loading lesson…