The following circuit compares two 2-bit binary numbers, X and Y represented by X1X0 and Y1Y0 respectively. ( X0 and Y0 represent Least Significant Bids) Under […]
Question 25 Let R(A,B,C,D) be a relational schema with the following function dependencies A->B,B->C C->D and D->B The decomposition of R into (A,B)(B,C)(B,D) A gives a […]
Question 1 A set of Boolean connectives is functionally complete if all Boolean functions can be synthesized using those. Which of the following sets of connectives […]