Computing and Binary Operations 8

13. The decimal equivalent of the binary number 25. The octal equivalent of the binary number is
is
(a) (b)
(a) (b)
(c) (d)
(c) (d) 26. What is the decimal equivalent of the binary number 101010
[DCE 1999]
14. The binary equivalent of decimal number is
(a) 20 (b) 42
(a) (b) (c) 22 (d) 23
(c) (d) 27. The hexadecimal equivalent of the octal number is

15. The control unit and arithmetic logic unit is called (a) (b)
(a) Arithmetic Logic Unit (ALU) (c) (d)
(b) Central Processing Unit (CPU)
(c) Memory Unit 28. The decimal equivalent of octal number is
(d) Input Unit (a) (b)
16. The electronic components used in third generation of
computers are (c) (d)
(a) Vacuum tubes (b) Transistors 29. The decimal equivalent of binary number is
(c) Integrated circuit (d) All of the above
(a) (b)
17. RAM stands for
(a) Random Available Memory (c) (d)
(b) Right Available Memory 30. The decimal equivalent of binary number
(c) Random Access Memory
is
(d) All of the above
(a) (b)
18. The octal number 473 in the decimal representation is equal to
[DCE 1996] (c) (d)
(a) (b) 31. How many bytes are there in a kilobyte
(a) 512 (b) 1024
(c) (d) None of these
(c) 2048 (d) 4096
19. The binary equivalent of octal number is 32. How many bits are there in a byte
(a) 4 (b) 6
(a) (c) 8 (d) 12
(b) 33. An algorithm must terminate in [DCE 1997]
(a) One iteration
(c) (b) One step
(c) Finite number of steps
(d)
(d) Finite number of steps but sometimes in infinite number of
20. Binary equivalent of decimal number 0.3125 is steps
(a) 0101 (b) .1010
Binary operations
(c) .0101 (d) .1101
21. What is the decimal equivalent of the octal number 1217 1. Let S be a finite set containing n elements. Then the total
[DCE 1999] number of commutative binary operations on S is
(a) 640 (b) 620
(a) (b)
(c) 650 (d) 655
22. The octal equivalent of the decimal number is (c) (d)
(a) (b) 2. If S is a finite set having n elements, then the total number of
non-commutative binary operation on S is
(c) (d)
(a) (b)
23. The decimal equivalent of binary number is
(a) (b) (c) (d)

(c) (d) 3. If the composition table for a binary operation * defined on a

set S is symmetric about the leading diagonal, then
24. The octal equivalent of the binary number (a) * is associative on S
is (b) * is commutative on S
(a) (b) (c) S has the identity element for *
(d) None of these
(c) (d) 4. Subtraction of integers is an operation that is
 9 Computing and Binary Operations
[CET 1994] 5. Let z be the set of integers and o be a binary operation on z
(a) Commutative and associative defined as for all . The inverse
(b) Not commutative but associative
of an element is
(c) Neither commutative nor associative
(d) Commutative but not associative
(a) (b)
5. The law is called
(a) Closure law (b) Associative law
(c) Commutative law (d) Distributive law (c) (d) None of these
6. If any one of the rows of the composition table for a binary
operation * on a set S coincides with the top most row of the
table, then
(a) S has a left identity for *
(b) S has a right identity for *
(c) S has the identity element for *
(d) * is commutative and associative on S
7. If any one of the columns of the composition table for a binary
operation * on a set S coincides with the left most column of Computing
the table, then
(a) S has a left identity for * 1 a 2 c 3 c 4 c 5 b
(b) S has a right identity for *
6 b 7 a 8 a 9 b 10 b
(c) S has the identity element for *
(d) * is commutative and associative on S 11 d 12 b 13 d 14 a 15 b
8. Which of the following binary operations is commutative
16 c 17 c 18 c 19 b 20 c
(a) * on R, given by
(b) o on R, given by 21 d 22 a 23 d 24 b 25 d

(c) on P(S), the power set of a set S given by 26 b 27 b 28 c 29 b 30 a

31 b 32 c 33 c
(d) None of these
9. Let S be a finite set containing n elements. Then the total
number of binary operations on S is [EAMCET 1992] Binary operations
(a) (b)
1 a 2 b 3 b 4 c 5 c
(c) (d)
6 a 7 b 8 c 9 c 10 a
10. Define * is defined on the set of real numbers by
. Then the operation * is [CET 1991]
(a) Commutative but not associative Critical Thinking Questions
(b) Associative but not commutative
(c) Neither commutative nor associative 1 c 2 c 3 a 4 b 5 a
(d) Both commutative and associative

1. REPEAT-UNTIL control operation executes the loop at least

[DCE 1996] Computing
(a) 3 times (b) 2 times
1. (a) The basic control operation will be sequential, as there is
(c) 1 time (d) None of these no need of selection and repetition.
2. (1101101)2 is [DCE 2001]
2. (c) A computer executes a program, not an algorithm or a
(a) 81 (b) 121 flow-chart.
(c) 109 (d) 92 3. (c) A basic control structure always has one entry and one exit
3. The decimal equivalent of (264)8 is [DCE 1995] points.
(a) 180 (b) 170 4. (c) Central processing unit is the heart of a computer.
(c) 166 (d) None of these 5. (b) An algorithm must have at least one output.
4. What is the hexadecimal equivalent of decimal number 785 6. (b) It is obvious.
[DCE 1994]
7. (a) It is obvious.
(a) 1A2 (b) 311
8. (a) It is obvious.
(c) AB5 (d) None of these
9. (b) It is obvious.
 Computing and Binary Operations 10

10. (b) 0
= 1
= 16 + 0 + 4 + 0 + 1 = 21. (LSB)
11. (d) (101001110)2 = (……)8
For octal system we group the digits into triplets from the .
left.
Given number = = 21. (d)
(516)8.
12. (b) .
22. (a)
.
1 (MSB)
13. (d)
6
3
1
4
6
(LSB)
Upto 6 decimal places.
upto 6 decimal places.
.
23. (d)
14. (a)
Carry
1
(MSB)
0
1
.
0
1 24. (b)
(LSB) 101 001 100

15. (b) Central Processing Unit (CPU).

5 1 4
16. (c) Integrated Circuit.
17. (c) Random Access Memory.
18. (c) .
25. (d)

. 001 101 . 011

19. (b)

1 5 3
5 4 7 3  6 4
101 100 111 011  110 100 .

. 26. (b)

20. (c)
0 (MSB)
.
1
27. (b)
 11 Computing and Binary Operations
100 011 010 No. of commutative binary operations
(0101 0001 1010)2 = No. of functions subject to (i)

= times = .
5 1 A
2. (b) Total no. of binary operations on S.
= No. of functions
.
= =
28. (c) =
No. of non-commutative binary operations
= (Total no. of binary operations) – (No. of commutative
binary operations)

= .
.
3. (b) When the composition table for a binary operation * on the
29. (b) set S is symmetrical about the leading diagonal, then

* is commutative on S.

4. (c) Let , then for operation –,

 Subtraction is not commutative

. Subtraction is not associative.

30. (a) 5. (c) is called commutative law.
6. (a) When any one of the rows of the composition table for a
binary operation * on a set S coincides with the top most
row of the table.


.
  is the left identity for *.
31. (b) A kilobyte consists of 1024 bytes. S has a left identity for *.
32. (c) A byte consists of 8 bits. 7. (b) For the given condition,
33. (c) It is obvious. ,

Binary Operations
 is the right identity for *.
1. (a) Let S has a right identity for *.
8. (c)
For commutative operations, …..(i)
and ,
, ……n
.
where * represents a binary operation.
Number of distinct elements in S×S i.e., * is not commutative on R.
Next,
subject to the condition (i)

o is not commutative
=
 Computing and Binary Operations 12
on is commutative.
9. (c) Since a binary operation on S is a function from S × S to S,
therefore the total number of binary operations on S is the
total number of functions from S × S to S, which is .

10. (a) We have

So, * is commutative on R.
For any, a, b, c R, we have

and

So, * is not associative on R.

Critical Thinking Questions

1. (c) It is obvious.
2. (c)
=

= 64 + 32 + 0 + 8 + 4 + 0 + 1 = 109.
3. (a) (264)8 = (.......)10 =
= 128 + 48 + 4 = 180.
4. (b) (785)10 = (........)16

Thus .
5. (a) Let e be the identity element for the binary operation o
defined on z given by
Then for all
 for all  for
all  .
So, 0 is the identity element for the binary operation o on
z.
Let x be the inverse of . Then,

 

Thus, is the inverse of .