- Option : B
- Explanation :

In Schema II : Registration (rollno, courseid,

email)

Non-trivial functional dependencies:

{ rollno, courseid → email

email → rollno }

candidate keys

{rollno, courseid,}

email courseid}

Given relation is in 3NF but not in BCNF.

You must be logged in to post a comment.

42. Consider the following C program:

int counter = 0;int calc(int a, int b) {

int c;

counter++;

if (b == 3)

return (a * a * a);

&emp;else {

c = calc(a, b / 3);

return (c * c * c);

}

}

int main() {

calc(4, 81);

printf("%d", counter);

}

The output of this program is ________ .

Note – Numerical Type question.

- Option : B
- Explanation :

You must be logged in to post a comment.

You must be logged in to post a comment.

- Option : A
- Explanation :

Given,

Number of processes (P) = 3

Number of resources (R) = 4

Since deadlock-free condition is:

R ≥ P(N − 1) + 1

Where R is total number of resources,

P is the number of processes, and

N is the max need for each resource.

4 ≥ 3(N − 1) + 1

3 ≥ 3(N − 1)

1 ≥ (N − 1)

N ≤ 2

Therefore, the largest value of K that will always avoid deadlock is 2.

Option (A) is correct.

You must be logged in to post a comment.

You must be logged in to post a comment.

- Option : B
- Explanation :

Given |G| = 84

Solutions:

By Lagrang’s theorem any subgroup size is a divisior of 84.

But a proper subgroup cannot have same size as group.

So largest divisor of 84, other than 84 is 42.

So, largest proper subgroup can have in size of 42.

You must be logged in to post a comment.

You must be logged in to post a comment.

You must be logged in to post a comment.