Scribd
Upload
0 views

Assignment 1 Computer fundamentals

The document outlines an assignment for a Computer Fundamentals course, consisting of various tasks related to number base conversions, binary operations, Boolean algebra, and algorithm design. It includes exercises on converting numbers between different bases, performing arithmetic operations in binary and hexadecimal, simplifying Boolean expressions, and writing algorithms with flowcharts. The assignment aims to assess students' understanding of fundamental concepts in computer science and digital logic.

Uploaded by

mayodittiwari.123
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
0 views

Assignment 1 Computer fundamentals

The document outlines an assignment for a Computer Fundamentals course, consisting of various tasks related to number base conversions, binary operations, Boolean algebra, and algorithm design. It includes exercises on converting numbers between different bases, performing arithmetic operations in binary and hexadecimal, simplifying Boolean expressions, and writing algorithms with flowcharts. The assignment aims to assess students' understanding of fundamental concepts in computer science and digital logic.

Uploaded by

mayodittiwari.123
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

Submission date 12-11-2024

Assignment 1
Computer Fundamentals (CS 1003)

1. Convert the following numbers with the indicated bases to decimal:


(a) (4310) 5 (b) (198) 12 (c) (435)8 (d) (345)6
2. Determine the base of the numbers in each case for the following operations to be correct:
(a) 14/2 = 5 (b) 54/4 = 13 (c) 24 + 17 = 40.
3. Convert the hexadecimal number 64CD to binary, and then convert it from binary to octal.
4. Convert the decimal number 431 to binary in two ways:
(a) convert directly to binary;
(b) convert first to hexadecimal and then from hexadecimal to binary. Which method is faster?
5. Express the following numbers in decimal:
(a) (10110.0101)2 (b) (26.24)8 (c) (16.5)16 (d) (DADA.B)16 (e) (1010.1101)2
6. Perform the following division in binary: 111011 ÷ 101.
7. Add and multiply the following numbers without converting them to decimal.
(a) Binary numbers 1011 and 101. (b) Hexadecimal numbers 2E and 34.
8. Obtain the 1’s and 2’s complements of the following binary numbers:
(a) 00010000 (b) 00000000 (c) 11011010 (e) 10000101 (d) 10101010 (f) 11111111.
9. Find the 9’s and the 10’s complement of the following decimal numbers:
(a) 25,478,036 (b) 63, 325, 600 (c) 25,000,000 (d) 00,000,000.
10. Find the 16’s complement of C3DF.
11. Perform subtraction on the given unsigned binary numbers using the 2’s complement of the
subtrahend.
(a) 10011 - 10010 (b) 100010 – 100110 (c) 1001 - 110101 (d) 101000 – 10101
12. Express the following function as a sum of minterms and as a product of maxterms:
𝐹(𝐴, 𝐵, 𝐶, 𝐷) = 𝐵̅𝐷 + 𝐴̅𝐷 + 𝐵𝐷
13. Draw the logic diagram corresponding to the following Boolean expressions without simplifying
them:
(a) 𝐵𝐶̅ + 𝐴𝐵 + 𝐴𝐶𝐷
(b) ( 𝐴 + 𝐵)(𝐶 + 𝐷)(𝐴̅ + 𝐵 + 𝐷)
(c) ( 𝐴𝐵 + 𝐴̅𝐵̅)(𝐶𝐷 ̅ + 𝐶̅ 𝐷 )
14. Simplify the following Boolean expressions, using three-variable maps:
(a) 𝐹(𝑥, 𝑦, 𝑧) = 𝑥𝑦 + 𝑥̅ 𝑦̅ 𝑧̅ + 𝑥̅ 𝑦𝑧̅ (b) 𝐹(𝑥, 𝑦, 𝑧) = 𝑥̅ 𝑦̅ + 𝑦𝑧 + ̅𝑥 𝑦𝑧̅
(c) 𝐹(𝑥, 𝑦, 𝑧) = 𝑥̅ 𝑦 + 𝑦𝑧̅ + 𝑦̅𝑧̅ (d) 𝐹(𝑥, 𝑦, 𝑧) = ̅𝑥 𝑦𝑧 + 𝑥𝑦̅𝑧̅ + 𝑥𝑦̅𝑧
15. Simplify the following Boolean functions, using four-variable maps:
(a) 𝐹(𝑤, 𝑥, 𝑦, 𝑧) = ∑ 𝑚 (1, 4, 5, 6, 12, 14, 15)
(b) 𝐹(𝐴, 𝐵, 𝐶, 𝐷) = ∑ 𝑚(2, 3, 6, 7, 12, 13, 14)
(c) 𝐹(𝑤, 𝑥, 𝑦, 𝑧) = ∑ 𝑚(1, 3, 4, 5, 6, 7, 9, 11, 13, 15)
(d) 𝐹(𝐴, 𝐵, 𝐶, 𝐷) = ∑ 𝑚(0, 2, 4, 5, 6, 7, 8, 10, 13, 15)
16. Simplify the following Boolean functions:
(a) 𝐹(𝐴, 𝐵, 𝐶, 𝐷) = ∏(11, 3, 5, 7, 13, 15)
(b) 𝐹(𝐴, 𝐵, 𝐶, 𝐷) = ∏(11, 3, 6, 9, 11, 12, 14)
17. Write algorithm, pseudo code and draw flowchart for the following:
a) Swapping of any two numbers.
b) Calculation of factorial of any number.
c) Addition of all even number from 0 to 50.
d) Sorting the numbers in ascending order.
e) Conversion of any number from decimal to binary.

You might also like