Computer Sciences > Gate 2015 Set-2 > Software Engineering
Consider the basic COCOMO model where E is the effort applied in person-months, D is the development time in chronological months, KLOC is the estimated number of delivered lines of code (in thousands) and ab, bb, cb, db have their usual meanings. The basic COCOMO equations are of the form.
A
E = ab(KLOC) exp(bb), D = cb(E) exp(db)
B
D = ab(KLOC) exp(bb), E = cb(D) exp(db)
C
E = abexp(bb), D = cb(KLOC) exp(db)
D
E = abexp(db), D = cb(KLOC) exp(bb)

Explanation

Correct : Software Engineering

Similar Questions

What is the worst-case time complexity of insertion in an AVL tree?
Question #23 Medium
Which operations on a binary search tree have O(h) complexity?
Question #31 Easy
Compare search complexities of sorted array vs balanced BST.
Question #47 Hard

Related Topics

Data Structures Binary Search Tree Time Complexity Algorithm Analysis Tree Algorithms Computer Science