View more random threads:
- CS604 Operating Systems Assignment No.01 Solution and...
- MGT602 Entrepreneurship Assignment No 2 Solutions and...
- CS601-Assignment No. 01 Data Communication (Non Graded)...
- CS502 Fundamentals of Algorithms Assignment No. 01 Graded...
- MGT510 Total Quality Management Assignment No.1 Fall...
- CS706 Software Quality Assurance – Assignment No. 1 MS...
- MGT201 Financial Management Assignment 2 Deadline 1 July...
- CS502 Fundamentals of Algorithms Assignment No. 02 Solution...
- All Past Assignments with Solutions Of CS401 Computer...
- ENG001 Elementary English Assignment No. 1 Solution Fall...
Sponsored Links
The assignment has been designed to develop the understanding related to the followings,
• Quine-McCluskey Method
• ABEL
Instructions:
Please read the following instructions carefully before solving & submitting assignment:
It should be clear that your assignment will not get any credit (zero marks) due to followings,
1. The assignment is submitted after due date.
2. The submitted assignment does not open or file is corrupt.
3. The assignment not submitted in MS Word file format.
4. The assignment is copied (from other student or copied from handouts or internet).
5. Student ID is not mentioned in the assignment file or name of file is other than student ID.
For any query about the assignment, contact only at CS302@vu.edu.pk
Do not post queries related to assignment on MDB.
Question 1 [15 Marks]
Using Quine-McCluskey method, reduce the expression given below by following all the steps.
X= A’B’C’D +A’B’CD+A’BC’D+A’BCD’+AB’C’D’+AB’C’D+ABC’D’+ABCD’+ ABCD
Question 2 [5 Marks]
Write an ABEL equation against the following Boolean expressions
1) X = AB’ + B’C + B’D’
2) Y = A’B’C ⊕ BD’ ⊕ D
Note!
⊕ = XOR, A’ = A bar or A complement
There are currently 1 users browsing this thread. (0 members and 1 guests)