The large energy cost of memory fetches limits the overallefficiency of applications no matter how efficient the accelerators are on the chip. As a result the most importantoptimization must be done at the algorithm level, to reduce offchip memory accesses, to createDark Memory. The algorithmsmust first be (re)written for both locality and parallelism beforeyou tailor the hardware to accelerate them.Using Pareto curves in theenergy/opandmm2/(op/s)spaceallows one to quickly evaluate different accelerators, memorysystems, and even algorithms to understand the tradeoffsbetween performance, power and die area. This analysis isa powerful way to optimize chips in the Dark Silicon era.
SOLVED CS302 Assignment 1 Solution and Discussion

Digital Logic Design (CS302)
Assignment # 01Total marks = 20
Deadline:01062020
Please carefully read the following instructions before attempting 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 file is corrupt.
Strict action will be taken if submitted solution is copied from any other student or from the internet.You should concern the recommended books to clarify your concepts as handouts are not sufficient.
You are supposed to submit your assignment in .doc or docx format.
Any other formats like scan images, PDF, zip, rar, ppt and bmp etc will not be accepted.Topic Covered:
Number Systems
Octal number
BCD Numbers
Lectures Covered
Lecture 01 06NOTE
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 assignment in the last hour of deadline. It is recommended to upload solution file at least two days before its closing date.
If you people find any mistake or confusion in 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]Questions No 01 Marks (05)
Perform decimal to binary conversion on given decimal number using Sumofweights method. Verify the answer using repeated division method.
Decimal Number=1050
Questions No 02 Marks (10)
Perform the following arithmetic operations. For conversion you can use indirect method of conversion only.
〖(E2BC3F)〗_16(10110101000000011110001)_2+ (537476217)_8 =(________)_16
Questions No 03 Marks (05)Perform BCD addition between these two numbers. Kindly perform all the steps.
46
37 


@zaasmi said in CS302 Assignment 1 Solution and Discussion:
Questions No 02 Marks (10)
Perform the following arithmetic operations. For conversion you can use indirect method of conversion only.
〖(E2BC3F)〗_16(10110101000000011110001)_2+ (537476217)_8 =(________)_16
Questions No 03 Marks (05)
Perform BCD addition between these two numbers. Kindly perform all the steps.
46
37 (E2BC3F)_16 is already in Hexadecimal number system so there is no change required.
 (10110101000000011110001)_2
We must make 4bit pairs as Hexadecimal number system uses 4bits to represent a number.
0101 1010 1000 0000 1111 0001
5 A 8 0 F 1 Hence,(10110101000000011110001)_2=(5A80F1)_16
(537476217)_8
Now for an octal number, we must have to convert the octal number into a Binary Number System then convert that Binary Number to a Hexadecimal Number System.
(537476217)_8=(101 011 111 100 111 110 010 001 111)_2
Again, as we use 4bits to represent a Hexadecimal Number, we have to rearrange the stated Binary Number.
(101 011 111 100 111 110 010 001 111)_2=(0101 0111 1110 0111 1100 1000 1111)_2
=5 7 E 7 C 8 7
(537476217)_8= (101 011 111 100 111 110 010 001 111)_2=(57E7C8F)_16By performing the stated arithmetic operations on given three Hexadecimal Number System, we will get the final Answer.
〖(E2BC3F)〗_16(10110101000000011110001)_2+ (537476217)_8 =(606B7DD)_16

@zaasmi said in CS302 Assignment 1 Solution and Discussion:
Questions No 01 Marks (05)
Perform decimal to binary conversion on given decimal number using Sumofweights method. Verify the answer using repeated division method.
Decimal Number=1050Sum of Term Highest Weight Binary Number Sum of Term – Highest Weight 1050 1024 10000000000 26=10501024 26 16 10000100000 10=2616 10 8 10000011000 2=108 2 2 10000011010 0=22 Binary Equivalent= (10000011010)2
Repeated Division Method:2 1050 2 5250 2 2621 2 1310 2 651 2 321 2 160 2 80 2 40 2 20 10