- Option : A
- Explanation :

fun1(char *s1, char *s2)

function scope is local, so the value changed So the affect actual parameters. SO the values will be ‘Hi Bye’.

fun2(char **s1, char **s2)

In this function value is pointer to pointer, so it changes pointer of the actual value. So values will be ‘Bye Hi’

You must be logged in to post a comment.

- Option : A
- Explanation :

∀ are always True and ∃ are always False for empty sets.

So there exists at least one model with universe of size 3 (or less than). Therefore, option (A) is necessarily TRUE.

You must be logged in to post a comment.

You must be logged in to post a comment.

- Option : B
- Explanation :

MM space = 2^{P}bytes

Physical Address (PA) size = P bits

CM size = 2^{N}bytes

Block size 2^{M}words

2^{M}words*2^{W}bytes/word

2^{M+W}bytes

Number of lines = (CM size)/Block size ⇒ 2^{N}/(2^{M+W})

⇒ 2^{N-M-W}

Number of sets = (Number in cm)/P-way

= 2^{N-M-W}/K

The Address format

⇒ (N-M-W-log_{2}K)

∴ Tag size

⇒ P-(N-M-W-log_{2}K)

⇒ P-N+log_{2}K)

You must be logged in to post a comment.

You must be logged in to post a comment.

- Option : D
- Explanation :

Here the match flowing.

I. Membership problem for RE → undecidable

II. Regularity problem for RE → undecidable

III. Equivalence problem for RE → undecidable

IV. Since DPDA P exists for every nfa N and equivalent to it, this problem is trivially decidable.

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.