CSCI150B Spring 2021 1 Midterm Online version • This midterm is online via Zoom. It is 1 hour and 15 minutes long. Make sure you carefully manage the time. Late submission would result in significant mark detection as a late penalty up to a Zero mark directly. • You need to have a valid Id presented during the exam. Fail to identify yourself would result in a rejection of your submission, and you may be removed from the Zoom meeting. • You should have the webcam on during the entire exam. Fail to do so may result in the rejection of your submission. • You have only one submission. You may use a zip file or insert images into a word file. You can also submit multiple files (up to 20). However, you should submit all files together in ONE click. • You must submit everything electrically via myCC under the Midterm Submission link. Email submissions will NOT be considered. • All files are subject to submission to Turnitin for academic integrity check. Any violation could cause serious consequences. • This midterm has 30 possible marks. This midterm worth 30% of the course total. 1. Calculate the following calculation (You can write on paper and take pictures to submit; you must include all the steps. All calculations must complete under the same number system as indicated. NO STEPS NO MARKS!): (4 points) • 1010101 (b) * 1011 (b) • 110011 (d) + 110101 (d) • 1001 0110 0111 (BCD) + 1001 1000 0101 (BCD) • 10111 (b) / 1100 (b) (Keep 4 bits after decimal point) 2. Simplify the following expression by Boolean algebra laws (K-Map is not allowed). (2 points) (, , , ) = ′′ + ( + ) + ( + ′) 3. Find the duality and complement function of the following expression, determine if it is a self-dual or self-complement (4 points) (, , ) = ′z + ( + + 1) + ( + ′ + 0)′ CSCI150B Spring 2021 2 4. Use decoders and other gates to design and build a 2-bit Full Adder (10 points) 5. Find the truth table (function table), SOM, POM, and simplify the following expression using the K-Map approach. Draw the two diagrams: before and after simplification expression. Count the number of variables, literals, gates, and input cost of the original and after simplification expression. (10 points) (, , , ) =∏(0,2,4,8,11,12,15) Appendix: Laws of Boolean Algebra
欢迎咨询51作业君