SSN COLLEGE OF ENGINEERING, KALAVAKKAM Department of Computer Science and Engineering

B.E. (CSE) III semester UNIT TEST I (Lateral Entry) 141302 - Digital Principles & system Design Staff: Mr. K.R Sarath Chandran/Ms. M. A. Padma Priya Max. Marks: 50

Date: 2.09.2011 Time: 08.00 09:40 a.m.

PART-A: [5*2=10] 1. What are Self-Complementing Codes? 2. Convert the binary number 10110001101011.11110010 to Hexadecimal and Octal 3. What is the largest binary number that can be expressed with 10 bits? What is the equivalent decimal and hexadecimal? 4. Simplify Y=ABC + ABC+ABC+ABC+ABC+ABC using Boolean algebra. 5. Differentiate Canonical and standard forms. PART B: [8+16+16 =40]

6. a. What is a Binary code? List down and explain different binary codes in detail. [4] b. Design a half subtractor circuit. [4] Answer any two: 7. a. Explain the parity scheme of error detection and what is the disadvantage of it. [4] b. Subtract the following: i) -40 from -32 using 2s complement (use 8 bit representations) [3] ii) 2997-7992 using 9s and 10s complement. [5] iii) Given X=1010100 and Y=1000011, perform X-Y and Y-X using 1s complement [4] 8. a) Simplify F(A,B,C,D) = (0,2,5,7,8,10,11,13,15) using Tabulation Method [6] b) Simplify the following Boolean expressions by using k-map and draw the logic diagram for the simplified expression. i) F(A,B,C,D) = (0,6,8,13,14) and d(A,B,C,D)= (2,4,10) [5] ii) F=ABC+BCD+BCD+ACD+ABC+ABCD [5] 9. a) State and prove consensus theorem (Proof for both law and its Dual) b) Simplify F(A,B,C,D,E)= (0,2,4,6,9,13,21,23,25,29,31) using k-map c) Express the Boolean function F=xy+xz in product of maxterm using Boolean algebra. d) Find the complement of F1 = xyz + xyz e) Find the dual of F1= x ( yz + yz ) ******** ALL THE BEST ******* [4] [4] [4] [2] [2]

Prepared by A Sec Staff

Reviewed by HOD-CSE B Sec Staff