-
Re: CS302 Assignment 2 Solution and Discussion
Digital Logic Design (CS302)
Assignment # 02Total marks = 20
Deadline Date
15/06/2020Please 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:
• SOP to POS Conversion
• K-MapNOTE
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 (10)
Map the given table on K-map. Make relevant pairs and find simplified SOP expression.
A B C D E Output
0 0 0 0 0 1
0 0 0 0 1 1
0 0 0 1 0 1
0 0 0 1 1 0
0 0 1 0 0 1
0 0 1 0 1 1
0 0 1 1 0 X
0 0 1 1 1 0
0 1 0 0 0 0
0 1 0 0 1 X
0 1 0 1 0 1
0 1 0 1 1 1
0 1 1 0 0 X
0 1 1 0 1 0
0 1 1 1 0 1
0 1 1 1 1 X
1 0 0 0 0 1
1 0 0 0 1 0
1 0 0 1 0 X
1 0 0 1 1 0
1 0 1 0 0 1
1 0 1 0 1 1
1 0 1 1 0 0
1 0 1 1 1 0
1 1 0 0 0 0
1 1 0 0 1 X
1 1 0 1 0 0
1 1 0 1 1 1
1 1 1 0 0 0
1 1 1 0 1 X
1 1 1 1 0 0
1 1 1 1 1 1Questions No 02 Marks (10)
Map the given canonical sum (SOP) on K-Map. Pair the terms of canonical product (POS) and find simplified POS expression.
Canonical Sum = ∑A, B, C, D (1, 2, 5, 6, 8, 10, 11, 13, 14, 15) -
Digital Logic Design (CS302)
Assignment # 01Total marks = 20
Deadline:01-06-2020
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 Sum-of-weights 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 -
Digital Logic Design (CS302)
Assignment # 03Total marks = 20
Deadline Date
27/01/2020Please 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:
• State Diagram
• Counters
• K-Maps
• Circuit DesignNOTE
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 (20)
You are required to design a 4-bit even up-counter using D flip flop by converting combinational circuit to sequential circuit. The counter will only consider even inputs and the sequence of inputs will be 0-2-4-6-8-10-0.
Draw the State diagram. Generate State & Transition Table. Generate simplified Boolean Expression. Design the final Circuit diagram.
You are required to perform following tasks: -
Digital Logic Design (CS302)
Assignment # 02Total marks = 20
Deadline Date
27 Nov 2019Please 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 consult 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:
Expression Simplification
Quine-McCluskey Simplification MethodNOTE
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]Question Marks (20)
Consider the below given canonical sum:∑_(A,B,C,D,E)▒〖(2,4,6,8,10,12,14,16,18,20,22,24,26,28,30)〗
Write the SOP expression for the given sum. Find the prime implicants from given minterms using Quine-McCluskey simplification method. Extract the simplified expression.Note: Perform all steps of this method. In case of missing steps, marks will be deducted.
-
In circuit designing industry, the focus is on transistor density, clock speed and power/performance ratio optimization. Due to the emergence of Dark Silicon issue, the focus has shifted entirely on power/performance ratio. Performance and power tradeoff is still the most crucial issue in the design of circuits. Suppose you are working on the design of a processor for a Radar System. Which one of the parameters (Performance or Power) will you consider being the most important in this situation?
Justify your answer with good reasons.
SOLVED CS302 Assignment 2 Solution and Discussion
-
Digital Logic Design (CS302)
Assignment # 02Total marks = 20
Deadline Date
27 Nov 2019Please 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 consult 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:
Expression Simplification
Quine-McCluskey Simplification MethodNOTE
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]Question Marks (20)
Consider the below given canonical sum:∑_(A,B,C,D,E)▒〖(2,4,6,8,10,12,14,16,18,20,22,24,26,28,30)〗
Write the SOP expression for the given sum. Find the prime implicants from given minterms using Quine-McCluskey simplification method. Extract the simplified expression.Note: Perform all steps of this method. In case of missing steps, marks will be deducted.
-
ASSIGNMENT NO:2
Course: CS302
1: Write the SOP expression for the given sum.Sol:
A B C D E
0 0 0 0 0
0 0 0 0 1
0 0 0 1 0
0 0 0 1 1
0 0 1 0 0
0 0 1 0 1
0 0 1 1 0
0 0 1 1 1
0 1 0 0 0
0 1 0 0 1
0 1 0 1 0
0 1 0 1 1
0 1 1 0 0
0 1 1 0 1
0 1 1 1 0
0 1 1 1 1
1 0 0 0 0
1 0 0 0 1
1 0 0 1 0
1 0 0 1 1
1 0 1 0 0
1 0 1 0 1
1 0 1 1 0
1 0 1 1 1
1 1 0 0 0
1 1 0 0 1
1 1 0 1 0
1 1 0 1 1
1 1 1 0 0
1 1 1 0 1
1 1 1 1 0
1 1 1 1 1A B C D E OUTPUT
(F)
0 0 0 0 0 0
0 0 0 0 1 0
0 0 0 1 0 1
0 0 0 1 1 0
0 0 1 0 0 1
0 0 1 0 1 0
0 0 1 1 0 1
0 0 1 1 1 0
0 1 0 0 0 1
0 1 0 0 1 0
0 1 0 1 0 1
0 1 0 1 1 0
0 1 1 0 0 1
0 1 1 0 1 0
0 1 1 1 0 1
0 1 1 1 1 0
1 0 0 0 0 1
1 0 0 0 1 0
1 0 0 1 0 1
1 0 0 1 1 0
1 0 1 0 0 1
1 0 1 0 1 0
1 0 1 1 0 1
1 0 1 1 1 0
1 1 0 0 0 1
1 1 0 0 1 0
1 1 0 1 0 1
1 1 0 1 1 0
1 1 1 0 0 1
1 1 1 0 1 0
1 1 1 1 0 1
1 1 1 1 1 0
FOR SOP WE FOCUS ON 1 VALUE.
A B C D E MINTERM
0 0 0 1 00 0 1 0 0
0 0 1 1 0
0 1 0 0 0
0 1 0 1 0
0 1 1 0 0
0 1 1 1 0
1 0 0 0 0
1 0 0 1 0
1 0 1 0 0
1 1 1 0 0
1 1 0 0 0
1 1 0 1 0
1 1 1 0 0
1 1 1 1 1 ABCDE
SOP EXPRESSION:
SUM OF PRODUCT EXPRESSION2: Find Prime Implicant of minterm using QuineMcculsky method.
Step-1
00010 2
00100 4
01000 8
10000 16
00110 6
01010 10
01100 12
10010 18
10100 20
11000 24
01110 14
10110 22
11010 26
11100 28
11110 30Step-2
2,6(00-10) 2,10(0-010) 2,18(-0010)
4,12(0-100) 4,6(001-0) 4,20(-0100)
8,10(010-0) 8,24(-1000)
16,18(100-0) 16,20(10-00) 16,24(10-00)
6,14(0-110) 6,22(-0110)
10,14(01-10)10,26(-1010)
12,14(011-0) 12,28(-1100)
18,26(1-010) 18,22(10-10)
20,22(101-0) 20,22(1-100)
24,26(110-0) 24,28(11-00)
14,30(-1110) 22,30(1-110) 26,30(11-10) 28,30(111-0)
Step-3
2,6,18,22(-0-10) 2,6,10,14( 0–10)2,10,18,26(–010)2,18,6,22(-0-10)
2,18,10,26(–010)4,12,6,14(0-1-0) 4,6,12,14 (0-1-0)
4,6,20,22(-01-0)4,20,6,22(-01-0) 4,20,12,28(–100) 8,10,12,14(01–0) 8,24,10,26(-10-0) 8,24,12,28 (-1-00)
6,14,22,30 (–110) 6,22,14,30(–110) 10,14,26,30(-1-10) 10,26,14,30(-1-10) 12,14,28,30(-11-0) 12,14,28,30(-11-0)
18,26,22,30(1–10) 18,22,26,30(1–10) 20,22,28,30(1-1-0)
20,22,22,30(1-1-0) 24,26,28,30(11–0) 24,28,26,30(11–0)
Step-3
2,6,18,22(-0-10) 4,6,20,22(-01-0)
2,18,10,22(-0-10) 4,20,6,22(-01-0)
2,10,18,26(–010) 4,12,6,14(0-1-0)
2,18,6,22(–010) 4,6,12,14 (0-1-0)
4,20,12,28(–100) 10,14,26,30(-1-10)
6,14,22,30 (–110) 10,26,14,30(-1-10)
12,14,28,30(-11-0) 18,26,22,30(1–10)
12,14,28,30(-11-0) 18,22,26,30(1–10)
20,22,28,30(1-1-0) 24,26,28,30(11–0)
20,22,22,30(1-1-0) 24,28,26,30(11–0)
6,22,14,30(–110)
8,10,12,14(01–0)
8,24,12,28 (-1-00)
8,24,10,26(-10-0)
Step-4
2,6,8,22(-0-10) 4,6,20,22(-01-0)
2,10,18,26(–010) 4,12,6,14(0-1-0)
4,20,12,28(–100) 10,14,26,30(-1-10)
12,14,28,30(-11-0) 18,26,22,30(1–10)
20,22,28,30(1-1-0) 24,26,28,30(11–0)
6,22,14,30(–110) 8,10,12,14(01–0)
8,24,12,28 (-1-00) 8,24,10,26(-10-0)
These are the prime implicates
cs302-assign 2.docx -