this is basically binary operation
n-intersection i.e.LOGICAL AND
U -union i.e. LOGICAL OR
AnB= 01011010
((AnB)uC)=01111111
A, B and C are 8 bit nos. They are as followsA -> 1 1 0 0 0 1 0 1B -> 0 0 1 1 0 0 1 1C -> 0 0 1 1 1 0 1 0 ( - =minus, u=union)Find ((A - C) u B) =?
A and B are shooters and having their exam. A and B fall short of 10 and 2 shots respectively to the qualifying mark. If each of them fired atleast one shot and even by adding their total score together, they fall short of the qualifying mark, what is the qualifying mark?
A,B and C are 8 bit nos.they are as followsA=11000101B=00110011C=00111010find ((A-C)UB)
A bus started from bus stand at 8.00a m and after 30 min staying atdestination, it returned back to the bus stand. the destination is 27miles from the bus stand. the speed of the bus 50 percent fast speed.at what time it retur4ns to the bus stand?
What is the answer for that A, B and C are 8 bit nos. They are as followsA -> 1 1 0 0 0 1 0 1B -> 0 0 1 1 0 0 1 1C -> 0 0 1 1 1 0 1 0 ( - =minus, u=union)Find ((A - C) u B) =?
LCM of x and y is 36 and HCF of x and y is 4. If x = 4 then which of the following is definitely not true?a) Y is divisible by 3b) Y is divisible by 6c) Y is divisible by 9d) X+Y is divisible by
How many positive integer solutions does the equation 2x+3y = 100 have?a) 50b) 33c) 16d) 35
My flight takes of at 2am from a place at 18N 10E and landed 10 Hrs later at a place with coordinates 36N70W. What is the local time when my plane landed?a) 600 am b) 640am c) 740 d) 700 e) 800
A has some no. of sons & daughters.each son has sisters as twice as brother(s).each daughter has sisters as brothers.how many children A has?
A programs reads "The man and the boyrn" from a file using fgets() and stores it in str[]. Then the string stored in str isA. "The man and the boyrn"B. "The man and the boyr"C. "The man and the boyn"D. "The man and the boy"
rendc.org
Whether it is technological solutions or user-oriented innovations, We have put together for you the best sources of HR Interview Questions and Answers, Tech Ideas, and Programming Tutorials."
Get all the latest information on rendc.org
© 2022 | All rights reserved.
RENDC
welcome to www.rendc.org
