34 views

Uploaded by Pradyumn Paliwal

computer architecture

save

- C.B.S.E. Class 12 Physics Project On Logic Gates
- Gianluca Tempesti, Daniel Mange and Andre Stauffer- A Robust Multiplexer-Based FPGA Inspired By Biological Systems
- Report on 4x1 Multiplexer
- Function Block Diagram Iniyi.docx
- Abdo Mux Demux
- ch08
- Boolean Functions: Theory, Algorithms, And Applications
- Question Bank Dsd
- 1083ch1_12
- CS302 Collection of Old Papers
- 2008-iscTheory
- dsd19
- Chapter 06B
- Application of BooleApplication of Boolean Algebra.pptan Algebra
- Digital Techniques by Monaal Sawant.
- Boolean Algebra
- AppA
- EE2310_hw3_sol
- Us 4545406
- Extension questions week 1
- Digital Electronics Viva
- FT CHR T2 Installation Full
- 74193
- SNEPSCHEUT 1994 Mechanized Support for Stepwise Refinement
- Programacion Windows 95 test
- Nor and Nand Gates
- DSD_LAB OBSERVATION.pdf
- 21SCS147LECTURE3
- Application Dms
- Counter is a Sequential Circuit
- Resume_10213012_Dec.-10_-2014_-11_10-PM
- Growth and Challenges of Commodity Derivative Market in India
- Application of Image Processing in Biometric Verification.pdf (1) (2)
- Neyman Pearson 1933
- Howto Sorting
- Scams, Frauds and the Global Financial Crisis
- Howto Sockets
- Growth and Challenges of Commodity Derivative Market in India
- Topics for Competitive Programming
- arm_arm
- arm_arm
- Resume_10213012_Sep.-06_-2014_-07_38-PM
- Indian Financial System and Indian Banking Sector A
- VHDL

You are on page 1of 4

Problem Set 1

Policy for submission of solutions: Submit by 22.01.2012. Late submissions will NOT be evaluated (solutions will be uploaded on 23.01.2012). Solve the problems in A4 sheets and submit all sheets stapled together. There should be one title sheet with the student’s name, class, roll number, serial number, and problem set number.

1. Simplify the following Boolean functions, using 3-variable maps: a. F (x,y,z) = ∑(0,2,6,7) b. F(A,B,C) = ∑ (0,2,3,4,6) 2. Simplify the following Boolean functions, using 4-variable maps: a. w’z + xz + x’y + wx’z b. wxy + yz + xy’z + x’y 3. Simplify the following Boolean function F, together with the don’t-care conditions d, and then express the simplified function in sum of min-terms: a. F(x,y,z) = ∑ (0,1,2,4,5), d(x,y,z) = ∑ (3,6,7) b. F(A,B,C,D) = ∑ (1,3,5,7,9,15), d(A,B,C,D) = ∑ (4,6,12,13) 4. Given the Boolean function F = xy’z + x’y’z + xyz a. List the truth table b. Draw the logic diagram of the original function using 2-input gates c. Simplify the function using Boolean algebra d. List the truth table of the simplified function e. Draw the logic diagram of the simplified function (using 2-input gates) f. Draw the logic diagram of the simplified function using only 2-input NAND gates 5. Implement the following Boolean function together with the don’t-care conditions d, using no more than three NOR gates: F(A,B,C,D) = ∑ (0,1,9,11) d(A,B,C,D) = ∑ (2,8,10,14,15) 6. Derive the circuits for a three-bit parity generator and four-bit parity checker using odd parity bit. 7. Consider the combinational circuit in the figure below. a. Derive the Boolean expressions for T1 through T4. Derive outputs F1 and F2 as function of the four inputs. b. List the truth table (4 variables). Then list T1 through T4, F1 and F2.

10. c. Use AND gates and binary adders. Use K-maps to simplify these expressions and show that they are equivalent to the ones obtained in (a). A combinational circuit is defined by the following three Boolean functions: F1 = x’y’z’ + xz F2 = xy’z’ + x’y F3 = x’y’z + xy Design the circuit with a decoder and external gates. The seven outputs of the decoder (a. 12. 8. f. as shown in Figure a. 11. . Design a binary multiplier that multiplies two 4-bit numbers. Implement the circuit using exclusive-OR gates. The numeric display chosen to represent the decimal digit is shown Figure b. e. Construct a 4-to-16-line decoder with five 2-to-4 line decoders with enable. Design this decoder using a minimum number of gates. A BCD-to-seven-segment decoder is a combinational circuit that converts a decimal digit in BCD to an appropriate code for the selection of segments in a display indicator used for displaying the decimal digit in a familiar form. d. b. g) select the corresponding segments in the display. 9. The six invalid combinations should result in a blank display.c. Design a combinational circuit that converts a 4-bit gray code to a 4-bit binary number.

and corresponding circuit using D flip-flops. 15) 15. I3 = I5 = 1. D) = (0. 1. 16. 8. are as follows: I1= I2 = I7 = 0. create the state table. B. using the convention XY.13. Derive the state diagram for the following circuit. 3. S1. 14. respectively. Implement the following Boolean function with a multiplexer: F(A. I0 = I4 = D. 4. Construct a 16 x 1 multiplexer with two 8 x 1 and one 2 x 1 multiplexers. B. An 8 x 1 multiplexer has inputs A. and S0. Determine the Boolean function that the multiplexer implements. and I6 = D’. Use block diagram. 9. The data inputs I0 through I7. From the following state diagram. and C connected to the selection inputs S2. C. Output Z should be encoded in the state. 17. . Transitions should be marked based on both inputs x and y.

y.5.6) C(x. Show the Parity bits for a 16-bit and 32-bit number.y. Create the truth table for a ROM that implements the Boolean functions: A(x. 20 x 4 21. 22.5) D(x.5.6.2. 256K x 64 c.3. 20.6) B(x.z) = Σ(0. Design a counter which cycles through the binary sequence (1.7) How big should the ROM be? What is the memory content at addresses 0 and 5? .7) using J/K flipflops.6.1.z) = Σ(1. Design a four bit binary synchronous counter with D flip-flops and logic gates.y.18. Suggest how to correct this problem. 2G x 16 d.y. What is the parity value for the 8bit binary number 10110101? Place the bits into the appropriate places in the parity+data word.2. 19. How many address lines and data lines are needed for the following memory? a.z) = Σ(0.4. 16K x 8 b.3. Show that when states 000 and 011 are used as don’t care statements the counter may not operate properly.z) = Σ(1.

- C.B.S.E. Class 12 Physics Project On Logic GatesUploaded bySaurav Stark
- Gianluca Tempesti, Daniel Mange and Andre Stauffer- A Robust Multiplexer-Based FPGA Inspired By Biological SystemsUploaded byUloff
- Report on 4x1 MultiplexerUploaded byPRAVEEN KUMAWAT
- Function Block Diagram Iniyi.docxUploaded byPsy Dakstalder
- Abdo Mux DemuxUploaded byAyop Sifaw
- ch08Uploaded byLuis Eduardo García Quesada
- Boolean Functions: Theory, Algorithms, And ApplicationsUploaded byFakee Zimbo
- Question Bank DsdUploaded byJithinmvijayan Vijayan
- 1083ch1_12Uploaded byshafi_mohd2002
- CS302 Collection of Old PapersUploaded bycs619finalproject.com
- 2008-iscTheoryUploaded byShadower
- dsd19Uploaded byammayi9845_930467904
- Chapter 06BUploaded bypp003
- Application of BooleApplication of Boolean Algebra.pptan AlgebraUploaded byRiheen Ahsan
- Digital Techniques by Monaal Sawant.Uploaded byMonark Sawant
- Boolean AlgebraUploaded byapi-3701035
- AppAUploaded byLascu Mihai Sebastian
- EE2310_hw3_solUploaded byJaffer Raza
- Us 4545406Uploaded bypradip pantha
- Extension questions week 1Uploaded byDulwich Physics
- Digital Electronics VivaUploaded bywalternampimadom
- FT CHR T2 Installation FullUploaded byLockdown Security Canada
- 74193Uploaded byEdgar Pimienta
- SNEPSCHEUT 1994 Mechanized Support for Stepwise RefinementUploaded byP6E7P7
- Programacion Windows 95 testUploaded byjhb2412
- Nor and Nand GatesUploaded byMichalis Irakleous
- DSD_LAB OBSERVATION.pdfUploaded byAbdul Rahiman A
- 21SCS147LECTURE3Uploaded byMary Morse
- Application DmsUploaded bySanny Katiyar
- Counter is a Sequential CircuitUploaded byalvin castro

- Resume_10213012_Dec.-10_-2014_-11_10-PMUploaded byPradyumn Paliwal
- Growth and Challenges of Commodity Derivative Market in IndiaUploaded byPradyumn Paliwal
- Application of Image Processing in Biometric Verification.pdf (1) (2)Uploaded byPradyumn Paliwal
- Neyman Pearson 1933Uploaded byPradyumn Paliwal
- Howto SortingUploaded byPradyumn Paliwal
- Scams, Frauds and the Global Financial CrisisUploaded byPradyumn Paliwal
- Howto SocketsUploaded byPradyumn Paliwal
- Growth and Challenges of Commodity Derivative Market in IndiaUploaded byPradyumn Paliwal
- Topics for Competitive ProgrammingUploaded byPradyumn Paliwal
- arm_armUploaded byPradyumn Paliwal
- arm_armUploaded byPradyumn Paliwal
- Resume_10213012_Sep.-06_-2014_-07_38-PMUploaded byPradyumn Paliwal
- Indian Financial System and Indian Banking Sector AUploaded byPradyumn Paliwal
- VHDLUploaded byPradyumn Paliwal