DIPLOMA IN COMPUTER STUDIES PROGRESS TEST
|
|
- Randolf Flynn
- 5 years ago
- Views:
Transcription
1 DIPLOMA IN COMPUTER STUDIES PROGRESS TEST UNIT CODE: TIME: RM104 2 HOURS 10 MINUTES (including 10 minutes reading time) CENTRE CODE: UNIT CLASS CODE: TEST DATE: STUDENT-ID: STUDENT NAME: LECTURER: INSTRUCTIONS 1. Section A is compulsory. 2. Section B choose any 2 questions out of the 3 questions. 3. Please start every question in a new page. 4. Answers will not be marked if it is illegible. 5. Enter the question number (in the order you have attempted) in the boxes provided below: Question Number Score A Total DCS/RM104/S03/TEST/T101/MS 1
2 SECTION A [40 marks] Answer ALL questions in this section. A1. a) Convert the following : i) A2F Hexadecimal to Binary [1] ii) Binary to Octal [1] iii) 23 Denary to Binary [1] i) [1] ii)326 [1] iii)10111 [1] b) Evaluate [2] correct working [1] correct answer [1] A2. A specialist clock-maker constructs a 24-hour clock for computer programmers which displays all it numbers in binary. For example the time 1:05 pm (i.e.13.05) would display as 1101:101. (a) What time is it when the clock reads 1110:10000? [ 1 ] 14:16 [1] (b) What time is it when the clock reads 10111:111010? [ 1 ] 23:58 [1] (c) What would the clock read if the time were 10:30 in the morning? [ 2 ] 1010:11110 [2] DCS/RM104/S03/TEST/T101/MS 2
3 (d) What would the clock read 25 minutes after it read 1101:101111? [ 2 ] 25 = [1] 1101: =1110:1100 [1] {No mark for 1101: } A3. A 4 bit register is used to add binary integers held in 2's complement. Show the contents when the following calculations are performed: a) [2] b) 6 + (-2) [2] c) (-8) + 3 [2] d) (-5) + (-4) [2] a) 1010 [2] b) 0100 [2] c) 1011 [2] d) 0111 [2] A4. a) State two ways to store exponent. [ 2 ] 2's complement and excess form. [2] b) State two ways to store mantissa. [ 2 ] sign modulus and 2's complement [2] c) A 16-bit representation uses the first bit for the sign of the mantissa, the next 5 bits for the exponent in excess form, and the rest for the normalised mantissa. Show how this representation would store the number [5] = = DCS/RM104/S03/TEST/T101/MS 3
4 Exponent: = = for sign bit [1] 5 bit exponent correct [1] putting exponent in excess form correct [1] for getting = [2] A5. State which of the following statement is TRUE/FALSE? a) Inherent error exists by itself in the measurement scale. b) Overflow error occurs if the least significant value is dropout when storing a value. c) Induced error is brought in from outside by external factors. d) The difference between the true value and the reported value is known as relative error. e) Error of propagation is the spread of errors as a result of arithmetic operations on values which already have errors. f) The difference between the minimum and maximum possible reported value is known as Error Bound. [6] a) True b) False c) True d) False e) True f) True [6] DCS/RM104/S03/TEST/T101/MS 4
5 A6. By drawing a truth table verify that [6] (A+B). (A+C) = A + (B.C) A B C A+B A+C (A+B).(A+C) B.C A+(B.C) [1] [1] [1] Showing correct inputs for A,B,C [1] Showing the coloumns (A+B).(A+C) = A+(B.C) [2] DCS/RM104/S03/TEST/T101/MS 5
6 B1. SECTION B Answer TWO questions ONLY. [60 marks] a) Distinguish between inherent and induced errors, and illustrate each one with an example [ 6 ] Inherent errors exist within the measurement of a quantity [2] e.g. height in cm is 0.5 cm [1] [or other reasonable example ] Induced errors occur due to external factors [2] e.g. pi cannot be stored exactly in a computer [1] [ or other reasonable example ] b) Explain how to calculate : (i) absolute error [ 4 ] E a = reported value - true value [2] for mentioning modulus or difference [1] for a complete, correct formula (e.g. as above) or explanation in words [1] (ii) relative error [ 4 ] E r = E a / true value [1] for taking modulus of result [1] for a complete, correct formula (e.g. as above) or explanation in words [1] for mentioning that reported value should be used if true value is unavailable [1] DCS/RM104/S03/TEST/T101/MS 6
7 c) i) In the Venn Diagram below, shade C B A. U B [2] A C Given that : A = {x : x is a multiple of 3} B = {x : x is a multiple of 5} C = {x : x is a multiple of 7} Where U = {x : 10 x 17 } Draw a Venn Diagram which illustrates this situation. [3] List the elements of the set: ii) A B C [2] iii) (A C) B [2] iv) (B C) A [2] i) U C B A [2] DCS/RM104/S03/TEST/T101/MS 7
8 A U 11,17, 16,13, B C For a 3 circle Venn diagram in a box [1] Correct labelling for A, B, C and U (or ξ) [1] For correct placement of numbers [1] ii) { 11, 13, 16, 17} [2] iii) {15} [2] iv) {12} [2] d) A Queue is currently empty. Show how it would appear after each of the following operations has been performed in the order given: i) push 10 [1] ii) push 7 [1] iii) pop [1] iv) push 2 [1] v) push 8 [1] i) 10 [1] ii) 7 10 [1] iii) 7 [1] DCS/RM104/S03/TEST/T101/MS 8
9 iv) 2 7 [1] v) [1] B2. a) Consider the following circuit diagram A B C D Y X State the values of X and Y ( true or false ) when : (i) A, B, C and D are full false [ 2 ] X false [1] Y true [1] (ii) A, B, C and D are all true [ 2 ] X true [1] Y false [1] (iii) A and B are false, C and D are true [ 2 ] X false [1] Y false [1] DCS/RM104/S03/TEST/T101/MS 9
10 b) Consider the following circuit diagram : A B C X (i) Construct an expression in Boolean algebra which describes this circuit. [ 2 ] X = ( A. C) + ( B + C) [2] (ii) Simplify the expression you constructed in part (i) [ 3 ] X = A. C + B + C = A. C + B. C = A. C + B. C = ( A + B). C [3] (iii) Represent your answer to part(ii) as a circuit diagram. [ 3 ] A B C X [3] c) Simplify the following expression A.B.C + A.B.C + A.B.C + A.B.C + A.B.C [6] A'.B'.C' + A'.B.C' + A'.B.C + A.B'.C' + A.B.C' = A'.B'.C' + A'.B(C'+ C) + A.C'(B'+ B) [1] = A'.B'.C' +A'.B +A.C' [1] = A'(B'.C' + B) + A.C' [1] = A'(B + C') + AC' [1] DCS/RM104/S03/TEST/T101/MS 10
11 = A'.B + C'(A' + A) [1] = A'.B + C' [1] d) If A = 2-1, B = and C = 1-1, perform the following calculations: a) A B [2] b) C B [3] c) C A [3] d) Pre-multiply A by 1 0 [2] 0 1 a) (deduct 1 mk for minor error) [2] b) [3] (deduct 1 mk for minor error) c) -2-6 DCS/RM104/S03/TEST/T101/MS 11
12 (deduct 1 mk for minor error) [3] d) [2] (deduct 1 mk for minor error) B3. a) If 32 people, in all, use (S) preadsheet, (D) atabase and (W) ord-processing packages, 4 use ONLY (S), 2 use ONLY (D), 3 use ONLY (W), 7 use BOTH (S) and (D) but 5 use ALL THREE: i) Represent this information in a Venn Diagram; [4] ii) If the same number of people use BOTH (W) and (D) as use BOTH (W) and (S), fill in the remaining numbers in the diagram. [4] iii) How many people, in all, can use BOTH (S) and (W)? [2] iv) What is the probability that any two of the 32, met by chance, would be able to use EITHER (D) or (W) but NOT BOTH? [2] i) S D 5 8 DCS/RM104/S03/TEST/T101/MS 8 12 W
13 [4] ii)n(w D) =n( W S) =x x = (32-( ))/2 = 8 [4] iii) 13 [2] iv) 105/496 [2] b) The weekly wages of a group of skilled workers are as follows:- Weekly wages,$ Number of workers Find the mean and standard deviation of the data(to 2DP). [12] Class Interval Class Mark F Fx Fx f =110 fx =20940 fx 2 = Mean = fx/ f DCS/RM104/S03/TEST/T101/MS 13
14 = 20940/110 = SD = fx 2 / f ( fx/ f) 2 = /110 (190.36) 2 = = for a class mark column with correct boundaries [1] for a frequency column [1] for a correct frequency column [1] for an fx column [1] for a correct fx column [1] for an fx2 column [1] for a correct fx2 column [1] for correct mean([1] if incorrect but correct formula) [2] for correct SD([1] if incorrect but correct formula) [2] for stating DP for mean and SD [1] c) Explain what happens to the mean and SD of a set of numbers if: i) the numbers are all multiplied by 3 [2] ii) the numbers are all added by 4 [2] iii) the numbers are all multiplied by 1 [2] i) mean will be multiplied by 3 SD will be multiplied by 3 [2] ii) mean will increase by 4 SD remain unchange [2] DCS/RM104/S03/TEST/T101/MS 14
15 iii) mean will change sign(multiplied by 1) SD will not change [2] DCS/RM104/S03/TEST/T101/MS 15
DIPLOMA IN COMPUTER STUDIES PROGRESS TEST
DIPLOM IN COMPUTER STUDIES PROGRESS TEST UNIT CODE: TIME: RM104 2 HOURS 10 MINUTES (including 10 minutes reading time) CENTRE CODE: UNIT CLSS CODE: TEST DTE: STUDENT-ID: STUDENT NME: LECTURER: INSTRUCTIONS
More informationRead this before starting!
Points missed: Student's Name: Total score: /100 points East Tennessee State University Department of Computer and Information Sciences CSCI 2150 (Tarnoff) Computer Organization TEST 1 for Fall Semester,
More informationECE 2030D Computer Engineering Spring problems, 5 pages Exam Two 8 March 2012
Instructions: This is a closed book, closed note exam. Calculators are not permitted. If you have a question, raise your hand and I will come to you. Please work the exam in pencil and do not separate
More informationBawar Abid Abdalla. Assistant Lecturer Software Engineering Department Koya University
Logic Design First Stage Lecture No.5 Boolean Algebra Bawar Abid Abdalla Assistant Lecturer Software Engineering Department Koya University Boolean Operations Laws of Boolean Algebra Rules of Boolean Algebra
More informationECE 2020B Fundamentals of Digital Design Spring problems, 6 pages Exam Two Solutions 26 February 2014
Problem 1 (4 parts, 21 points) Encoders and Pass Gates Part A (8 points) Suppose the circuit below has the following input priority: I 1 > I 3 > I 0 > I 2. Complete the truth table by filling in the input
More information1. Mark the correct statement(s)
1. Mark the correct statement(s) 1.1 A theorem in Boolean algebra: a) Can easily be proved by e.g. logic induction b) Is a logical statement that is assumed to be true, c) Can be contradicted by another
More informationLogic Gates and Boolean Algebra ENT263
Logic Gates and Boolean Algebra ENT263 Logic Gates and Boolean Algebra Now that we understand the concept of binary numbers, we will study ways of describing how systems using binary logic levels make
More informationCDA 3103 Computer Organization Exam 1 (Sep. 22th, 2014)
CDA 3103 Computer Organization Exam 1 (Sep. 22th, 2014) Name: USF ID: Problem Points Score 1 10 2 10 3 15 4 15 5 10 6 20 otal 80 Exam Rules Use the back of the exam paper as necessary. But indicate clearly
More informationBinary Values. CSE 410 Lecture 02
Binary Values CSE 410 Lecture 02 Lecture Outline Binary Decimal, Binary, and Hexadecimal Integers Why Place Value Representation Boolean Algebra 2 First: Why Binary? Electronic implementation Easy to store
More informationMACHINE LEVEL REPRESENTATION OF DATA
MACHINE LEVEL REPRESENTATION OF DATA CHAPTER 2 1 Objectives Understand how integers and fractional numbers are represented in binary Explore the relationship between decimal number system and number systems
More informationECE 2020B Fundamentals of Digital Design Spring problems, 6 pages Exam Two 26 February 2014
Instructions: This is a closed book, closed note exam. Calculators are not permitted. If you have a question, raise your hand and I will come to you. Please work the exam in pencil and do not separate
More informationMarkscheme May 2017 Mathematical studies Standard level Paper 1
M17/5/MATSD/SP1/ENG/TZ/XX/M Markscheme May 017 Mathematical studies Standard level Paper 1 3 pages M17/5/MATSD/SP1/ENG/TZ/XX/M This markscheme is the property of the International Baccalaureate and must
More informationCombinational Circuits Digital Logic (Materials taken primarily from:
Combinational Circuits Digital Logic (Materials taken primarily from: http://www.facstaff.bucknell.edu/mastascu/elessonshtml/eeindex.html http://www.cs.princeton.edu/~cos126 ) Digital Systems What is a
More information-SQA- SCOTTISH QUALIFICATIONS AUTHORITY HIGHER NATIONAL UNIT SPECIFICATION GENERAL INFORMATION
-SQA- SCOTTISH QUALIFICATIONS AUTHORITY HIGHER NATIONAL UNIT SPECIFICATION GENERAL INFORMATION -Unit Number- 7481724 -Superclass- -Title- RB INTRODUCTORY MATHEMATICS FOR COMPUTING ----------------------------------------
More informationECE 2030B 1:00pm Computer Engineering Spring problems, 5 pages Exam Two 10 March 2010
Instructions: This is a closed book, closed note exam. Calculators are not permitted. If you have a question, raise your hand and I will come to you. Please work the exam in pencil and do not separate
More informationRead this before starting!
Points missed: Student's Name: Total score: /100 points East Tennessee State University Department of Computer and Information Sciences CSCI 2150 (Tarnoff) Computer Organization TEST 1 for Spring Semester,
More informationR07. Code No: V0423. II B. Tech II Semester, Supplementary Examinations, April
SET - 1 II B. Tech II Semester, Supplementary Examinations, April - 2012 SWITCHING THEORY AND LOGIC DESIGN (Electronics and Communications Engineering) Time: 3 hours Max Marks: 80 Answer any FIVE Questions
More informationMicrocomputers. Outline. Number Systems and Digital Logic Review
Microcomputers Number Systems and Digital Logic Review Lecture 1-1 Outline Number systems and formats Common number systems Base Conversion Integer representation Signed integer representation Binary coded
More informationEEE130 Digital Electronics I Lecture #4_1
EEE130 Digital Electronics I Lecture #4_1 - Boolean Algebra and Logic Simplification - By Dr. Shahrel A. Suandi 4-6 Standard Forms of Boolean Expressions There are two standard forms: Sum-of-products form
More informationSYNERGY INSTITUTE OF ENGINEERING & TECHNOLOGY,DHENKANAL LECTURE NOTES ON DIGITAL ELECTRONICS CIRCUIT(SUBJECT CODE:PCEC4202)
Lecture No:5 Boolean Expressions and Definitions Boolean Algebra Boolean Algebra is used to analyze and simplify the digital (logic) circuits. It uses only the binary numbers i.e. 0 and 1. It is also called
More informationCS/COE 0447 Example Problems for Exam 2 Spring 2011
CS/COE 0447 Example Problems for Exam 2 Spring 2011 1) Show the steps to multiply the 4-bit numbers 3 and 5 with the fast shift-add multipler. Use the table below. List the multiplicand (M) and product
More information4 Operations On Data 4.1. Foundations of Computer Science Cengage Learning
4 Operations On Data 4.1 Foundations of Computer Science Cengage Learning Objectives After studying this chapter, the student should be able to: List the three categories of operations performed on data.
More informationInjntu.com Injntu.com Injntu.com R16
1. a) What are the three methods of obtaining the 2 s complement of a given binary (3M) number? b) What do you mean by K-map? Name it advantages and disadvantages. (3M) c) Distinguish between a half-adder
More informationCOMP Overview of Tutorial #2
COMP 1402 Winter 2008 Tutorial #2 Overview of Tutorial #2 Number representation basics Binary conversions Octal conversions Hexadecimal conversions Signed numbers (signed magnitude, one s and two s complement,
More informationEE292: Fundamentals of ECE
EE292: Fundamentals of ECE Fall 2012 TTh 10:00-11:15 SEB 1242 Lecture 22 121115 http://www.ee.unlv.edu/~b1morris/ee292/ 2 Outline Review Binary Number Representation Binary Arithmetic Combinatorial Logic
More informationA Level Computing. Contents. For the Exam:
A Level Computing Contents For the Exam:... 1 Revision of Binary... 2 Computing Mathematics Revision... 2 Binary Addition/Subtraction revision... 3 BCD... 3 Sign and Magnitude... 4 2 s Compliment... 4
More informationChapter 4. Operations on Data
Chapter 4 Operations on Data 1 OBJECTIVES After reading this chapter, the reader should be able to: List the three categories of operations performed on data. Perform unary and binary logic operations
More information2. MACHINE REPRESENTATION OF TYPICAL ARITHMETIC DATA FORMATS (NATURAL AND INTEGER NUMBERS).
2. MACHINE REPRESENTATION OF TYPICAL ARITHMETIC DATA FORMATS (NATURAL AND INTEGER NUMBERS). 2.. Natural Binary Code (NBC). The positional code with base 2 (B=2), introduced in Exercise, is used to encode
More information4 Operations On Data 4.1. Foundations of Computer Science Cengage Learning
4 Operations On Data 4.1 Foundations of Computer Science Cengage Learning Objectives After studying this chapter, the student should be able to: List the three categories of operations performed on data.
More informationCombinational Circuits
Combinational Circuits Combinational circuit consists of an interconnection of logic gates They react to their inputs and produce their outputs by transforming binary information n input binary variables
More informationSummary. Boolean Addition
Summary Boolean Addition In Boolean algebra, a variable is a symbol used to represent an action, a condition, or data. A single variable can only have a value of or 0. The complement represents the inverse
More informationFundamentals of Programming
Fundamentals of Programming Lecture 2 Number Systems & Arithmetic Lecturer : Ebrahim Jahandar Some Parts borrowed from slides by IETC1011-Yourk University Common Number Systems System Base Symbols Used
More informationOCR H446 A-Level Computer Science
Name: Class Teacher: Date: OCR H446 A-Level Computer Science REVISION BOOKLET 1.4 DATA TYPES, DATA STRUCTURES AND ALGORITHMS Content in H446 A-Level Computer Science: 1.1 The characteristics of contemporary
More informationCOSC 243. Data Representation 3. Lecture 3 - Data Representation 3 1. COSC 243 (Computer Architecture)
COSC 243 Data Representation 3 Lecture 3 - Data Representation 3 1 Data Representation Test Material Lectures 1, 2, and 3 Tutorials 1b, 2a, and 2b During Tutorial a Next Week 12 th and 13 th March If you
More informationIn this lesson you will learn: how to add and multiply positive binary integers how to work with signed binary numbers using two s complement how fixed and floating point numbers are used to represent
More informationR07
www..com www..com SET - 1 II B. Tech I Semester Supplementary Examinations May 2013 SWITCHING THEORY AND LOGIC DESIGN (Com. to EEE, EIE, BME, ECC) Time: 3 hours Max. Marks: 80 Answer any FIVE Questions
More informationOperations On Data CHAPTER 4. (Solutions to Odd-Numbered Problems) Review Questions
CHAPTER 4 Operations On Data (Solutions to Odd-Numbered Problems) Review Questions 1. Arithmetic operations interpret bit patterns as numbers. Logical operations interpret each bit as a logical values
More informationLogic Design: Part 2
Orange Coast College Business Division Computer Science Department CS 6- Computer Architecture Logic Design: Part 2 Where are we? Number systems Decimal Binary (and related Octal and Hexadecimal) Binary
More information(a) What is the denary equivalent of the hexadecimal number A7?
1 What is the denary equivalent of the hexadecimal number A7? You may use the space below for rough working. You may get some marks for your working, even if your answer is incorrect. Represent the denary
More informationExperimental Methods I
Experimental Methods I Computing: Data types and binary representation M.P. Vaughan Learning objectives Understanding data types for digital computers binary representation of different data types: Integers
More informationRead this before starting!
Points missed: Student's Name: Total score: /100 points East Tennessee State University Department of Computer and Information Sciences CSCI 2150 (Tarnoff) Computer Organization TEST 1 for Spring Semester,
More informationLSN 4 Boolean Algebra & Logic Simplification. ECT 224 Digital Computer Fundamentals. Department of Engineering Technology
LSN 4 Boolean Algebra & Logic Simplification Department of Engineering Technology LSN 4 Key Terms Variable: a symbol used to represent a logic quantity Compliment: the inverse of a variable Literal: a
More informationSection 001. Read this before starting!
Points missed: Student's Name: Total score: / points East Tennessee State University Department of Computer and Information Sciences CSCI 25 (Tarnoff) Computer Organization TEST 2 for Fall Semester, 25
More informationSigned umbers. Sign/Magnitude otation
Signed umbers So far we have discussed unsigned number representations. In particular, we have looked at the binary number system and shorthand methods in representing binary codes. With m binary digits,
More information1996 ILLINOIS JETS TEAMS DISTRICT COMPUTER FUNDAMENTALS TEST. 1. A computer program is:
1996 ILLINOIS JETS TEAMS DISTRICT COMPUTER FUNDAMENTALS TEST 1. A computer program is: a. a sequence of binary machine instructions b. a sequence of operations to carry out a defined task c. a set of computer
More informationBasic operators, Arithmetic, Relational, Bitwise, Logical, Assignment, Conditional operators. JAVA Standard Edition
Basic operators, Arithmetic, Relational, Bitwise, Logical, Assignment, Conditional operators JAVA Standard Edition Java - Basic Operators Java provides a rich set of operators to manipulate variables.
More informationDLD VIDYA SAGAR P. potharajuvidyasagar.wordpress.com. Vignana Bharathi Institute of Technology UNIT 3 DLD P VIDYA SAGAR
DLD UNIT III Combinational Circuits (CC), Analysis procedure, Design Procedure, Combinational circuit for different code converters and other problems, Binary Adder- Subtractor, Decimal Adder, Binary Multiplier,
More informationChapter 4: The Building Blocks: Binary Numbers, Boolean Logic, and Gates. Invitation to Computer Science, C++ Version, Third Edition
Chapter 4: The Building Blocks: Binary Numbers, Boolean Logic, and Gates Invitation to Computer Science, C++ Version, Third Edition Objectives In this chapter, you will learn about: The binary numbering
More informationSolving Linear Equations and Inequalities: Linear Inequalities in One Variable
Connexions module: m1979 1 Solving Linear Equations and Inequalities: Linear Inequalities in One Variable Wade Ellis Denny Burzynski This work is produced by The Connexions Project and licensed under the
More informationSimplification of Boolean Functions
COM111 Introduction to Computer Engineering (Fall 2006-2007) NOTES 5 -- page 1 of 5 Introduction Simplification of Boolean Functions You already know one method for simplifying Boolean expressions: Boolean
More informationthat system. weighted value associated with it. numbers. a number. the absence of a signal. MECH 1500 Quiz 2 Review Name: Class: Date:
Name: Class: Date: MECH 1500 Quiz 2 Review True/False Indicate whether the statement is true or false. 1. The decimal system uses the number 9 as its base. 2. All digital computing devices perform operations
More informationCHAPTER V NUMBER SYSTEMS AND ARITHMETIC
CHAPTER V-1 CHAPTER V CHAPTER V NUMBER SYSTEMS AND ARITHMETIC CHAPTER V-2 NUMBER SYSTEMS RADIX-R REPRESENTATION Decimal number expansion 73625 10 = ( 7 10 4 ) + ( 3 10 3 ) + ( 6 10 2 ) + ( 2 10 1 ) +(
More informationDraw a diagram of an empty circular queue and describe it to the reader.
1020_1030_testquestions.text Wed Sep 10 10:40:46 2014 1 1983/84 COSC1020/30 Tests >>> The following was given to students. >>> Students can have a good idea of test questions by examining and trying the
More informationISC 2011 COMPUTER SCIENCE PAPER 1 THEORY
ISC 2011 COMPUTER SCIENCE PAPER 1 THEORY Question 1. a) State the two absorption laws. Verify any one of them using truth table. b) Reduce the following expression : F(A,B,C)= (0,1,2,3,4,5,6,7) Also find
More informationChapter 3. Errors and numerical stability
Chapter 3 Errors and numerical stability 1 Representation of numbers Binary system : micro-transistor in state off 0 on 1 Smallest amount of stored data bit Object in memory chain of 1 and 0 10011000110101001111010010100010
More informationCE161-4-AU UNIVERSITY OF ESSEX. Undergraduate Examinations 2014 DIGITAL SYSTEMS ARCHITECTURE. Time allowed: TWO hours
CE161-4-AU UNIVERSITY OF ESSEX Undergraduate Examinations 2014 DIGITAL SYSTEMS ARCHITECTURE Time allowed: TWO hours The following items are provided: Graph paper (available on invigilator s desk) Candidates
More informationCambridge International Examinations Cambridge International Advanced Subsidiary and Advanced Level
Cambridge International Examinations Cambridge International Advanced Subsidiary and Advanced Level *7825200973* COMPUTER SCIENCE 9608/32 Paper 3 Advanced Theory October/November 2018 1 hour 30 minutes
More informationRead this before starting!
Points missed: Student's Name: Total score: /100 points East Tennessee State University Department of Computer and Information Sciences CSCI 2150 (Tarnoff) Computer Organization TEST 1 for Spring Semester,
More informationExperiment 4 Boolean Functions Implementation
Experiment 4 Boolean Functions Implementation Introduction: Generally you will find that the basic logic functions AND, OR, NAND, NOR, and NOT are not sufficient to implement complex digital logic functions.
More informationRead this before starting!
Points missed: Student's Name: Total score: /100 points East Tennessee State University Department of Computer and Information Sciences CSCI 2150 (Tarnoff) Computer Organization TEST 1 for Spring Semester,
More informationQUESTION BANK FOR TEST
CSCI 2121 Computer Organization and Assembly Language PRACTICE QUESTION BANK FOR TEST 1 Note: This represents a sample set. Please study all the topics from the lecture notes. Question 1. Multiple Choice
More informationCMPSCI 145 MIDTERM #2 SOLUTION KEY SPRING 2016 March 30, 2016 Professor William T. Verts
CMPSCI 145 MIDTERM #2 SOLUTION KEY SPRING 2016 March 30, 2016 Items in red are students expected answers or instructions on scoring to the grader. Items in light blue are my annotations or explanations,
More information5. The result of dividing the 8 bit value by the 8 bit value is:
1. The first generation of electronic computers in the 1950's used memory technology based on a. large scale integrated circuits b. medium scale integrated circuits c. transistors d. vacuum tubes e. toroidal
More informationNumber Systems. Both numbers are positive
Number Systems Range of Numbers and Overflow When arithmetic operation such as Addition, Subtraction, Multiplication and Division are performed on numbers the results generated may exceed the range of
More informationLecture 3: Binary Subtraction, Switching Algebra, Gates, and Algebraic Expressions
EE210: Switching Systems Lecture 3: Binary Subtraction, Switching Algebra, Gates, and Algebraic Expressions Prof. YingLi Tian Feb. 5/7, 2019 Department of Electrical Engineering The City College of New
More informationCHW 261: Logic Design
CHW 261: Logic Design Instructors: Prof. Hala Zayed Dr. Ahmed Shalaby http://www.bu.edu.eg/staff/halazayed14 http://bu.edu.eg/staff/ahmedshalaby14# Slide 1 Slide 2 Slide 3 Digital Fundamentals CHAPTER
More informationNumber Systems. TA: Mamun. References: Lecture notes of Introduction to Information Technologies (ITEC 1011) by Dr Scott MacKenzie
Number Systems TA: Mamun References: Lecture notes of Introduction to Information Technologies (ITEC 1011) by Dr Scott MacKenzie Common Number Systems System Base Symbols Decimal 10 0, 1, 9 Binary 2 0,
More informationWYSE Academic Challenge Computer Fundamentals Test (State Finals)
WYSE Academic Challenge Computer Fundamentals Test (State Finals) - 1998 1. What is the decimal value for the result of the addition of the binary values: 1111 + 0101? (Assume a 4 bit, 2's complement representation.)
More informationIntroduction to Computers and Programming. Numeric Values
Introduction to Computers and Programming Prof. I. K. Lundqvist Lecture 5 Reading: B pp. 47-71 Sept 1 003 Numeric Values Storing the value of 5 10 using ASCII: 00110010 00110101 Binary notation: 00000000
More informationFinite Math - J-term Homework. Section Inverse of a Square Matrix
Section.5-77, 78, 79, 80 Finite Math - J-term 017 Lecture Notes - 1/19/017 Homework Section.6-9, 1, 1, 15, 17, 18, 1, 6, 9, 3, 37, 39, 1,, 5, 6, 55 Section 5.1-9, 11, 1, 13, 1, 17, 9, 30 Section.5 - Inverse
More informationB.Sc.-IT (Part I) EXAMINATION, 2010 Computing Logics And Reasoning
1 B.Sc.-IT (Part I) EXAMINATION, 2010 Computing Logics And Reasoning Time allowed : Three Hours Maximum Marks : 50 Answer all ten questions (20 words each). Each question carries equal marks. Answer all
More informationCDA 3200 Digital Systems. Instructor: Dr. Janusz Zalewski Developed by: Dr. Dahai Guo Spring 2012
CDA 3200 Digital Systems Instructor: Dr. Janusz Zalewski Developed by: Dr. Dahai Guo Spring 2012 Outline Data Representation Binary Codes Why 6-3-1-1 and Excess-3? Basic Operations of Boolean Algebra Examples
More informationBirkbeck (University of London) Department of Computer Science and Information Systems. Introduction to Computer Systems (BUCI008H4)
Birkbeck (University of London) Department of Computer Science and Information Systems Introduction to Computer Systems (BUCI008H4) CREDIT VALUE: none Spring 2017 Mock Examination SUMMARY ANSWERS Date:
More informationLOGIC DESIGN. Dr. Mahmoud Abo_elfetouh
LOGIC DESIGN Dr. Mahmoud Abo_elfetouh Course objectives This course provides you with a basic understanding of what digital devices are, how they operate, and how they can be designed to perform useful
More informationKENDRIYA VIDYALAYA SANGATHAN, HYDERABAD REGION
KENDRIYA VIDYALAYA SANGATHAN, HYDERABAD REGION SAMPLE PAPER 06 (017-18) SUBJECT: MATHEMATICS(041) BLUE PRINT : CLASS X Unit Chapter VSA (1 mark) SA I ( marks) SA II (3 marks) LA (4 marks) Total Unit Total
More informationCode No: R Set No. 1
Code No: R059210504 Set No. 1 II B.Tech I Semester Regular Examinations, November 2006 DIGITAL LOGIC DESIGN ( Common to Computer Science & Engineering, Information Technology and Computer Science & Systems
More informationPrentice Hall Algebra Correlated to: ACT College Readiness Standards for Mathematics
Score Range 1 12 Students who score in the 1 12 range are most likely beginning to develop the knowledge and skills assessed in the other score ranges. Score Range 13-15 Perform one-operation computation
More informationPhiladelphia University Student Name: Student Number:
Philadelphia University Student Name: Student Number: Faculty of Engineering Serial Number: Final Exam, First Semester: 2018/2019 Dept. of Computer Engineering Course Title: Logic Circuits Date: 03/01/2019
More informationMath Circle Intermediate Group October 30, 2016 Geometric Probability
Math Circle Intermediate Group October 30, 2016 Geometric Probability Warm up problems 1. Show that A \ (B [ C) =(A \ B) [ (A \ C) using Venn diagrams. 2. Show that A [ (B \ C) =(A [ B) \ (A [ C) using
More informationNumber Systems CHAPTER Positional Number Systems
CHAPTER 2 Number Systems Inside computers, information is encoded as patterns of bits because it is easy to construct electronic circuits that exhibit the two alternative states, 0 and 1. The meaning of
More informationSIR C.R.REDDY COLLEGE OF ENGINEERING, ELURU DEPARTMENT OF INFORMATION TECHNOLOGY LESSON PLAN
SIR C.R.REDDY COLLEGE OF ENGINEERING, ELURU DEPARTMENT OF INFORMATION TECHNOLOGY LESSON PLAN SUBJECT: CSE 2.1.6 DIGITAL LOGIC DESIGN CLASS: 2/4 B.Tech., I SEMESTER, A.Y.2017-18 INSTRUCTOR: Sri A.M.K.KANNA
More information1. Which of the following Boolean operations produces the output 1 for the fewest number of input patterns?
This is full of Test bank for Computer Science An Overview 12th Edition by Brookshear SM https://getbooksolutions.com/download/computer-science-an-overview-12th-editionby-brookshear-sm Test Bank Chapter
More informationCO Computer Architecture and Programming Languages CAPL. Lecture 9
CO20-320241 Computer Architecture and Programming Languages CAPL Lecture 9 Dr. Kinga Lipskoch Fall 2017 A Four-bit Number Circle CAPL Fall 2017 2 / 38 Functional Parts of an ALU CAPL Fall 2017 3 / 38 Addition
More informationEECS 140/141 Introduction to Digital Logic Design Spring Semester 2017 Exam #1 Date: 27 February 2017
EECS 4/4 Introduction to Digital Logic Design Spring Semester 27 Exam # Date: 27 February 27 NAME: KUID: General Instructions. This exam is closed-book. You are allowed a non-communicating calculator and
More informationDigital Fundamentals
Digital Fundamentals Tenth Edition Floyd Chapter 2 2009 Pearson Education, Upper 2008 Pearson Saddle River, Education NJ 07458. All Rights Reserved Decimal Numbers The position of each digit in a weighted
More informationDepartment of Electrical and Computer Engineering University of Wisconsin - Madison. ECE/CS 352 Digital System Fundamentals.
Last (family) name: First (given) name: Student I.D. #: Circle section: Lipasti Kim Department of Electrical and Computer Engineering University of isconsin - Madison ECE/CS 352 Digital System Fundamentals
More information2.6 BOOLEAN FUNCTIONS
2.6 BOOLEAN FUNCTIONS Binary variables have two values, either 0 or 1. A Boolean function is an expression formed with binary variables, the two binary operators AND and OR, one unary operator NOT, parentheses
More informationCS1800 Discrete Structures Final Version A
CS1800 Discrete Structures Fall 2017 Profs. Aslam, Gold, & Pavlu December 11, 2017 CS1800 Discrete Structures Final Version A Instructions: 1. The exam is closed book and closed notes. You may not use
More informationUNCA CSCI 255 Exam 1 Spring February, This is a closed book and closed notes exam. It is to be turned in by 1:45 PM.
UNCA CSCI 255 Exam 1 Spring 2017 27 February, 2017 This is a closed book and closed notes exam. It is to be turned in by 1:45 PM. Communication with anyone other than the instructor is not allowed during
More informationBinary Adders: Half Adders and Full Adders
Binary Adders: Half Adders and Full Adders In this set of slides, we present the two basic types of adders: 1. Half adders, and 2. Full adders. Each type of adder functions to add two binary bits. In order
More informationMath 7 Glossary Terms
Math 7 Glossary Terms Absolute Value Absolute value is the distance, or number of units, a number is from zero. Distance is always a positive value; therefore, absolute value is always a positive value.
More informationCDS130 Mid-term exam: Sample
CDS130 : Sample Be sure your exam booklet has 6 pages. Write your name at the top of the front page. This is a closed book exam. You may not use a calculator. You may not use MATLAB during exam except
More informationComputer Organization
Register Transfer Logic Department of Computer Science Missouri University of Science & Technology hurson@mst.edu 1 Note, this unit will be covered in three lectures. In case you finish it earlier, then
More informationDate Performed: Marks Obtained: /10. Group Members (ID):. Experiment # 04. Boolean Expression Simplification and Implementation
Name: Instructor: Engr. Date Performed: Marks Obtained: /10 Group Members (ID):. Checked By: Date: Experiment # 04 Boolean Expression Simplification and Implementation OBJECTIVES: To understand the utilization
More informationRead this before starting!
Points missed: Student's Name: Total score: /1 points East Tennessee State University Department of Computer and Information Sciences CSCI 215 (Tarnoff) Computer Organization Section 1 TEST 1 for Fall
More informationSpecifying logic functions
CSE4: Components and Design Techniques for Digital Systems Specifying logic functions Instructor: Mohsen Imani Slides from: Prof.Tajana Simunic and Dr.Pietro Mercati We have seen various concepts: Last
More informationIntroduction to Computer Architecture
Boolean Operators The Boolean operators AND and OR are binary infix operators (that is, they take two arguments, and the operator appears between them.) A AND B D OR E We will form Boolean Functions of
More informationSCHOOL OF ENGINEERING & BUILT ENVIRONMENT. Mathematics. Numbers & Number Systems
SCHOOL OF ENGINEERING & BUILT ENVIRONMENT Mathematics Numbers & Number Systems Introduction Numbers and Their Properties Multiples and Factors The Division Algorithm Prime and Composite Numbers Prime Factors
More informationENEL 353: Digital Circuits Midterm Examination
NAME: SECTION: L01: Norm Bartley, ST 143 L02: Steve Norman, ST 145 When you start the test, please repeat your name and section, and add your U of C ID number at the bottom of the last page. Instructions:
More informationDigital Fundamentals
Digital Fundamentals Tenth Edition Floyd Chapter 2 2009 Pearson Education, Upper 2008 Pearson Saddle River, Education NJ 07458. All Rights Reserved Quiz 2 Agenda Lecture: Chapter 2 (2-7 through 2-11):
More information