UNIVERSITY OF SWAZILAND Faculty of Science

Similar documents
UNIVERSITY OF SWAZILAND Faculty of Science

DIGITAL ELECTRONICS. P41l 3 HOURS

Digital logic fundamentals. Question Bank. Unit I

CHAPTER-2 STRUCTURE OF BOOLEAN FUNCTION USING GATES, K-Map and Quine-McCluskey

Injntu.com Injntu.com Injntu.com R16

QUESTION BANK FOR TEST


CPSC 121 Some Sample Questions for the Final Exam Tuesday, April 15, 2014, 8:30AM

B.Tech II Year I Semester (R13) Regular Examinations December 2014 DIGITAL LOGIC DESIGN

1. Mark the correct statement(s)

Philadelphia University Student Name: Student Number:

CPSC 121 Midterm 1 Friday October 14th, Signature: Section (circle one): 11:00 15:30 17:00

CE161-4-AU UNIVERSITY OF ESSEX. Undergraduate Examinations 2014 DIGITAL SYSTEMS ARCHITECTURE. Time allowed: TWO hours

Code No: R Set No. 1

R10. II B. Tech I Semester, Supplementary Examinations, May

Code No: R Set No. 1

CS470: Computer Architecture. AMD Quad Core

CSE 20 DISCRETE MATH. Fall

Module -7. Karnaugh Maps

CSE 20 DISCRETE MATH. Winter

IT 201 Digital System Design Module II Notes

VALLIAMMAI ENGINEERING COLLEGE

DKT 122/3 DIGITAL SYSTEM 1

END-TERM EXAMINATION

UPY14602-DIGITAL ELECTRONICS AND MICROPROCESSORS Lesson Plan

SUBJECT CODE: IT T35 DIGITAL SYSTEM DESIGN YEAR / SEM : 2 / 3

Code No: 07A3EC03 Set No. 1

R a) Simplify the logic functions from binary to seven segment display code converter (8M) b) Simplify the following using Tabular method

R07. Code No: V0423. II B. Tech II Semester, Supplementary Examinations, April

VALLIAMMAI ENGINEERING COLLEGE

SIDDHARTH GROUP OF INSTITUTIONS :: PUTTUR Siddharth Nagar, Narayanavanam Road QUESTION BANK (DESCRIPTIVE)

Code No: R Set No. 1


Computer Organization and Levels of Abstraction

CHAPTER 9 MULTIPLEXERS, DECODERS, AND PROGRAMMABLE LOGIC DEVICES

VALLIAMMAI ENGINEERING COLLEGE. SRM Nagar, Kattankulathur DEPARTMENT OF ELECTRONICS AND COMMUNICATION ENGINEERING EC6302 DIGITAL ELECTRONICS

Date Performed: Marks Obtained: /10. Group Members (ID):. Experiment # 09 MULTIPLEXERS

Midterm Exam Review. CS 2420 :: Fall 2016 Molly O'Neil

CONTENTS CHAPTER 1: NUMBER SYSTEM. Foreword...(vii) Preface... (ix) Acknowledgement... (xi) About the Author...(xxiii)

CS8803: Advanced Digital Design for Embedded Hardware

BUILDING BLOCKS OF A BASIC MICROPROCESSOR. Part 1 PowerPoint Format of Lecture 3 of Book

MULTIMEDIA COLLEGE JALAN GURNEY KIRI KUALA LUMPUR

Introduction to Computer Architecture

10EC33: DIGITAL ELECTRONICS QUESTION BANK

(ii) Simplify and implement the following SOP function using NOR gates:

2.6 BOOLEAN FUNCTIONS

Combinational Logic Circuits

2. BOOLEAN ALGEBRA 2.1 INTRODUCTION

Experiment 4 Boolean Functions Implementation

Student Number: UTORid: Question 0. [1 mark] Read and follow all instructions on this page, and fill in all fields.

DIGITAL ARITHMETIC: OPERATIONS AND CIRCUITS

CS6201 DIGITAL PRINCIPLES AND SYSTEM DESIGN Lecture Notes

SIR C.R.REDDY COLLEGE OF ENGINEERING, ELURU DEPARTMENT OF INFORMATION TECHNOLOGY LESSON PLAN

LSN 4 Boolean Algebra & Logic Simplification. ECT 224 Digital Computer Fundamentals. Department of Engineering Technology

Propositional Calculus. Math Foundations of Computer Science

Computer Organization and Levels of Abstraction

Question Total Possible Test Score Total 100

University of Toronto Faculty of Applied Science and Engineering Edward S. Rogers Sr. Department of Electrical and Computer Engineering

Hours / 100 Marks Seat No.

Discrete structures - CS Fall 2017 Questions for chapter 2.1 and 2.2

Binary Adders: Half Adders and Full Adders

TWO-LEVEL COMBINATIONAL LOGIC

ECE 2020B Fundamentals of Digital Design Spring problems, 6 pages Exam Two 26 February 2014

Boolean Algebra & Digital Logic

Chapter Three. Digital Components

Written exam for IE1204/5 Digital Design Thursday 29/

COMBINATIONAL LOGIC CIRCUITS

DHANALAKSHMI SRINIVASAN COLLEGE OF ENGINEERING AND TECHNOLOGY

Scheme G. Sample Test Paper-I

IA Digital Electronics - Supervision I

4 KARNAUGH MAP MINIMIZATION

COMPUTER ARCHITECTURE AND ORGANIZATION Register Transfer and Micro-operations 1. Introduction A digital system is an interconnection of digital

CS1800 Discrete Structures Final Version A

4 Operations On Data 4.1. Foundations of Computer Science Cengage Learning

ECE 2030B 1:00pm Computer Engineering Spring problems, 5 pages Exam Two 10 March 2010

ECE 2020B Fundamentals of Digital Design Spring problems, 6 pages Exam Two Solutions 26 February 2014

Electronic Engineering Part 1 Laboratory Experiment. Digital Circuit Design 1 Combinational Logic. (3 hours)

To prove something about all Boolean expressions, we will need the following induction principle: Axiom 7.1 (Induction over Boolean expressions):

5. (a) What is secondary storage? How does it differ from a primary storage? (b) Explain the functions of (i) cache memory (ii) Register

COMPUTER SCIENCE. Paper 1

Read this before starting!

To prove something about all Boolean expressions, we will need the following induction principle: Axiom 7.1 (Induction over Boolean expressions):

Digital Fundamentals. Lab 6 2 s Complement / Digital Calculator

[Ch 6] Set Theory. 1. Basic Concepts and Definitions. 400 lecture note #4. 1) Basics

NH 67, Karur Trichy Highways, Puliyur C.F, Karur District DEPARTMENT OF INFORMATION TECHNOLOGY CS 2202 DIGITAL PRINCIPLES AND SYSTEM DESIGN

Digital Logic Design Exercises. Assignment 1

Combinational Logic II

R07

II/IV B.Tech (Regular/Supplementary) DEGREE EXAMINATION. Answer ONE question from each unit.

CPSC 121 Midterm 1 Friday February 5th, Signature: Section (circle one): Morning Afternoon

Chapter 3 Simplification of Boolean functions

HANSABA COLLEGE OF ENGINEERING & TECHNOLOGY (098) SUBJECT: DIGITAL ELECTRONICS ( ) Assignment

EXPERIMENT #8: BINARY ARITHMETIC OPERATIONS

Dec Hex Bin ORG ; ZERO. Introduction To Computing

PART B. 3. Minimize the following function using K-map and also verify through tabulation method. F (A, B, C, D) = +d (0, 3, 6, 10).

INDIAN INSTITUTE OF TECHNOLOGY KHARAGPUR Stamp / Signature of the Invigilator

Binary Decision Diagrams

BOOLEAN ALGEBRA AND CIRCUITS

Chapter 3. Boolean Algebra and Digital Logic

2008 The McGraw-Hill Companies, Inc. All rights reserved.

Transcription:

UNIVERSITY OF SWAZILAND Faculty of Science Department of Computer Science Supplementary Examination - July 2013 Title of Paper: LOGIC FOR COMPUTER SCIENCE Course Number: CS235 Time Allowed: 3 hours Total Marks:l00 Instructions to candidates: This question paper consists ofsix (6) questions. Answer any FOUR (4) questions. Marks are indicated in square brackets. All questions carry equal marks. SPECIAL REQUIREMENTS: NO CALCULATORS ALLOWED FOR THIS EXAM THIS EXAMINATION PAPER SHOULD NOT BE OPENED UNTIL PERMISSION HAS BEEN GRANTED BY THE INVIGILATOR Page 1 ofs

QUESTIONl a) i) State 2 limitations oftruth tables. [2] ii) List 3 areas ofapplication oflogic in Computer Science. [3] b) Explain the difference between the following terms: i) Propositional logic syntax and propositional logic semantics. [2] ii) Atomic and Compound propositions [2] c) Suppose you encounter three members A, B and C of the island of TuFa (remember that the Tu's always tell the truth, the Fa's always lie). They each give you a statement which we will assume you have translated into propositional logic as follows, where A denotes the statement: Member A says:... (A V B V C) A (... A V... B V... C) Use the truth table to determine whether A's proposition is a Tautology, a Contradiction or Contingent. To which tribe does this member belong? [10] d) What is the value of x after each of the following statements are encountered in a computer program, ifx 1 before the statement is reached. Explain fully. i) if 2 + 3 = 6 AND 3 + 4 == 7 then x:== x + 1 [3] ii) if 2 + 3 == 6 XOR 3 + 4 == 7 then x:= x + 1 [3] QUESTION 2 a) i) Using truth tables, show that (AVB)-+ C is equivalent to (A-+C)A (B-+C) [4] ii) From the truth table in i) above, determine the Conjunctive Normal Form (CNF) and the Disjunctive Normal Form (DNF) of(a V B)-+ C [6] b) Three boys, Melusi, Brian and Nkosi are caught, suspected ofbreaking the glass in a lab. - Melusi says: "Brian did it; Nkosi is innocent", - Brian says: "IfMelusi is guilty then so is Nkosi". Nkosi says: "I didn't do it; one ofthe others did", i) Are the statements consistent? [6] ii) Assuming that everyone is innocent, who told lies? [3] iii) Assuming that everyone's statement is true, who is innocent and who is guilty? [2] c) Using laws of equivalence, show that i) [.., P A (p V q)] -+ q is a tautology. [4] Page 20f5

QUESTION 3 a) A traditional children's riddle concerns a Farmer who is traveling with a sack of Rye, a Goose, and a mischievous Dog. The farmer comes to a river that he must cross from east to west. A boat is available, but it only has room for the farmer and one of his possessions. If the farmer is not present, the goose will eat the rye or the dog will eat the goose. We wish to design a circuit to emulate the conditions ofthis riddle. A separate switch is provided for the farmer, the rye, the goose and the dog. Each switch has two states, depending on whether the corresponding object is on the east bank or the west bank ofthe river. The rules of play stipulate that no more than two switches be moved at a time and that the farmer must move (to row the boat) each time switch are moved. The switch for the farmer provides logic signal F, which is high ifthe farmer is on the east bank and low if he is on the west bank. Similarly, logic signals (G for the goose, D for the dog and R for the rye) are high if the corresponding object is in the east bank and low if it is on the west bank. Construct the truth table for this riddle and hence find the Boolean logic expression based on the sum of products approach for a logic signal A (Alarm) that is high any time the rye or the goose are in danger of being eaten. Repeat for the product of sums approach. [12] b) Convert the following into SOP form and minimize using the Karnaugh map method. F= AB+ABC+BCD [8] c) Interpret the circuit diagram in1ik.j. and then complete the truth table that follows.[5] Ao---~ C BO-------- -------------~ Q Fig 1:, ~<ll:);:'<'l:, la<....{;!. <. ;c:;{b'.,'" ;<,jy... "'"j'" IQc.T,Y : \.." 0 0 1 0 0 1 1 1 1 0 0 0 1 1 0 0 C." Page 3 ofs

QUESTION 4 a) The state of a CPU register is 0100110101, what is its content if it represents: i. Digits in BCD ii. Digits in two's compliment [6] b) Simplify the following expression using Boolean theorems. (A+B)+C [4] c) i) Briefly explain the difference between the Karnaugh map method and the Quine- McCluskey method. [3] ii) Minimize the function F(A, B, C, D) =I (0,3,5,7,11,13,15) using the Quine- McCluskey method. [12] QUESTION 5 a) Convert i) 1023.062510 to binary [4] ii) 769 to BCD [2] iii) 93 to Hexadecimal [3] iv) 11 011.1011 to decimal [3] Show all the working. b) Find the 2's compliment representation of-73. Explain why the 2's complement arithmetic is commonly used as compared to other methods. [6] c) With the aid of well-labeled circuit diagrams, distinguish between the Half adder and full adder circuits in the way they operate. [7] Page 4 of5

QUESTION 6 a) Given A, A only ifb, B only ifc. Therefore C. Prove that the conclusion, C, is valid [3] b) With the aid ofclear diagrams explain the operations ofthe following: i) 4 to 1 - line Multiplexer [5] ii) 3 to 8 - line Decoder [5] c) "Ifthe program is running then there is at least 250K ofram." Which ofthe following are equivalent to this statement? [5] i) Ifthere is at least 250K ofram then the program is running. ii) Ifthere is less than 250K ofram then the program is not running. iii) The program will run only ifthere is at least 250K ofram. iv) Ifthe program is not running then there is less than 250K ofram. v) A necessary condition for the program to run is that there are at least 250K of RAM. d) Flip flops can be implemented using R-S, D-type or J-K. Explain the behavior ofj-k flip-flop. What additional logic is required to convert a J-K flip-flop into a D-type flip flop? [7] «<End of Question Paper»> PageS ofs