Friday 5 June 2015

Fundamentals of Algorithms CS502 Assignment No. 2 Solution 6th June 2015

Assignment


Question:     (20 Marks)

You are required to extract the Boolean expression from following function table and then generate a minimal SOP expression by using the Karnaugh Map.

A
B
C
D
Output
0
0
0
0
1
0
0
0
1
1
0
0
1
0
1
0
0
1
1
1
0
1
0
0
0
0
1
0
1
0
0
1
1
0
0
0
1
1
1
0
1
0
0
0
1
1
0
0
1
1
1
0
1
0
1
1
0
1
1
0
1
1
0
0
0
1
1
0
1
0
1
1
1
0
0
1
1
1
1
0

Instructions for the assignment:

  • You are required to make a presentation file (.ppt) for your assignment solution
  • Presentation will consist of maximum of 4-5 slides
  • First slide will contain student name and ID
  • Remaining slides will contain all the steps involved in solving above question
  • You are also required to embed your voice (record your voice) in all slides of the presentation
  • In first slide, you will speak your name and ID, and in remaining slides, you are required to explain all the steps
  • Your introduction and explanation should not take more than 4 to 5 minute