recategorized by
136 views

1 Answer

5 votes
5 votes

In this we have to perform bitwise oprations like bitwise OR, bitwise AND, bitwise Ex-OR.


a) 1 1000 ∧ (0 1011 ∨ 1 1011)

0 1011 ∨ 1 1011 = 1 1011

1 1000 $\wedge$ 1 1011 = 1 1000

So, 1 1000 ∧ (0 1011 ∨ 1 1011) = 1 1000


b) (0 1111 ∧ 1 0101) ∨ 0 1000

0 1111 ∧ 1 0101 = 0 0101

0 0101 $\vee$ 0 1000 = 0 1101

So, (0 1111 ∧ 1 0101) ∨ 0 1000 = 0 1101


c) (0 1010 ⊕ 1 1011) ⊕ 0 1000

0 1010 ⊕ 1 1011 = 1 0001

1 0001 ⊕ 0 1000 = 1 1001

So, (0 1010 ⊕ 1 1011) ⊕ 0 1000 = 1 1001


d) (1 1011 ∨ 0 1010) ∧ (1 0001 ∨ 1 1011)

1 1011 ∨ 0 1010 = 1 1011

1 0001 ∨ 1 1011 = 1 1011

1 1011 $\wedge$ 1 1011 = 1 1011

So, (1 1011 ∨ 0 1010) ∧ (1 0001 ∨ 1 1011) = 1 1011


 

Related questions

277
views
1 answers
0 votes
532
views
1 answers
0 votes
garvit_vijai asked Sep 11, 2018
532 views
While evaluating the expression tree, if the left or right child is not present then the value of that particular missing child is taken as 0?Have a look at this ... option c but by this approach, I am getting option (d) as the answer.
683
views
0 answers
1 votes
iarnav asked Nov 19, 2017
683 views
To evaluate an expression with any embedded function call at any time how many stacks are needed?
1.4k
views
1 answers
1 votes