5 years ago in UGC CS - December 2012

# The maturity levels used to measure a process are

[A] Initial, Repeatable, Defined, Managed, Optimized.
[B] Primary, Secondary, Defined, Managed, Optimized.
[C] Initial, Stating, Defined, Managed, Optimized.
[D] None of the above

## Overall Stats

Attempted 17
Correct 8
Incorrect 6
Viewed 3

Srusti Lingaraju - 1 month ago

Srusti Lingaraju is saying Initial, Repeatable, Defined, Managed, Optimized. is correct answer

Raghuveer Dhakad - 2 years ago

Raghuveer Dhakad from Delhi, India is saying Initial, Repeatable, Defined, Managed, Optimized. is correct answer

Mushkin - 2 years ago

Mushkin from Anantapur, India is saying Initial, Stating, Defined, Managed, Optimized. is correct answer

suresh 1547 - 2 years ago

suresh 1547 from India is saying Primary, Secondary, Defined, Managed, Optimized. is correct answer

purushotham - 2 years ago

purushotham from India is saying Primary, Secondary, Defined, Managed, Optimized. is correct answer

## Related Questions

### The maximum number of keys stored in a B-tree of order m and depth d is

• [A] md + 1 �?? 1
• [B] md+1 �?? 1 / m �?? 1
• [C] (m �?? 1) (md + 1 �?? 1)
• [D] md �?? 1 / m �?? 1

### Given a Relation POSITION (Posting-No, Skill), then query to retrieve all distinct pairs of posting-nos. requiring skill is

• [A] Select p.posting-No, p.posting-
No
from position p
where p.skill = p.skill
and p.posting-No < p.posting-No
• [B] Select p1.posting-No, p2.posting-
No
from position p1, position p2
where p1.skill = p2.skill
• [C] Select p1.posting-No, p2.posting-
No
from position p1, position p2
where p1.skill = p2.skill
and p1.posting-No < p2.posting-
No
• [D] Select p1.posting-No, p2.posting-
No
from position p1, position p2
where p1.skill = p2.skill
and p1.posting-No = p2.posting-
No

### In which tree, for every node the height of its left sub-tree and right sub-tree differ almost by one?

• [A] Binary Search Tree
• [B] AVL Tree
• [C] Threaded Binary Tree
• [D] Complete Binary Tree

### Which of the following is true ?

• [A] A relation in BCNF is always in 3NF.
• [B] A relation in 3NF is always in BCNF.
• [C] BCNF and 3NF are same.
• [D] A relation in BCNF is not in 3NF.

• [A] OR
• [B] NOR
• [C] EX-NOR
• [D] NAND