Algorithms | Misc | Question 13

Last Updated :
Discuss
Comments

A set X can be represented by an array x[n] as follows: 

 


Consider the following algorithm in which x,y, and z are Boolean arrays of size n: 

C 
algorithm zzz(x[] , y[], z [])
{
   int i;
   for (i=O; i<n; ++i)
     z[i] = (x[i] ^ ~y[i]) V (~x[i] ^ y[i]) }

The set Z computed by the algorithm is:

(X Intersection Y)

(X Union Y)

(X-Y) Intersection (Y-X)

(X-Y) Union (Y-X)

This question is part of this quiz :

Top MCQs on Algorithms in DSA with Answers
Tags:
DSA Quiz
Share your thoughts in the comments
We use cookies to ensure you have the best browsing experience on our website. By using our site, you acknowledge that you have read and understood our Cookie Policy & Privacy Policy