Scribd
Upload
14 views5 pages

DLCoA Sample Questions For End Sem Exam 25

Uploaded by

sujeet.p
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
14 views5 pages

DLCoA Sample Questions For End Sem Exam 25

Uploaded by

sujeet.p
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/ 5

Sample Questions for ESE (AY-2024-25)

Subject: DLCA (Sem- III) Class = SY (A&B)

===================================================================

Questions

1. i)The 4-bit Gray code for decimal number 5 is

ii)Convert the following binary number to octal 010111100

2. i) Convert binary 111111110010 to hexadecimal

3. Give the Gray code for the binary number (11101)2

4. i) Find the ASCII code of – “ Welcome to Mumbai ”


ii) The collection of 8-bits is called as -

5. i) ______________ are universal gates.


ii) Generally Dynamic RAM is used as main memory in a computer system as it
_____

6. Which of the following registers holds the address of an next instruction?


Booths algorithm is applied on
7. 100101 × 011 =?

8. 2’s complement of 11001011 is ?


9.
Convert (a) 10010011101011012 to Octal
(b) 10010001011.001011102 to hexadecimal
10. Design 16:1 MUX using 4:1 MUX
11. For 132.65 obtain the IEEE 754 standards of Single precision and Double precision format

12. Draw the single and double precision format for representing floating point number using
IEEE 754 standards and explain the various fields
13. Perform hexadecimal addition (2F8 + 5A3)16

14. Write number 85.125)10 in IEEE 754 format.

15. Perform the following addition using BCD addition (205+569)

16. Perform the following addition using Excess-3 addition (205+569)

17. Convert FACE16 into its binary, octal, and decimal equivalent

18. Convert 23.62510 to binary, octal, and decimal equivalent

19. Perform the following


i) 1011.01 x 110.1
ii) 11111 x 1001
i) 10010 % 11
ii) 1101001 % 101
20. For 132.65 obtain the IEEE 754 standards of Single precision and Double precision format

21. State and prove De-Morgan’s theorem

22. Perform the following-


i) Convert (340) 10 to excess-3 code.
ii) Convert Hexadecimal to decimal: DADA
iii)Hexadecimal to binary conversion: 3A9D

23. Design and explain full adder using half adders and few gates.
24. Differentiate Combinational circuit and Sequential circuit.

25. Explain Full adder in detail.


26. Explain different types of codes used in digital systems with its Advantages and
Disadvantages.
27. Explain ASCII code and Gray code in detail with its applications.

28. Differentiate between Computer Organization and Computer Architecture.

29. Describe the detailed Von-Neumann Model with a neat block diagram

30. Give the block level description of various functional units of a computer.

31. Draw basic organization of computer and explain block level functional units
32. Which gates are called as Universal gate and what are its advantages?
33. i) Perform (2)10 - (5)10 using 1’s complement method
ii) Perform (2)10 - (5)10 using 2’s complement method (use 8 Bit word)
34. Subtract (1010)2 from (1111)2 using 2's complement method.
35. Perform (25)10 – (34)10 in BCD using 9s compliment.
36. Perform (87)10 – (39)10 in BCD using 9s compliment.
37. Perform (8)10 – (3)10 in BCD using 9s compliment.

38. Perform the following addition using i) BCD and Excess-3addition (205+569)
ii)Hexadecimal to binary conversion: (3A9D)16
39. Solve the following
i) (7A6)16 - (2BA)16 using Hexadecimal Arithmetic
ii) (85)10 – (32)10 using 1’s Compliment Arithmetic

40. i) (7F5)16 + (5BD)16 using Hexadecimal Arithmetic

41. Explain ASCII code in detail with its applications.

42. Convert (a) (475.25)8 to its decimal equivalent


(b) (549.B4)16 to its binary equivalent
Number 85 in BCD code is
Determine (377)10 in Octal, Binary and Hexa-Decimal equivalent.

44. Convert 14316 into its binary, octal, Hexadecimal and binary coded decimalequivalent.

45. Convert 11510 and 23510 to hexadecimal numbers.

46. Draw the flow chart of Booths algorithm for signed multiplication and Perform -5 X
2 using Booth’s algorithm
47. Multiply (17) and (5) using Booth’s algorithm.

48. Multiply (-5) and (2) using Booth’s algorithm.

49. Draw the flow chart of non-restoring division algorithm and Perform (4 ÷2 )10

50. Explain Non-restoring Division Algorithm in detail with flowchart.

51. Explain Restoring Division Algorithm in detail with flowchart


52. Use Non-restoring Division Algorithm to Divide (17/3)10
53. Using step by step restore division algorithmic procedure solve the following
(11/3)10
54. Explain advantages of Multiplexer and De- Multiplexer
55. Explain 4X1 MUX with Logic Circuit
56. Design 8:1 MUX using 4:1 Mux with Logic Circuit
57. Implement the following expression using 8:1 MUX
F(A,B,C,D) = ∑ m(0,,3,4,6,7,10,15)
58. Implement the following expression using 8:1 MUX
F(A,B,C,D) = π M (1,2,5,6,9,11,13)
59. Implement full adder using Demux with Logic Circuit

60. Implement full adder using 8:1 Mux and Draw the Logic Diagram.

61. Implement full adder using 16:1 Mux using 8:1 Mux and Draw the Logic Diagram.
62. Implement full adder using 16:1 Mux using 4:1 Mux and Draw the Logic Diagram.
63. Explain applications of Multiplexer and De- Multiplexer
64. Design 1X8 De-multiplexer using 1X4 and 1X2 De-multiplexer
65. Design 1X8 De-multiplexer using 1X2 De-multiplexer
66. Design 1X8 De-multiplexer using 1X4 De-multiplexer
67. Explain 4 to 2 Encoder with its circuit diagram

68. Explain Octal to Binary Encoder (8 to 3 Encoder) with its circuit diagram

69. Explain Decimal to BCD Encoder with its circuit diagram

70. Explain 16 to 4 Encoder with its circuit diagram

71. Explain 2 to 4 Decoder with its circuit diagram


Explain 3-to-8-line decoder with its circuit diagram
73. Explain 4-to-16-line Decoder with its circuit diagram
74. Explain Applications of Encoder and Decoder
75. Explain Advantages and Disadvantages of Encoder and Decoder
76. Explain S-R Flip-Flop in Detail
77. Explain J-K Flip-Flop in Detail
78. Explain D Flip-Flop in Detail
79. Explain T Flip-Flop in Detail
80. Explain Register Organization in detail
81. Explain the different addressing modes with example
82. Describe characteristics of Hardwired Control Unit
83. Explain State Table Method in detail.
84. Explain Delay Element Method in detail.
85. Describe Architecture of Hardwired Control Unit
86. Differentiate between Hardwired control unit and Micro programmed control unit
87. Draw and explain functioning of the micro-programmed control unit.
88. Describe Micro Instruction-Format
89. Explain the instruction cycle with the help of a neat state diagram
90. Explain Sequencing and execution of the micro-programmed control unit.
91. Explain Micro operations with example.
92. Describe characteristics of memory /List & Explain the Characteristics of Memory
93. Enlist types of RAM and ROM.
94. Explain Types of RAM
95. Explain Types of ROM
96. Explain Memory Hierarchy in detail
97. Describe the role of Cache Memory.
98. Differentiate RAM and ROM
99. Explain locality of reference in Detail.
100. Describe Cache coherence and write policies
101. Explain Interleaved Memory in Detail.
102. Explain Associative Memory in Detail.
103. Write a short note: Interleaved and Associative memory.
104. Explain Cache Memory with its operation
105. Basic Pipelined Data path and control in Detail
106. Explain Data dependencies in detail.
Explain Instruction hazards in detail
108. Explain Data hazards in detail.
109. Explain Branch hazards in detail.
110. Explain instruction pipelining
111. Draw and explain 4 stage instruction pipelining and briefly describe the hazards
associated with it
112. Explain Micro instruction format and write a microprogram for the instruction ADD
R1, R2
113. Write microprogram for instruction MOV A, B (copy the contents of Register B to
Register A).
114. Enlist the types of Flynn’s classification
115. Explain Flynn’s classification in detail with block diagram.
116. Explain delayed branch and branch prediction in detail
117. Explain Performance measures in detail
118. Define throughput of CPU?
119. List out the performance measures of CPU
120. Explain Amdhal’s law in detail
121. Enlist different types of bus arbitration types and explain one in detail.
122. Explain Centralized bus arbitration method in detail.
123. Explain Distributed bus arbitration method in detail.
124. Explain function of CPI, ISA and PCI Bus.
125. Explain the function of PCI Bus?
126. Explain the function of ISA Bus.

All the Best!

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy