ISRO Scientist/Engineer Question Paper Computer Science 2018

The time complexity of computing the t transitive ransitive closure of binary relation on a set of n elements is known to be

Given a binary-max heap. The elements are stored in an array as 25, 14, 16, 13, 10, 8, 12. What is the content of the array after two delete operations?

The Functions Point (FP) metric is

The lower degree of cohesion is kind of

What is the output of the following program?
main ( ){
int x = 2, y = 5;
if(x < y) return (x = x+y);
else printf (“z1”);
printf(“z2”);
}