0% found this document useful (0 votes)
32 views4 pages

Computer Architecture Basics for BCA

The document outlines a syllabus for a BCA Semester I course on Basics of Computer Architecture for the 2024-25 session. It includes various topics such as number system conversions, binary arithmetic, logic gates, flip-flops, multiplexers, and counters, along with practical exercises and theoretical explanations. Additionally, it covers concepts like codes, digital circuits, and theorems in Boolean algebra.

Uploaded by

sumitmendhe33
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
32 views4 pages

Computer Architecture Basics for BCA

The document outlines a syllabus for a BCA Semester I course on Basics of Computer Architecture for the 2024-25 session. It includes various topics such as number system conversions, binary arithmetic, logic gates, flip-flops, multiplexers, and counters, along with practical exercises and theoretical explanations. Additionally, it covers concepts like codes, digital circuits, and theorems in Boolean algebra.

Uploaded by

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

BCA Semester - I

Session : 2024--25
Basics of Computer Architecture

1. Do as directed:
i) (10010)2 – ( ? )10
ii) (3478)10 = ( ? )8
iii) (275)8 = ( ? )2
iv) (1FA2)16 = ( ? )2
v) (341)8 = ( ? )16
2. Write a short note on: ASCII and EBCDIC code
3. What is Excess-3 code? Perform the following addition using Excess-3 code:
i) 27 + 13 ii) 49+18
4. Define : i) Underflow
ii) Overflow.
iii) Range
iv) Accuracy
5. Perform the Following subtraction using 1’s complement method:
(i) (10101)2 – (10010)2
(ii) (10110)2 – (1111)2
6. Explain 1’s and 2’s complement method with example.
7. Explain how negative numbers are represented in binary with suitable example.
8. Explain NOT, AND gate & OR gate using logic symbol and truth table.
9. Why NAND gate is used as a Universal gate? Explain.
10. Define : Pair , Quad , Octet, SOP and POS.
11. State and Prove De-Morgans Theorem.
12. State and prove : (i) Associative law (ii) Distributive law iii) Commutative Law
13. Prove that : (A+B) (A+C) = A+BC
14. Simplify the following equation using K-map :
Y = ∑ åm (0, 2, 4, 6, 9, 11, 13)
draw the logic diagram for simplified equation.
15. Explain the construction and working of Full Adder circuit
using logic gates.
16. What is Multiplexer ? Draw the logic diagram of 4 : 1 MUX
using NAND gates only and explain its working.
17. Explain the function of Encoder. Draw logic diagram for
decimal to BCD encoder.
18. What is a parity ? Explain the working of parity detector
circuit.
19. What is parallel adder ? Explain the construction and working
of 4-bit binary adder circuit.
20. Explain the construction and working of JKMS flip-flop using
NAND gates.
21. Explain the construction and working of 4-bit up-counter with
its timing diagram.
22. What is shift register ? What are its types ? Explain any one
shift register with logic diagram.
23. What is race around condition ? How is it avoided in
JKMSFF ? Explain.
24. What is Ring Counter ? Explain the construction and working
of 3-bit ring counter with truth table.
25. Explain NAND gate and NOR gate using logic symbol and
truth table.
26. Explain the construction and working of Ex-OR gate using
basic gate. Give its logical symbol also.
27. Construct the following gate using NOR gate exclusively : (i)
AND (ii) OR (iii) Ex-NOR.
28. State and prove : (i) Associative law (ii) Distributive law.
29. What is K-map ? Simplify the following equation using K-
map :
f(A, B, C) = Sm (1, 4, 5, 6).
30. State and prove the De-Morgan’s theorem for three variables.
31. Simplify the following expression using K-map and draw the
logical circuit for the simplified expression :
f(A, B, C, D) = ABCD + A BCD + ABCD + ABCD + A BCD + A BC D .

32. Do as directed : (i) (1011)2 = ( )10 (ii) (ABC)16 = ( )8


33. Explain the method of converting a decimal number into its
binary equivalent with suitable example.
34. Explain the method of converting a binary number into gray
code.
35. Explain BCD code.
36. How are real numbers represented ? Explain.
37. What is overflow and underflow ? Explain.
38. Explain the method of 2’s complement method of subtraction.
39. How are negative numbers represented ? Explain .
40. Why is NOR gate called as universal building block ?
41. Draw logic diagram of construction of all basic gates using
only NAND gates
42. What are the differences between sequential and combinational
circuit ? Explain the construction and working of a half adder
circuit using logic gates.
43. What is Decoder ? Explain the construction and working of 2 :
4 decoder with logic gates. Give its truth table also.
44. Design a 8 : 1 MUX circuit using 4 : 1 MUX circuit. Give its
truth table also.
45. What is parallel adder ? Explain the construction and working
of 4-bit binary adder circuit.
46. Explain the construction and working of JKFF using NAND
gate. Explain race around condition in it.
47. Explain the construction and working of 4-bit down counter
with its timing diagram.
48. What is Ring Counter ? Explain the construction and working
of 3-bit ring counter with truth table.
49. What is Encoder ? Explain.
50. What is shift register ? Explain the types of shift registers.

You might also like