Scribd
Upload
36 views2 pages

FCD Unitwise Questions

Uploaded by

Adbhutha B
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
36 views2 pages

FCD Unitwise Questions

Uploaded by

Adbhutha B
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

UNIT -1

BASIC STUCTURE OF COMPUTERS: Introduction, Computers Types, Functional units, Basic operational Concepts,
Bus structures, Software, Performance, multiprocessor and multi computers, computer Generations.

DATA REPRESENTATION: Introduction, Data types, Binary numbers, Number base conversions, Octal and
hexadecimal Numbers, complements, Signed binary numbers, Fixed point Representation. Floating – Point
Representation, Other Binary codes.

1. Explain about various functional units of a digital computer with a neat block diagram.
2. Discuss about the factors that influences the performance of a computer.
3. Differences between multi computer and multi processor
4. Explain in detail fixed-point and floating-point representation of numerical data with examples.
5. Explain the following code conversions with an Example
a) Binary Coded Decimal b) Binary to Exess-3 code c) Gray code
d) Binary to Gray e) Gray to Binary f) Binary to BCD g) BCD to Binary
6.
a) Do the number conversions for the following
i) (116.78)10 to binary ii) (16AB5)16 to Octal
b) Perform the arithmetic operations of (+42) + (–13) in binary using signed 2’s complement.
c) Represent the decimal number 8620 in BCD, EXCESS-3, 2-4-2-1 codes and as a binary
number.
7. Convert the following to Decimal and then to Hexadecimal, Octal and Binary?
(i) 7448 (ii) 15528(iii) 110110012 (iv) 111100112 (v) DEC616
8. Write short notes on
a) Bus structure
b) Types of computer
UNIT -2:
DIGITAL LOGIC CIRCUITS-I: Basic Theorems and Postulates, Digital Logic Gates, Universal Gates, Algebraic
Simplification of Digital Logic Gates using Theorems and Postulates, The Karnaugh Map Method, Do not Care Map
Entries.

1. The following statements are true? Justify.


i) If A+B+C = C+D then A+B = D ii) If A+B = C then AD BD CD
2. What are universal gates implement AND gate using any one universal gate.
3. Convert the following Boolean function into standard product of max terms form.
F = A'B+C+B'D'
4. (a) Simplify the following Boolean expression to a minimum number of literals.
i. F = (B C + A D) (A B + C D)
ii. ii. F = WYZ + XY + X Z + YZ
(b) Express the following function in sum of min terms and product of max terms.
F(A, B, C, D) = B D + A D + BD
5. Simplify the following using K- map and implement the same using NAND gates.
Y (A, B, C) = ∑ (0, 2, 4, 5, 6, 7)
6. Obtain the simplified expression in product of sums.
(i) F(A,B,C,D) = π(0,1,2,3,4,10,11)
(ii) F(A,B,C,D) = π(1,3,5,7,13,15)
7. a) Simplify the following Boolean function with the don’t conditions d using K-map method:
F(A, B, C, D)=Σ(4, 5, 7, 12, 13, 14); d(A, B, C, D)=Σ(1, 9, 11, 15)
8. Simplify the following Boolean function
F(A, B, C, D)=Σ(2, 4, 6, 10, 12); d(A, B, C, D)=Σ(0, 8, 9, 13) using K- Map method in
(a) SOP form (b)POS form

UNIT -3:
Realization of Boolean functions using basic gates and NAND/NOR gates. Arithmetic Circuits-Half adder, Full adder,
Half subtractor, Full Subtractor. Introduction of Combinational Circuits: Multiplexers, Demux, Encoder, Decoder.

1. Design all logic gates using NAND, NOR gate.


2. Design a 4-bit binary adder-subtractor circuit with basic gates.
3. Draw 4X16 MUX using 3X8 with neat diagram.
4. Design a 4-bit priority encoder.
5. Define binary decoder? Explain the working of 2:4 binary decoder.
6. Explain how decoder acts as a de-multiplexer.
7. Differentiate multiplexer and demultiplexer.

UNIT -4:
DIGITAL LOGIC CIRCUITS-II: Introduction: Flip-flops & types, Sequential Circuits and Binary counters, Registers,
Shift Registers. INSTRUCTION SET & ADDRESSING: Introduction, Memory Locations and Addresses, machine
addresses and sequencing, Various Addressing Modes, Instruction Formats .

1. Explain the SR flip-flop with the help of truth table and excitation table.
2. Explain the D flip-flop with the help of truth table and excitation table.
3. Define JK – Flip-flop with the help of a logic diagram and characteristic table.
4. Explain the T flip-flop with the help of truth table and excitation table.
5. Explain basic difference between a shift register and counter.
6. Write short notes on shift register? Mention its application along with the Serial Transfer in
4-bit shift Registers.
7. Differentiate Synchronous and Asynchronous counters.
8. Explain various addressing modes with examples.
9. What are different types of instruction formats? Explain with examples.

UNIT -5:
PROCESSOR ORGANIZATION: Introduction to CPU, Register Transfers, Execution of Instructions, Multiple Bus
Organization, Hardwired control, Micro programmed Control, Input and output Devices.
MEMORY ORAGANIZATION: Introduction, Concepts of Memory, RAM, ROM memories, memory hierarchy, cache
memories, virtual memory.

1. Explain about various components in the organization of a micro-programmed control unit.


2. Explain about Hardwired programmed control unit.
3. Comparison between Hardwired vs Micro-programmed control unit.
4. Explain about different Processor Registers.
5. What is ROM and explain different types of ROM memories.
6. Explain about RAM, its types.
7. What are the types of main memory? Draw the diagram of RAM and ROM chips and explain its
functionality with help of function table.
8. Explain cache memory with mapping techniques.
9. Write about virtual memory.
10. Explain the relation between address and memory space in a virtual memory system with a neat
block diagram.

You might also like