Interested to Buy Any Domain ? << Click Here >> for more details...
A, B and C are 8 bit nos. They are as follows:
A 1 1 0 1 1 0 1 1
B 0 1 1 1 1 0 1 0
C 0 1 1 0 1 1 0 1
Find ( (A-B) u C )=?
how to solve this need with steps
- 5 Answers
- 24163 Views
- TCS, I also Faced
- E-Mail Answers
Answer Posted / mohanakrishna
first find two's compliment of B
i.e,B= 01111010
1's complient of B=10000101
+1
B' =10000110
THEN ADD A WITH B' which implies (A-B)=01100001
then apply (A-B)UC=01101101=109
| Is This Answer Correct ? | 15 Yes | 3 No |
Post New Answer View All Answers
What is the purpose of
Always use scope terminator like End-If with IF, End- Evaluate with Evaluate statement.Can somebody explain me the detail logical explanation?
where is available in this mantis toturials?
pleasew define carrier scope in abap (sap).
Given an array all of whose elements are positive numbers, find the maximum sum of a subsequence with the constraint that no 2 numbers in the sequence should be adjacent in the array. So 3 2 7 10 should return 13 (sum of 3 and 10) or 3 2 5 10 7 should return 15 (sum of 3, 5 and 7)
What sysoption determines where the macro facility searches a specific catalog for complied macro?
can we extend a class having only one parameterised constructor.Suggest the process to do it.
how do we provide security for web services
what is the filters in biztakk server? where it can use?
Can any one give an example (Source Code) on virtual function implemetation in Java?
how can we maintain the previous version scripts to new version.
what is dot net framework
Write a program to swap the content of two variables without using a third variable.
I want sample papers for NIC Examination. Plz send them to my mail Id das.neelam@gmail.com . Plz send it today, tomorrow i've the exam.
You are given a dictionary of all valid words. You have the following 3 operations permitted on a word: delete a character, insert a character, replace a character. Now given two words - word1 and word2 - find the minimum number of steps required to convert word1 to word2. (one operation counts as 1 step.)
