Assignment GDB Solution: CS302 Digital Logic Design


CS302 GDB Solution Feb 2015

Discussion Topic Programmable Logic devices can be used as replacement to logic gates and MSI chips, State that how these devices can have an effect on the performance of storage fundamentals, and also discuss which will give better performance? Give arguments in the support of your answer. Solution: With programmable logic devices, designers use inexpensive software […]

CS302 Digital Logic Design Assignment 3 Feb 2015

Question 1                [10 Marks]   Complete the following table by showing appropriate output of Q for the given circuit. Assume that Q output is set as 1 initially. Clock J0 J1 J2 K0 K1 K2 Q ↓ 1 0 0 1 1 1 ? ↓ 0 0 1 […]

CS302 Digital Logic Design Assignment 2 Solution Fall 2014

Question 1 [10 Marks] See the following Karnaugh Map, identify adjacent groups of 1’s, and generate a minimal SOP expression from those groupings. AB\CD 00 01 11 10 00 1 0 1 1 01 0 1 1 1 11 × × × × 10 1 1 × × Question 2 [10 Marks] Using Quine-McCluskey method, […]

CS302 Digital Logic Design Assignment 1 Solution Fall 2014

Solution: Question 1:     (10 Marks) a) Calculate the Octal and Hexadecimal equivalent of the given binary number. Give each step of the calculation. 10111000011101101001001001001001010100 BINARY TO HEXADECIMAL 10111000011101101001001001001001010100 0010 1110 0001 1101 1010 0100 1001 0010 0101 0100 3.     2           E    1       D      A       4        9    2         5       4 Thus binary number 10111000011101101001001001001001010100 is represented […]

CS302 Digital Logic Design GDB Solution Spring 2014

The topic of Graded Discussion Board There are three edge-triggered flip-flops namely SR, D and J-K that are used in digital logic circuits and every flip-flop has its own operation. Which flip flop will be better in performance against each factor given below? Power consumption Delay (in terms of output) Give solid arguments to validate your view. You may give another type of Flip […]

CS302 Digital Logic Design Assignment 1 Solution Spring 2014

Question 1 [10 Marks] Simplify the following Boolean expression using Boolean algebra by writing each step. Question 2 [5Marks] Convert the given Binary code 011010011 to Gray code by writing all the steps? Note! (Show the complete steps in both questions) Idea Solution:

CS302 Digital Logic Design Final Paper March 2014

Following are the questions.question are 2 marks,3 marks and 5 marks. total 12 questions and 40 mcq’s: (1)difference b\w truth table and next state table? (2)how can we count the frequency of unknown signal? (3)difference b\w combinational digital circuit and sequential circuit? (4)a timing diagram is given and we analyze the diagram? (5)Three types of […]

CS302 Digital Logic & Design GDB Solution Fall 2013

“An electric power supply company is going to make a power line network to monitor the power supply and line losses. For monitoring system to be deployed with this network, which integrated technology will be a better choice, as CMOS and TTL are widely used in different scenarios? Support you views with reasons. You may also point out a […]

CS302 Digital Logic Design Quiz 3 Fall 2013

Dear Students, Quiz # 3 will start from Thursday, 30th January, 2014 and will remain open for two days the last day will be Friday, 31st January, 2014. The lectures included in this quiz will befrom Lecture # 20 to Lecture # 29. CS302 Today Quiz No 3 Question # 1 of 10 ( Start time: 11:29:09 PM )     Total Marks: 1 Bi-stable devices remain in either of their _________ […]

CS302 Digital Logic Design Assignment 2 Solution Fall 2013

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 internet advertising