Logic Circuits (630211) Final Exam Marking Scheme - Philadelphia University, Exams of Digital Logic Design and Programming

Digital Logic Design and Programming

Typology: Exams

2021/2022

Uploaded on 06/12/2023

robot-tech
robot-tech ๐Ÿ‡ช๐Ÿ‡ฌ

6 documents

1 / 6

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
Philadelphia University
Faculty of Engineering
Marking Scheme
Exam Paper
BSc CE
Logic Circuits (630211)
Final Exam First semester Date: 03/02/2019
Section 1
Weighting 40% of the module total
Lecturer: Dr. Qadri Hamarsheh
Coordinator: Dr. Qadri Hamarsheh
Internal Examiner: Dr. Naser Halasa
pf3
pf4
pf5

Partial preview of the text

Download Logic Circuits (630211) Final Exam Marking Scheme - Philadelphia University and more Exams Digital Logic Design and Programming in PDF only on Docsity!

Philadelphia University

Faculty of Engineering

Marking Scheme

Exam Paper

BSc CE

Logic Circuits (630211)

Final Exam First semester Date: 03/02/

Section 1

Weighting 40% of the module total

Lecturer: Dr. Qadri Hamarsheh

Coordinator: Dr. Qadri Hamarsheh

Internal Examiner: Dr. Naser Halasa

Marking Scheme Logic Circuits (630211)

The presented exam questions are organized to overcome course material through 6 questions. The all questions are compulsory requested to be answered. Marking Assignments

Question 1 This question is attributed with 10 marks if answered properly; the answers are the following:

  1. Which of the following is not a weighted value positional numbering system:

  2. Convert 5278 to binary. a) 011100111 b) 101010111 c) 111010101 d) 343

  3. The Gray code of the binary number 0101 is a) 1111 b) 1000 c) 0111 d) None of the above

  4. Simplification of the Boolean expression ๐‘จ๐‘ฉ + ๐‘จ๐‘ฉ๐‘ช + ๐‘จ๐‘ฉ๐‘ช๐‘ซ + ๐‘จ๐‘ฉ๐‘ช๐‘ซ๐‘ฌ + ๐‘จ๐‘ฉ๐‘ช๐‘ซ๐‘ฌ๐‘ญ yields which of the following results? a) (^) ๐€๐ b) (^) ๐€๐ + ๐‚๐ƒ + ๐„๐… c) (^) ๐‘จ๐‘ฉ๐‘ช๐‘ซ๐‘ฌ๐‘ญ d) (^) ๐€ + ๐ + ๐‚ + ๐ƒ + ๐„ + ๐…

5) Applying DeMorgan's Law to f^ ๏€ฝ^ AB^ ๏€ซ^ C^ ๏€จ E^ ๏€ซ D ๏€ฉwill result in:

a) (^) f ๏€ฝ A ๏€ซ B ๏€ซ C ๏€ซ E ๏€ซ D b) f ๏€ฝ A B C ๏€ซ E D

c) (^) f ๏€ฝ A B C ๏€ซ ( E ๏€ซ D ) d) f ๏€ฝ A ๏€ซ B ๏€ซ C ๏€ซ E D

  1. From the truth table below, determine the standard SOP expression.

a) b) c) d) 7 ) The logic function implemented by the circuit below is (ground implies a logic โ€œ0โ€)

a) (^) ๐‘ญ = ๐‘จ๐‘ต๐‘ซ (๐‘ท, ๐‘ธ) b) (^) ๐‘ญ = ๐‘ถ๐‘น (๐‘ท, ๐‘ธ) c) ๐‘ญ = ๐‘ฟ๐‘ถ๐‘น (๐‘ท, ๐‘ธ) d) ๐‘ญ = ๐‘ฟ๐‘ต๐‘ถ๐‘น (๐‘ท, ๐‘ธ)

  1. The characteristic equation of S-R latch is a) ๐‘ธ(๐’ + ๐Ÿ) = ๐‘บโ€™๐‘น + ๐‘ธ(๐’)๐‘น b) ๐‘ธ(๐’ + ๐Ÿ) = (๐‘บ + ๐‘ธ(๐’))๐‘นโ€™ c) ๐‘ธ(๐’ + ๐Ÿ) = ๐‘บ๐‘น + ๐‘ธ(๐’)๐‘น d) ๐‘ธ(๐’ + ๐Ÿ) = ๐‘บโ€™๐‘น + ๐‘ธโ€ฒ(๐’)๐‘น

a) hexadecimal b) binary c) binary-coded decimal d) octal

Question 3 This question is attributed with 4 marks if answered properly; the answers are the following: Implement full adder circuit using 4:1 multiplexers.

Solution

Question 4 This question is attributed with 7 marks if answered properly; the answers are the following: a) Derive the Boolean equations for D and ๐ต๐‘œ๐‘ข๐‘ก. (3 marks) Solution

b) Implement D and ๐ต๐‘œ๐‘ข๐‘ก logic circuits. (2 marks) Solution

P __^ P Q __^ Q Bin B __ in

D

Bout

c) Design the 1-bit full subtractor using 3x8 decoder. (2 marks) Solution

Bin

Q

0

1

2

D E C O D E R

P

3x

D

Bout

Question 5 This question is attributed with 6 marks if answered properly; the answers are the following:

Solution

The flip flop input equations are

The output equations are

D flip flops Thus

State table

State diagram

Question 6 This question is attributed with 7 marks if answered properly; the answers are the following: