Sample
Output:
|
Sr.
No. |
Juice |
|
0 |
Pena Colada |
|
1 |
Strawberry |
|
2 |
Pineapple |
|
3 |
Mango |
|
4 |
Orange |
|
5 |
Cookies and cream Milk shake |
|
6 |
Coffee Milkshake |
|
7 |
Candy Flavor Milkshake |
The
availability of these 8 flavors can be represented in the form of an 8-bit
status string e.g. “11111111” where each bit “1” from left to right represents
the availability of each flavor in the table from top to bottom respectively.
The left-most bit represents the availability status of Pena Colada and the
right-most bit represents the availability of Candy Flavor Milkshake. In the status string, “1” means the flavor is
available and the unavailability of a flavor will be represented by “0” at the
respective bit position.
Considering
the above scenario, perform the following operations:
A.
Assuming that all the flavors were available in
the morning. If the juices at serial no. 3 and 5 in the table are finished at
2:00 PM, compute the new status string by using the appropriate logical
operation.
B.
If the availability status string of juices and
shakes is “10101001” at 4:00 PM, check the availability of the “Coffee Milk
Shake” using the appropriate logical operation:
Solution:
|
Sr. No |
0 |
1 |
2 |
3 |
4 |
5 |
6 |
7 |
|
Juice |
Pena Colada |
Strawberry |
Pineapple |
Mango |
Orange |
Cookies and cream Milk shake |
Coffee Milkshake |
Candy Flavor Milkshake |
|
Morning Status |
1 |
1 |
1 |
1 |
1 |
1 |
1 |
1 |
|
Status After 2 PM |
1 |
1 |
1 |
0 |
1 |
0 |
1 |
1 |
|
Status After 2 PM (AND Operation) |
1 |
1 |
1 |
0 |
1 |
0 |
1 |
1 |
|
Status at 4 PM |
1 |
0 |
1 |
0 |
1 |
0 |
0 |
1 |
|
Final Status |
1 |
0 |
1 |
0 |
1 |
0 |
0 |
1 |
Coffee
Milkshake is not available
Download CS101 Assignment 2 Solution in PDF Free
Want more info, please press the below button
`
.webp)
0 Comments
Please write us. Please write in detail that how may we help you