Introduction to Computing Total marks = 20

(CS101)
Assignment # 01 30 November 2020
Fall 2020

Please carefully read the following instructions before attempting the assignment.

RULES FOR MARKING

It should be clear that your assignment would not get any credit if:
▪ The assignment is submitted after the due date.
▪ The submitted assignment does not open or the file is corrupt.
▪ Strict action will be taken if the submitted solution is copied from any other
student or the internet.

You should consult the recommended books to clarify your concepts as handouts are not
sufficient.

You are supposed to submit your assignment in Doc or Docxformat.

Any other formats like scan images, PDF, ZIP, RAR, PPT, and BMP,etc will not be accepted.

Objectives:
• To understand the practical implementation of the Number System.
• To understand the basic concept of Boolean Logical Operations and how to use it
to solve a problem.

NOTE
No assignment will be accepted after the due date via email in any case (whether it is the
case of load shedding or internet malfunctioning etc.). Hence refrain from uploading
assignments in the last hour of the deadline. It is recommended to upload the solution file
at least two days before its closing date.

If you find any mistake or confusion in the assignment (Question statement), please
consult with your instructor before the deadline. After the deadline, no queries will be
entertained in this regard.

For any query, feel free to email at:

[email protected]
 QuestionsNo 01 Marks (10)

Convert the following decimal numbers into equivalent binary numbers and then convert the
binary answer back into equivalent decimal. Show all the steps of conversions.

• 4789

2 4789
2 2394 - 1
2 1197 - 0
2 598 - 1
2 299 - 0
2 149 - 1
2 74 - 1
2 37 - 0
2 18 - 1
2 9 - 0
2 4 - 1
2 2 - 0
2 1 - 0

(4789)10 = (1001010110101)2

(1001010110101)₂ = (1 × 2¹²) + (0 × 2¹¹) + (0 × 2¹⁰) + (1 × 2⁹) + (0 × 2⁸) + (1 × 2⁷) + (0 × 2⁶) + (1 ×2⁵)

+ (1 × 2⁴) + (0 × 2³) + (1 × 2²) + (0 × 2¹) + (1 × 2⁰) = (4789)₁₀
(1001010110101)2= (4789)10
 • -8735
2 8735
2 4367 - 1
2 2183 - 1
2 1091 - 1
2 545 - 1
2 272 - 1
2 136 - 0
2 68 - 0
2 34 - 0
2 17 - 0
2 8 - 1
2 4 - 0
2 2 - 0
2 1 - 0
(8735)10 = (10001000011111)2
Now, we will take two’s complement of resultant binary number to get the equivalent of -8735
after extending it to 16-bit.

Original Binary 0 0 1 0 0 0 1 0 0 0 0 1 1 1 1 1
Number
1’s Complement 1 1 0 1 1 1 0 1 1 1 1 0 0 0 0 0
Adding 1 1
2’s Complement 1 1 0 1 1 1 0 1 1 1 1 0 0 0 0 1

Hence, (-8735)10 = (1101110111100001)2

To convert it back, we first convert a 2’s complement number to a normal binary form. For that,
we will first subtract 1 from the 2’s complement number and at the end will get the inverse of
the number to form the final required normal binary number.

2’s Complement Number 1 1 0 1 1 1 0 1 1 1 1 0 0 0 0 1

Subtract 1 1
1’s Complement 1 1 0 1 1 1 0 1 1 1 1 0 0 0 0 0
Take Inverse of 1’s Complement 0 0 1 0 0 0 1 0 0 0 0 1 1 1 1 1

(0010001000011111)2 = (8735)10

(10001000011111)₂ = (1 × 2¹³) + (0 × 2¹²) + (0 × 2¹¹) + (0 × 2¹⁰) + (1 × 2⁹) + (0 × 2⁸) + (0 × 2⁷) + (0 ×

2⁶) + (0 × 2⁵) + (1 × 2⁴) + (1 × 2³) + (1 × 2²) + (1 × 2¹) + (1 × 2⁰) = (8735)₁₀
(0010001000011111)2 = (8735)10
 Questions No 02 Marks (10)

Solve the given Boolean Expression by using a truth table.

(𝑨 ⊕ 𝑫). (𝑨 + 𝑩). ((𝑩̅+𝑪 ̅ ) ⊕ (𝑩 + 𝑪 + 𝑫))

(𝑨 ⊕ 𝑫)
.
̅ +𝑪
(𝑩 ̅) (𝑨 ⊕ 𝑫) (𝑨 + 𝑩)
A B C D 𝑨⊕𝑫 𝑨+𝑩 ̅ +𝑪
(𝑩 ̅) (𝑩 + 𝑪 + 𝑫) ⊕ . .
(𝑩 + 𝑪 + 𝑫) (𝑨 + 𝑩) ̅ ̅)
((𝑩 + 𝑪
⊕
(𝑩 + 𝑪 + 𝑫))
0 0 0 0 0 0 1 0 1 0 0
0 0 0 1 1 0 1 1 0 0 0
0 0 1 0 0 0 1 1 0 0 0
0 0 1 1 1 0 1 1 0 0 0
0 1 0 0 0 1 1 1 0 0 0
0 1 0 1 1 1 1 1 0 1 0
0 1 1 0 0 1 0 1 1 0 0
0 1 1 1 1 1 0 1 1 1 1
1 0 0 0 1 1 1 0 1 1 1
1 0 0 1 0 1 1 1 0 0 0
1 0 1 0 1 1 1 1 0 1 0
1 0 1 1 0 1 1 1 0 0 0
1 1 0 0 1 1 1 1 0 1 0
1 1 0 1 0 1 1 1 0 0 0
1 1 1 0 1 1 0 1 1 1 1
1 1 1 1 0 1 0 1 1 0 0