Syllabuses


Design half adder using NAND gates. Also draw the truth table.

Design half adder using NAND gates. Also draw the truth table.

Design an 8-input to 3-output decoder using NAND gates only. Draw the logic diagram.

Design an 8-input to 3-output decoder using NAND gates only. Draw the logic diagram.

How a multiplexer can be used as ROM? Explain in brief.

How a multiplexer can be used as ROM? Explain in brief.

Explain the addition of 1010 to 1101 using full adder step by step.

Explain the addition of 1010 to 1101 using full adder step by step.

Convert (138.32)<sub>10</sub> to i. Binary ii. Octal iii. Hexadecimal

Convert (138.32)<sub>10</sub> to i. Binary ii. Octal iii. Hexadecimal

Design a combinational logic circuit with inputs A, B, C, D. The output Y goes high only if A and C are high. Draw the truth table and Boolean function using K-map. Draw the circuit diagram.

Design a combinational logic circuit with inputs A, B, C, D. The output Y goes high only if A and C are high. Draw the truth table and Boolean function using K-map. Draw the circuit diagram.

Simplify the Boolean function F together with the don't-care conditions in the following function

Simplify the Boolean function F together with the don't-care conditions in the following function

Explain Quick sort? Sort the following elements using Quick sort - 32, 23, 56, 78, 12, 66, 37, 93, 29, 80

Explain Quick sort? Sort the following elements using Quick sort - 32, 23, 56, 78, 12, 66, 37, 93, 29, 80

Explain briefly. i) Minimum Spanning Tree ii) Applications of Graph

Explain briefly. i) Minimum Spanning Tree ii) Applications of Graph

What is a binary search? Write its properties.

What is a binary search? Write its properties.