<?xml version="1.0" encoding="UTF-8"?><rss xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:atom="http://www.w3.org/2005/Atom" version="2.0"><channel><title><![CDATA[CS302 Assignment 2 Solution and Discussion]]></title><description><![CDATA[<p dir="auto">Digital Logic Design (CS302)<br />
Assignment # 02</p>
<p dir="auto">Total marks = 20</p>
<p dir="auto">Deadline Date<br />
27 Nov 2019</p>
<p dir="auto">Please carefully read the following instructions before attempting assignment.</p>
<p dir="auto">RULES FOR MARKING<br />
It should be clear that your assignment would not get any credit if:<br />
The assignment is submitted after the due date.<br />
The submitted assignment does not open or file is corrupt.<br />
Strict action will be taken if submitted solution is copied from any other student or from the internet.</p>
<p dir="auto">You should consult the recommended books to clarify your concepts as handouts are not sufficient.</p>
<p dir="auto">You are supposed to submit your assignment in .doc or docx format.<br />
Any other formats like scan images, PDF, zip, rar, ppt and bmp etc will not be accepted.</p>
<p dir="auto">Topic Covered:<br />
Expression Simplification<br />
Quine-McCluskey Simplification Method</p>
<p dir="auto">NOTE</p>
<p dir="auto">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.</p>
<p dir="auto">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.</p>
<p dir="auto">For any query, feel free to email at:<br />
<a href="mailto:cs302@vu.edu.pk" target="_blank" rel="noopener noreferrer nofollow ugc">cs302@vu.edu.pk</a></p>
<p dir="auto">Question                  							                 Marks (20)<br />
Consider the below given canonical sum:</p>
<p dir="auto">∑_(A,B,C,D,E)▒〖(2,4,6,8,10,12,14,16,18,20,22,24,26,28,30)〗</p>
<pre><code>Write the SOP expression for the given sum.
Find the prime implicants from given minterms using Quine-McCluskey simplification method.
Extract the simplified expression.
</code></pre>
<p dir="auto">Note: Perform all steps of this method. In case of missing steps, marks will be deducted.</p>
]]></description><link>https://community.secnto.com//topic/681/cs302-assignment-2-solution-and-discussion</link><generator>RSS for Node</generator><lastBuildDate>Mon, 08 Jun 2026 23:22:57 GMT</lastBuildDate><atom:link href="https://community.secnto.com//topic/681.rss" rel="self" type="application/rss+xml"/><pubDate>Wed, 27 Nov 2019 15:06:09 GMT</pubDate><ttl>60</ttl><item><title><![CDATA[Reply to CS302 Assignment 2 Solution and Discussion on Wed, 27 Nov 2019 15:10:21 GMT]]></title><description><![CDATA[<p dir="auto">ASSIGNMENT NO:2<br />
Course: CS302<br />
1: Write the SOP expression for the given sum.</p>
<p dir="auto">Sol:<br />
A	B	C	D	E<br />
0	0	0	0	0<br />
0	0	0	0	1<br />
0	0	0	1	0<br />
0	0	0	1	1<br />
0	0	1	0	0<br />
0	0	1	0	1<br />
0	0	1	1	0<br />
0	0	1	1	1<br />
0	1	0	0	0<br />
0	1	0	0	1<br />
0	1	0	1	0<br />
0	1	0	1	1<br />
0	1	1	0	0<br />
0	1	1	0	1<br />
0	1	1	1	0<br />
0	1	1	1	1<br />
1	0	0	0	0<br />
1	0	0	0	1<br />
1	0	0	1	0<br />
1	0	0	1	1<br />
1	0	1	0	0<br />
1	0	1	0	1<br />
1	0	1	1	0<br />
1	0	1	1	1<br />
1	1	0	0	0<br />
1	1	0	0	1<br />
1	1	0	1	0<br />
1	1	0	1	1<br />
1	1	1	0	0<br />
1	1	1	0	1<br />
1	1	1	1	0<br />
1	1	1	1	1</p>
<p dir="auto">A	B	C	D	E	OUTPUT<br />
(F)<br />
0	0	0	0	0	0<br />
0	0	0	0	1	0<br />
0	0	0	1	0	1<br />
0	0	0	1	1	0<br />
0	0	1	0	0	1<br />
0	0	1	0	1	0<br />
0	0	1	1	0	1<br />
0	0	1	1	1	0<br />
0	1	0	0	0	1<br />
0	1	0	0	1	0<br />
0	1	0	1	0	1<br />
0	1	0	1	1	0<br />
0	1	1	0	0	1<br />
0	1	1	0	1	0<br />
0	1	1	1	0	1<br />
0	1	1	1	1	0<br />
1	0	0	0	0	1<br />
1	0	0	0	1	0<br />
1	0	0	1	0	1<br />
1	0	0	1	1	0<br />
1	0	1	0	0	1<br />
1	0	1	0	1	0<br />
1	0	1	1	0	1<br />
1	0	1	1	1	0<br />
1	1	0	0	0	1<br />
1	1	0	0	1	0<br />
1	1	0	1	0	1<br />
1	1	0	1	1	0<br />
1	1	1	0	0	1<br />
1	1	1	0	1	0<br />
1	1	1	1	0	1<br />
1	1	1	1	1	0<br />
FOR SOP WE FOCUS ON 1 VALUE.<br />
A	B	C	D	E	MINTERM<br />
0	0	0	1	0</p>
<p dir="auto">0	0	1	0	0</p>
<p dir="auto">0	0	1	1	0</p>
<p dir="auto">0	1	0	0	0</p>
<p dir="auto">0	1	0	1	0</p>
<p dir="auto">0	1	1	0	0</p>
<p dir="auto">0	1	1	1	0</p>
<p dir="auto">1	0	0	0	0</p>
<p dir="auto">1	0	0	1	0</p>
<p dir="auto">1	0	1	0	0</p>
<p dir="auto">1	1	1	0	0</p>
<p dir="auto">1	1	0	0	0</p>
<p dir="auto">1	1	0	1	0</p>
<p dir="auto">1	1	1	0	0</p>
<p dir="auto">1	1	1	1	1	ABCDE</p>
<p dir="auto">SOP EXPRESSION:<br />
SUM OF PRODUCT EXPRESSION</p>
<p dir="auto">2: Find Prime Implicant of minterm using QuineMcculsky method.</p>
<p dir="auto">Step-1<br />
00010	2<br />
00100	4<br />
01000	8<br />
10000	16<br />
00110	6<br />
01010	10<br />
01100	12<br />
10010	18<br />
10100	20<br />
11000	24<br />
01110	14<br />
10110	22<br />
11010	26<br />
11100	28<br />
11110	30</p>
<p dir="auto">Step-2<br />
2,6(00-10) 2,10(0-010) 2,18(-0010)<br />
4,12(0-100) 4,6(001-0) 4,20(-0100)<br />
8,10(010-0) 8,24(-1000)<br />
16,18(100-0) 16,20(10-00) 16,24(10-00)<br />
6,14(0-110) 6,22(-0110)<br />
10,14(01-10)10,26(-1010)<br />
12,14(011-0) 12,28(-1100)<br />
18,26(1-010) 18,22(10-10)<br />
20,22(101-0) 20,22(1-100)<br />
24,26(110-0)  24,28(11-00)<br />
14,30(-1110) 22,30(1-110) 26,30(11-10) 28,30(111-0)<br />
Step-3<br />
2,6,18,22(-0-10) 2,6,10,14(  0–10)2,10,18,26(–010)2,18,6,22(-0-10)<br />
2,18,10,26(–010)4,12,6,14(0-1-0)  4,6,12,14 (0-1-0)<br />
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)<br />
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)<br />
18,26,22,30(1–10) 18,22,26,30(1–10) 20,22,28,30(1-1-0)<br />
20,22,22,30(1-1-0) 24,26,28,30(11–0) 24,28,26,30(11–0)<br />
Step-3<br />
2,6,18,22(-0-10)  		4,6,20,22(-01-0)<br />
2,18,10,22(-0-10) 		4,20,6,22(-01-0)<br />
2,10,18,26(–010) 		4,12,6,14(0-1-0)<br />
2,18,6,22(–010)	 		4,6,12,14 (0-1-0)<br />
4,20,12,28(–100)    		10,14,26,30(-1-10)<br />
6,14,22,30 (–110)   		10,26,14,30(-1-10)<br />
12,14,28,30(-11-0) 		18,26,22,30(1–10)<br />
12,14,28,30(-11-0)   		18,22,26,30(1–10)<br />
20,22,28,30(1-1-0) 		24,26,28,30(11–0)<br />
20,22,22,30(1-1-0) 		24,28,26,30(11–0)<br />
6,22,14,30(–110)<br />
8,10,12,14(01–0)<br />
8,24,12,28 (-1-00)<br />
8,24,10,26(-10-0)<br />
Step-4<br />
2,6,8,22(-0-10)          		4,6,20,22(-01-0)<br />
2,10,18,26(–010) 		4,12,6,14(0-1-0)<br />
4,20,12,28(–100)     		10,14,26,30(-1-10)<br />
12,14,28,30(-11-0)   		18,26,22,30(1–10)<br />
20,22,28,30(1-1-0)  		24,26,28,30(11–0)<br />
6,22,14,30(–110)    		8,10,12,14(01–0)<br />
8,24,12,28 (-1-00)  		8,24,10,26(-10-0)<br />
These are the prime implicates<br />
<a href="/assets/uploads/files/1574867417088-cs302-assign-2.docx">cs302-assign 2.docx</a></p>
]]></description><link>https://community.secnto.com//post/1947</link><guid isPermaLink="true">https://community.secnto.com//post/1947</guid><dc:creator><![CDATA[zareen]]></dc:creator><pubDate>Wed, 27 Nov 2019 15:10:21 GMT</pubDate></item><item><title><![CDATA[Reply to CS302 Assignment 2 Solution and Discussion on Wed, 27 Nov 2019 15:08:00 GMT]]></title><description><![CDATA[<p dir="auto"><a href="https://youtu.be/lwPwpRQe8s0" target="_blank" rel="noopener noreferrer nofollow ugc">https://youtu.be/lwPwpRQe8s0</a></p>
]]></description><link>https://community.secnto.com//post/1946</link><guid isPermaLink="true">https://community.secnto.com//post/1946</guid><dc:creator><![CDATA[zareen]]></dc:creator><pubDate>Wed, 27 Nov 2019 15:08:00 GMT</pubDate></item></channel></rss>