Outline. policies for the first part. with some potential answers... MCS 260 Lecture 10.0 Introduction to Computer Science Jan Verschelde, 9 July 2014
|
|
|
- Chrystal Armstrong
- 6 years ago
- Views:
Transcription
1 Outline 1 midterm exam on Friday 11 July 2014 policies for the first part 2 questions with some potential answers... MCS 260 Lecture 10.0 Introduction to Computer Science Jan Verschelde, 9 July 2014 Intro to Computer Science (MCS 260) review for the midterm, part 1 L July / 39
2 review of the first 9 lectures 1 midterm exam on Friday 11 July 2014 policies for the first part 2 questions with some potential answers... Intro to Computer Science (MCS 260) review for the midterm, part 1 L July / 39
3 policies The first part of the exam will be closed book, no notes, and no computer. The material breaks down in two parts: 1 computer science concepts: algorithms, computer architecture, functionality of operating systems, mass storage, formal languages, flowcharts and pseudocode, logic gates, transistors and flip flops, adder circuits, functional programming. 2 mathematical CS: binary and hexadecimal representations of numbers, precision and accuracy, boolean algebra, truth tables, simulation and Monte Carlo, histograms. This review contains some preliminary examples of questions which may help you prepare for the first part of the midterm exam. Intro to Computer Science (MCS 260) review for the midterm, part 1 L July / 39
4 review of the first 9 lectures 1 midterm exam on Friday 11 July 2014 policies for the first part 2 questions with some potential answers... Intro to Computer Science (MCS 260) review for the midterm, part 1 L July / 39
5 question 1 List the characteristics of an algorithm. Intro to Computer Science (MCS 260) review for the midterm, part 1 L July / 39
6 answer to question 1 The question: List the characteristics of an algorithm. A potential answer: There are four characteristics: 1 ordered: steps in the execution come after each other; 2 unambiguous: the steps must be executable and clear; 3 correctness: must meet its specification, its intended goals; 4 terminating: must stop after a finite number of steps. Intro to Computer Science (MCS 260) review for the midterm, part 1 L July / 39
7 question 2 How many bytes are 15 terabytes? Intro to Computer Science (MCS 260) review for the midterm, part 1 L July / 39
8 answer to question 2 The question: How many bytes are 15 terabytes? A potential answer: tera = So 15 terabytes are bytes, or approximately 15 trillion bytes. Intro to Computer Science (MCS 260) review for the midterm, part 1 L July / 39
9 question 3 Explain the difference between 34/87 and 34.0/87. Intro to Computer Science (MCS 260) review for the midterm, part 1 L July / 39
10 answer to question 3 The question: Explain the difference between 34/87 and 34.0/87. A potential answer: 34/87 represents the division of the integer 34 by the integer 87. The result of this integer division is zero. 34.0/87 represents the division of the float 34.0 by the integer 87. The result of this float division is a floating-point number which represents the rational number 34/87 up to machine precision. Intro to Computer Science (MCS 260) review for the midterm, part 1 L July / 39
11 question 4 What is an interrupt? Intro to Computer Science (MCS 260) review for the midterm, part 1 L July / 39
12 answer to question 4 The question: What is an interrupt? A potential answer: An interrupt causes an executing process to go in waiting (e.g.: wait for input from a device) or ready state (e.g.: because the CPU is busy on another process). Intro to Computer Science (MCS 260) review for the midterm, part 1 L July / 39
13 question 5 Describe the differences between a compiler and an interpreter. What are the advantages/disadvantages of using a compiler and an interpreter? Intro to Computer Science (MCS 260) review for the midterm, part 1 L July / 39
14 answer to question 5, part one The first part of the question: Describe the differences between a compiler and an interpreter. A potential answer: A compiler translates an entire program into executable format. The program is not executed. An interpreter translates statements in a program one after the other and executes each statement as soon as its translation is done. Intro to Computer Science (MCS 260) review for the midterm, part 1 L July / 39
15 answer to question 5, part two The second part of the question: What are the advantages/disadvantages of using a compiler and an interpreter? A potential (very short) answer: Compiled code executes faster than interpreted code. Code can be developed faster with an interpreter than with a compiler. Intro to Computer Science (MCS 260) review for the midterm, part 1 L July / 39
16 question 6 Convert 318 into hexadecimal notation. Intro to Computer Science (MCS 260) review for the midterm, part 1 L July / 39
17 answer to question 6 The question: Convert 318 into hexadecimal notation. A potential answer: n n/16 n mod = = = Collecting the remainders gives 1, 3, 14 (or E). So the decimal 318 equals 13E in hexadecimal. An alternative method is to convert to binary and group the bits in sequences of four. Intro to Computer Science (MCS 260) review for the midterm, part 1 L July / 39
18 question 7 Rank all memory elements we have seen twice: 1 use once its speed (memory that is fastest to access comes first); and 2 use once its capacity (memory that is largest in size comes first). Intro to Computer Science (MCS 260) review for the midterm, part 1 L July / 39
19 answer to question 7 The question: Rank all memory elements we have seen twice: 1 use once its speed (memory that is fastest to access comes first); and 2 use once its capacity (memory that is largest in size comes first). A potential answer: 1 registers, cache, internal memory, disk, tape; 2 tape, disk, internal memory, cache, registers. Intro to Computer Science (MCS 260) review for the midterm, part 1 L July / 39
20 question 8 What is the kernel of an operating system? Intro to Computer Science (MCS 260) review for the midterm, part 1 L July / 39
21 answer to question 8 The question: What is the kernel of an operating system? A potential answer: The kernel of an operating system 1 controls the execution of programs; 2 allocates and frees internal memory; 3 manages the peripherals (i/o devices). Intro to Computer Science (MCS 260) review for the midterm, part 1 L July / 39
22 question 9 Consider the circuit shown below. For b 1 = 1 and b 2 = 0 as input, indicate on the picture below the input and output for every logical gate. b 1 S C b 2 Intro to Computer Science (MCS 260) review for the midterm, part 1 L July / 39
23 answer to question 9 Consider the circuit shown below. For b 1 = 1 and b 2 = 0 as input, indicate on the picture below the input and output for every logical gate. The answer: b S C b 2 Intro to Computer Science (MCS 260) review for the midterm, part 1 L July / 39
24 question 10 Draw the flowchart for the algorithm to search for the maximum in a list of unsorted numbers. Write pseudo code for this algorithm as well. Intro to Computer Science (MCS 260) review for the midterm, part 1 L July / 39
25 answer to question 10: the flowchart The question: Draw the flowchart for the algorithm to search for the maximum in a list of unsorted numbers. A potential answer: n = len(l); m = L[0]; i = 1 i < n? True m = L[i] False True L[i] > m? False i = i + 1 print m Intro to Computer Science (MCS 260) review for the midterm, part 1 L July / 39
26 answer to question 10: the pseudocode The question: Draw the flowchart for the algorithm to search for the maximum in a list of unsorted numbers. Write pseudo code for this algorithm as well. A potential answer: Input: L, a list of unsorted numbers. Output: m, the maximum of the elements in L. let m be L[0] for i from 1 to the length of L do if L[i] > m then let m be L[i] Intro to Computer Science (MCS 260) review for the midterm, part 1 L July / 39
27 question 11 An exclusive or, denoted as XOR returns False only when the inputs are both the same, and True otherwise. 1 Give the truth table for the exclusive or. 2 Show how the XOR can be realized with NOT, OR, and AND by giving the logical expressions and their corresponding truth tables. 3 Draw the circuit for the XOR, using the symbols for the gates NOT, OR, and AND. Intro to Computer Science (MCS 260) review for the midterm, part 1 L July / 39
28 answer to question 11, item 1 The question: An exclusive or, denoted as XOR returns False only when the inputs are both the same, and True otherwise. 1 Give the truth table for the exclusive or. The answer: x y x XOR y Intro to Computer Science (MCS 260) review for the midterm, part 1 L July / 39
29 answer to question 11, item 2 The question: An exclusive or, denoted as XOR returns False only when the inputs are both the same, and True otherwise. 2 Show how the XOR can be realized with NOT, OR, and AND by giving the logical expressions and their corresponding truth tables. The answer: x y x OR y x AND y NOT (x AND y) b where b = ( x OR y ) AND ( NOT ( x AND y ) ) Intro to Computer Science (MCS 260) review for the midterm, part 1 L July / 39
30 answer to question 11, item 3 The question: An exclusive or, denoted as XOR returns False only when the inputs are both the same, and True otherwise. 3 Draw the circuit for the XOR, using the symbols for the gates NOT, OR, and AND. The answer: x y Intro to Computer Science (MCS 260) review for the midterm, part 1 L July / 39
31 question 12 Use truth tables to verify that ((NOT A) AND B AND C) OR (A AND (NOT B) AND C) OR (A AND B AND (NOT C)) OR (A AND B AND C) is equivalent to (A AND B) OR (B AND C) OR (A AND C). Draw a realization of the second expression using the diagrams for the logic gates. Intro to Computer Science (MCS 260) review for the midterm, part 1 L July / 39
32 answer to question 12: first truth table Give the truth table of ((NOT A) AND B AND C) OR (A AND (NOT B) AND C) OR (A AND B AND (NOT C)) OR (A AND B AND C) Let D = NOT A, E = NOT B, F = NOT C, G = D AND B AND C, H = A AND E AND C, I = A AND B AND F, J = A AND B AND C, K = G OR H OR I OR J. A B C D E F G H I J K Intro to Computer Science (MCS 260) review for the midterm, part 1 L July / 39
33 answer to question 12: second truth table Give the truth table of (A AND B) OR (B AND C) OR (A AND C). Let D = A AND B, E = B AND C, F = A AND C, G = D OR E OR F. A B C D E F G Intro to Computer Science (MCS 260) review for the midterm, part 1 L July / 39
34 answer to question 12: the realization Draw the realization of (A AND B) OR (B AND C) OR (A AND C). using the diagrams for the logic gates. The answer: A B C Intro to Computer Science (MCS 260) review for the midterm, part 1 L July / 39
35 question 13 Consider the flowchart, that takes on input the word w: n = len(w) n > 0? False stop True n = n 1 print w[n] 1 Explain what the algorithm defined by the flowchart does, that is: write pseudo code. 2 Redraw the flowchart that swaps the test with the body of the loop. Intro to Computer Science (MCS 260) review for the midterm, part 1 L July / 39
36 answer to question 13: the pseudocode The question: Explain what the algorithm defined by the flowchart does, that is: write pseudocode. A potential answer: The algorithm writes a word backwards. Pseudocode: Input: w, a sequence of n characters. Output: the sequence w written backwards. for i from n-1 to 0 do print w[i] Intro to Computer Science (MCS 260) review for the midterm, part 1 L July / 39
37 answer to question 13: redraw the flowchart Redraw the flowchart that swaps the test with the body of the loop. n = len(w) n = n 1 print w[n] n == 0? True stop False Intro to Computer Science (MCS 260) review for the midterm, part 1 L July / 39
38 question 14 Describe the top down functional design for a program that takes orders in a fastfood restaurant. The program should display a menu, prompt the customer to make a selection, calculate the price of the order, and then finally ask the customer to confirm the order. Draw a hierarchy of the functions and for every function write a least one line for documentation string. Intro to Computer Science (MCS 260) review for the midterm, part 1 L July / 39
39 potential answer to question 14 main menu price confirm Short description for each function: main: calls menu, price, and confirm (in that order). menu: displays the menu, prompts for a choice, returns the choice to the main function. price: given the choice, calculates the price, returns the price to the main function. confirm: given the choice and the price, prints a confirmation. Prompts the user to confirm (or cancel) the order. Intro to Computer Science (MCS 260) review for the midterm, part 1 L July / 39
XI STANDARD [ COMPUTER SCIENCE ] 5 MARKS STUDY MATERIAL.
![XI STANDARD [ COMPUTER SCIENCE ] 5 MARKS STUDY MATERIAL.](/thumbs/81/84726747.jpg "XI STANDARD [ COMPUTER SCIENCE ] 5 MARKS STUDY MATERIAL.")
2017-18 XI STANDARD [ COMPUTER SCIENCE ] 5 MARKS STUDY MATERIAL HALF ADDER 1. The circuit that performs addition within the Arithmetic and Logic Unit of the CPU are called adders. 2. A unit that adds two
Fundamentals of Digital Design
Fundamentals of Digital Design Digital Radiation Measurement and Spectroscopy NE/RHP 537 1 Binary Number System The binary numeral system, or base-2 number system, is a numeral system that represents numeric
UNIVERSITY OF WISCONSIN MADISON
CS/ECE 252: INTRODUCTION TO COMPUTER ENGINEERING UNIVERSITY OF WISCONSIN MADISON Prof. Gurindar Sohi TAs: Minsub Shin, Lisa Ossian, Sujith Surendran Midterm Examination 2 In Class (50 minutes) Friday,
CMSC 313 Lecture 16 Announcement: no office hours today. Good-bye Assembly Language Programming Overview of second half on Digital Logic DigSim Demo
CMSC 33 Lecture 6 nnouncement: no office hours today. Good-bye ssembly Language Programming Overview of second half on Digital Logic DigSim Demo UMC, CMSC33, Richard Chang Good-bye ssembly
Philadelphia University Student Name: Student Number:
Philadelphia University Student Name: Student Number: Faculty of Engineering Serial Number: Final Exam, Second Semester: 2015/2016 Dept. of Computer Engineering Course Title: Logic Circuits Date: 08/06/2016
Digital Logic: Boolean Algebra and Gates. Textbook Chapter 3
Digital Logic: Boolean Algebra and Gates Textbook Chapter 3 Basic Logic Gates XOR CMPE12 Summer 2009 02-2 Truth Table The most basic representation of a logic function Lists the output for all possible
Outline. policies for the second part. with answers. MCS 260 Lecture 10.5 Introduction to Computer Science Jan Verschelde, 9 July 2014
Outline 1 midterm exam on Friday 11 July 2014 policies for the second part 2 some review questions with answers MCS 260 Lecture 10.5 Introduction to Computer Science Jan Verschelde, 9 July 2014 Intro to
Unit 8A Computer Organization. Boolean Logic and Gates
Unit 8A Computer Organization Boolean Logic and Gates Announcements Bring ear buds or headphones to lab! 15110 Principles of Computing, Carnegie Mellon University - CORTINA 2 Representing and Manipulating
Computer organization
Computer organization Levels of abstraction Assembler Simulator Applications C C++ Java High-level language SOFTWARE add lw ori Assembly language Goal 0000 0001 0000 1001 0101 Machine instructions/data
Cs302 Quiz for MID TERM Exam Solved
Question # 1 of 10 ( Start time: 01:30:33 PM ) Total Marks: 1 Caveman used a number system that has distinct shapes: 4 5 6 7 Question # 2 of 10 ( Start time: 01:31:25 PM ) Total Marks: 1 TTL based devices
Digital Systems Roberto Muscedere Images 2013 Pearson Education Inc. 1
Digital Systems Digital systems have such a prominent role in everyday life The digital age The technology around us is ubiquitous, that is we don t even notice it anymore Digital systems are used in:
CMSC 313 Lecture 15 Good-bye Assembly Language Programming Overview of second half on Digital Logic DigSim Demo
CMSC 33 Lecture 5 Good-bye ssembly Language Programming Overview of second half on Digital Logic DigSim Demo UMC, CMSC33, Richard Chang Good-bye ssembly Language What a pain! Understand
CSE 20 DISCRETE MATH. Fall
CSE 20 DISCRETE MATH Fall 2017 http://cseweb.ucsd.edu/classes/fa17/cse20-ab/ Today's learning goals Describe and use algorithms for integer operations based on their expansions Relate algorithms for integer
Adders, subtractors comparators, multipliers and other ALU elements
CSE4: Components and Design Techniques for Digital Systems Adders, subtractors comparators, multipliers and other ALU elements Adders 2 Circuit Delay Transistors have instrinsic resistance and capacitance
Binary addition example worked out
Binary addition example worked out Some terms are given here Exercise: what are these numbers equivalent to in decimal? The initial carry in is implicitly 0 1 1 1 0 (Carries) 1 0 1 1 (Augend) + 1 1 1 0
Adders, subtractors comparators, multipliers and other ALU elements
CSE4: Components and Design Techniques for Digital Systems Adders, subtractors comparators, multipliers and other ALU elements Instructor: Mohsen Imani UC San Diego Slides from: Prof.Tajana Simunic Rosing
Digital Electronics Final Examination. Part A
Digital Electronics Final Examination Part A Spring 2009 Student Name: Date: Class Period: Total Points: /50 Converted Score: /40 Page 1 of 13 Directions: This is a CLOSED BOOK/CLOSED NOTES exam. Select
SRC Language Conventions. Class 6: Intro to SRC Simulator Register Transfers and Logic Circuits. SRC Simulator Demo. cond_br.asm.
Fall 2006 S333: omputer rchitecture University of Virginia omputer Science Michele o SR Language onventions lass 6: Intro to SR Simulator Register Transfers and Logic ircuits hapter 2, ppendix.5 2 SR Simulator
ENGIN 112 Intro to Electrical and Computer Engineering
ENGIN 112 Intro to Electrical and Computer Engineering Lecture 2 Number Systems Russell Tessier KEB 309 G tessier@ecs.umass.edu Overview The design of computers It all starts with numbers Building circuits
Sample Marking Scheme
Page 1 of 10 School of Computer Science 60-265-01 Computer Architecture and Digital Design Fall 2008 Midterm Examination # 1 B Wednesday, November 5, 2008 Sample Marking Scheme Duration of examination:
UNIT 8A Computer Circuitry: Layers of Abstraction. Boolean Logic & Truth Tables
UNIT 8 Computer Circuitry: Layers of bstraction 1 oolean Logic & Truth Tables Computer circuitry works based on oolean logic: operations on true (1) and false (0) values. ( ND ) (Ruby: && ) 0 0 0 0 0 1
Philadelphia University Student Name: Student Number:
Philadelphia University Student Name: Student Number: Faculty of Engineering Serial Number: Final Exam, First Semester: 2017/2018 Dept. of Computer Engineering Course Title: Logic Circuits Date: 29/01/2018
Number System. Decimal to binary Binary to Decimal Binary to octal Binary to hexadecimal Hexadecimal to binary Octal to binary
Number System Decimal to binary Binary to Decimal Binary to octal Binary to hexadecimal Hexadecimal to binary Octal to binary BOOLEAN ALGEBRA BOOLEAN LOGIC OPERATIONS Logical AND Logical OR Logical COMPLEMENTATION
UNIVERSITI TENAGA NASIONAL. College of Information Technology
UNIVERSITI TENAGA NASIONAL College of Information Technology BACHELOR OF COMPUTER SCIENCE (HONS.) FINAL EXAMINATION SEMESTER 2 2012/2013 DIGITAL SYSTEMS DESIGN (CSNB163) January 2013 Time allowed: 3 hours
Memory Elements I. CS31 Pascal Van Hentenryck. CS031 Lecture 6 Page 1
Memory Elements I CS31 Pascal Van Hentenryck CS031 Lecture 6 Page 1 Memory Elements (I) Combinational devices are good for computing Boolean functions pocket calculator Computers also need to remember
Digital Logic (2) Boolean Algebra
Digital Logic (2) Boolean Algebra Boolean algebra is the mathematics of digital systems. It was developed in 1850 s by George Boole. We will use Boolean algebra to minimize logic expressions. Karnaugh
Hakim Weatherspoon CS 3410 Computer Science Cornell University
Hakim Weatherspoon CS 3410 Computer Science Cornell University The slides are the product of many rounds of teaching CS 3410 by Professors Weatherspoon, Bala, Bracy, and Sirer. memory inst 32 register
CMSC 313 Lecture 17. Focus Groups. Announcement: in-class lab Thu 10/30 Homework 3 Questions Circuits for Addition Midterm Exam returned
Focus Groups CMSC 33 Lecture 7 Need good sample of all types of CS students Mon /7 & Thu /2, 2:3p-2:p & 6:p-7:3p Announcement: in-class lab Thu /3 Homework 3 Questions Circuits for Addition Midterm Exam
CS/ECE 252: INTRODUCTION TO COMPUTER ENGINEERING COMPUTER SCIENCES DEPARTMENT UNIVERSITY OF WISCONSIN-MADISON
CS/ECE 252: INTRODUCTION TO COMPUTER ENGINEERING COMPUTER SCIENCES DEPARTMENT UNIVERSITY OF WISCONSIN-MADISON Prof. Mark D. Hill & Prof. Mikko Lipasti TAs Sanghamitra Roy, Eric Hill, Samuel Javner, Natalie
E&CE 223 Digital Circuits & Systems. Winter Lecture Transparencies (Introduction) M. Sachdev
E&CE 223 Digital Circuits & Systems Winter 2004 Lecture Transparencies (Introduction) M. Sachdev 1 of 38 Course Information: People Instructor M. Sachdev, CEIT 4015, ext. 3370, msachdev@uwaterloo.ca Lab
Exam for Physics 4051, October 31, 2008
Exam for Physics 45, October, 8 5 points - closed book - calculators allowed - show your work Problem : (6 Points) The 4 bit shift register circuit shown in Figure has been initialized to contain the following
ALU A functional unit
ALU A functional unit that performs arithmetic operations such as ADD, SUB, MPY logical operations such as AND, OR, XOR, NOT on given data types: 8-,16-,32-, or 64-bit values A n-1 A n-2... A 1 A 0 B n-1
A crash course in Digital Logic
crash course in Digital Logic Computer rchitecture 1DT016 distance Fall 2017 http://xyx.se/1dt016/index.php Per Foyer Mail: per.foyer@it.uu.se Per.Foyer@it.uu.se 2017 1 We start from here Gates Flip-flops
Digital Logic. CS211 Computer Architecture. l Topics. l Transistors (Design & Types) l Logic Gates. l Combinational Circuits.
CS211 Computer Architecture Digital Logic l Topics l Transistors (Design & Types) l Logic Gates l Combinational Circuits l K-Maps Figures & Tables borrowed from:! http://www.allaboutcircuits.com/vol_4/index.html!
Combinatorial Logic Design Multiplexers and ALUs CS 64: Computer Organization and Design Logic Lecture #13
Combinatorial Logic Design Multiplexers and ALUs CS 64: Computer Organization and Design Logic Lecture #13 Ziad Matni Dept. of Computer Science, UCSB Administrative Re: Midterm Exam #2 Graded! 5/22/18
Tribhuvan University Institute of Science and Technology 2067
11CSc. MTH. -2067 Tribhuvan University Institute of Science and Technology 2067 Bachelor Level/First Year/ Second Semester/ Science Full Marks: 80 Computer Science and Information Technology Pass Marks:
ww.padasalai.net
t w w ADHITHYA TRB- TET COACHING CENTRE KANCHIPURAM SUNDER MATRIC SCHOOL - 9786851468 TEST - 2 COMPUTER SCIENC PG - TRB DATE : 17. 03. 2019 t et t et t t t t UNIT 1 COMPUTER SYSTEM ARCHITECTURE t t t t
Computer Organization: Boolean Logic
Computer Organization: Boolean Logic Representing and Manipulating Data Last Unit How to represent data as a sequence of bits How to interpret bit representations Use of levels of abstraction in representing
Introduction to Digital Logic Missouri S&T University CPE 2210 Subtractors
Introduction to Digital Logic Missouri S&T University CPE 2210 Egemen K. Çetinkaya Egemen K. Çetinkaya Department of Electrical & Computer Engineering Missouri University of Science and Technology cetinkayae@mst.edu
Ch 7. Finite State Machines. VII - Finite State Machines Contemporary Logic Design 1
Ch 7. Finite State Machines VII - Finite State Machines Contemporary Logic esign 1 Finite State Machines Sequential circuits primitive sequential elements combinational logic Models for representing sequential
Looking at a two binary digit sum shows what we need to extend addition to multiple binary digits.
A Full Adder The half-adder is extremely useful until you want to add more that one binary digit quantities. The slow way to develop a two binary digit adders would be to make a truth table and reduce
of Digital Electronics
26 Digital Electronics 729 Digital Electronics 26.1 Analog and Digital Signals 26.3 Binary Number System 26.5 Decimal to Binary Conversion 26.7 Octal Number System 26.9 Binary-Coded Decimal Code (BCD Code)
INF2270 Spring Philipp Häfliger. Lecture 8: Superscalar CPUs, Course Summary/Repetition (1/2)
INF2270 Spring 2010 Philipp Häfliger Summary/Repetition (1/2) content From Scalar to Superscalar Lecture Summary and Brief Repetition Binary numbers Boolean Algebra Combinational Logic Circuits Encoder/Decoder
Lecture 10: Synchronous Sequential Circuits Design
Lecture 0: Synchronous Sequential Circuits Design. General Form Input Combinational Flip-flops Combinational Output Circuit Circuit Clock.. Moore type has outputs dependent only on the state, e.g. ripple
BOOLEAN ALGEBRA INTRODUCTION SUBSETS
BOOLEAN ALGEBRA M. Ragheb 1/294/2018 INTRODUCTION Modern algebra is centered around the concept of an algebraic system: A, consisting of a set of elements: ai, i=1, 2,, which are combined by a set of operations
CSE370: Introduction to Digital Design
CSE370: Introduction to Digital Design Course staff Gaetano Borriello, Brian DeRenzi, Firat Kiyak Course web www.cs.washington.edu/370/ Make sure to subscribe to class mailing list (cse370@cs) Course text
1. Write a program to calculate distance traveled by light
G. H. R a i s o n i C o l l e g e O f E n g i n e e r i n g D i g d o h H i l l s, H i n g n a R o a d, N a g p u r D e p a r t m e n t O f C o m p u t e r S c i e n c e & E n g g P r a c t i c a l M a
Philadelphia University Faculty of Engineering
Philadelphia University Faculty of Engineering Marking Scheme Exam Paper BSc CE Logic Circuits (630211) Final Exam First semester ate: 03/02/2019 Section 1 Weighting 40% of the module total Lecturer: Coordinator:
Lecture 13: Sequential Circuits, FSM
Lecture 13: Sequential Circuits, FSM Today s topics: Sequential circuits Finite state machines Reminder: midterm on Tue 2/28 will cover Chapters 1-3, App A, B if you understand all slides, assignments,
CSC9R6 Computer Design. Practical Digital Logic
CSC9R6 Computer Design Practical Digital Logic 1 References (for this part of CSC9R6) Hamacher et al: Computer Organization App A. In library Floyd: Digital Fundamentals Ch 1, 3-6, 8-10 web page: www.prenhall.com/floyd/
Review: Additional Boolean operations
Review: Additional Boolean operations Operation: NAND (NOT-AND) NOR (NOT-OR) XOR (exclusive OR) Expressions: (xy) = x + y (x + y) = x y x y = x y + xy Truth table: x y (xy) x y (x+y) x y x y 0 0 1 0 1
SAU1A FUNDAMENTALS OF DIGITAL COMPUTERS
SAU1A FUNDAMENTALS OF DIGITAL COMPUTERS Unit : I - V Unit : I Overview Fundamentals of Computers Characteristics of Computers Computer Language Operating Systems Generation of Computers 2 Definition of
Numbers and Arithmetic
Numbers and Arithmetic See: P&H Chapter 2.4 2.6, 3.2, C.5 C.6 Hakim Weatherspoon CS 3410, Spring 2013 Computer Science Cornell University Big Picture: Building a Processor memory inst register file alu
Lecture 4 Modeling, Analysis and Simulation in Logic Design. Dr. Yinong Chen
Lecture 4 Modeling, Analysis and Simulation in Logic Design Dr. Yinong Chen The Engineering Design Process Define Problem and requirement Research Define Alternative solutions CAD Modeling Analysis Simulation
Digital Techniques. Figure 1: Block diagram of digital computer. Processor or Arithmetic logic unit ALU. Control Unit. Storage or memory unit
Digital Techniques 1. Binary System The digital computer is the best example of a digital system. A main characteristic of digital system is its ability to manipulate discrete elements of information.
Self-reproducing programs. And Introduction to logic. COS 116, Spring 2012 Adam Finkelstein
Self-reproducing programs. And Introduction to logic. COS 6, Spring 22 Adam Finkelstein Midterm One week from today in class Mar 5 Covers lectures, labs, homework, readings to date Old midterms will be
From Greek philosophers to circuits: An introduction to boolean logic. COS 116, Spring 2011 Sanjeev Arora
From Greek philosophers to circuits: An introduction to boolean logic. COS 116, Spring 2011 Sanjeev Arora Midterm One week from today in class Mar 10 Covers lectures, labs, homework, readings to date You
Experiment 7: Magnitude comparators
Module: Logic Design Lab Name:... University no:.. Group no: Lab Partner Name: Experiment 7: Magnitude comparators Mr. Mohamed El-Saied Objective: Realization of -bit comparator using logic gates. Realization
Digital Logic Design. Midterm #2
EECS: igital Logic esign r. nthony. Johnson s7m2s_dild7.fm - igital Logic esign Midterm #2 Problems Points. 5 2. 4 3. 6 Total 5 Was the exam fair? yes no EECS: igital Logic esign r. nthony. Johnson s7m2s_dild7.fm
II/IV B.Tech. DEGREE EXAMINATIONS, NOV/DEC-2017
CSE/IT 213 (CR) Total No. of Questions :09] [Total No. of Pages : 03 II/IV B.Tech. DEGREE EXAMINATIONS, NOV/DEC-2017 First Semester CSE/IT BASIC ELECTRICAL AND ELECTRONICS ENGINEERING Time: Three Hours
Why digital? Overview. Number Systems. Binary to Decimal conversion
Why digital? Overview It has the following advantages over analog. It can be processed and transmitted efficiently and reliably. It can be stored and retrieved with greater accuracy. Noise level does not
Gates and Flip-Flops
Gates and Flip-Flops Chris Kervick (11355511) With Evan Sheridan and Tom Power December 2012 On a scale of 1 to 10, how likely is it that this question is using binary?...4? What s a 4? Abstract The operation
ECE/CS 250 Computer Architecture
ECE/CS 250 Computer Architecture Basics of Logic Design: Boolean Algebra, Logic Gates (Combinational Logic) Tyler Bletsch Duke University Slides are derived from work by Daniel J. Sorin (Duke), Alvy Lebeck
E40M. Binary Numbers. M. Horowitz, J. Plummer, R. Howe 1
E40M Binary Numbers M. Horowitz, J. Plummer, R. Howe 1 Reading Chapter 5 in the reader A&L 5.6 M. Horowitz, J. Plummer, R. Howe 2 Useless Box Lab Project #2 Adding a computer to the Useless Box alows us
Building a Computer Adder
Logic Gates are used to translate Boolean logic into circuits. In the abstract it is clear that we can build AND gates that perform the AND function and OR gates that perform the OR function and so on.
ENGIN 112 Intro to Electrical and Computer Engineering
ENGIN 112 Intro to Electrical and Computer Engineering Lecture 17 Encoders and Decoders Overview Binary decoders Converts an n-bit code to a single active output Can be developed using AND/OR gates Can
Midterm Examination # 1 Wednesday, February 25, Duration of examination: 75 minutes
Page 1 of 10 School of Computer Science 60-265-01 Computer Architecture and Digital Design Winter 2009 Semester Midterm Examination # 1 Wednesday, February 25, 2009 Student Name: First Name Family Name
CS1800 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
Boolean Algebra & Digital Logic
Boolean Algebra & Digital Logic Boolean algebra was developed by the Englishman George Boole, who published the basic principles in the 1854 treatise An Investigation of the Laws of Thought on Which to
S C F F F T T F T T S C B F F F F F T F T F F T T T F F T F T T T F T T T
EECS 270, Winter 2017, Lecture 1 Page 1 of 6 Use pencil! Say we live in the rather black and white world where things (variables) are either true (T) or false (F). So if S is Mark is going to the Store
Computer Science 324 Computer Architecture Mount Holyoke College Fall Topic Notes: Digital Logic
Computer Science 324 Computer Architecture Mount Holyoke College Fall 2007 Topic Notes: Digital Logic Our goal for the next few weeks is to paint a a reasonably complete picture of how we can go from transistor
Sample Test Paper - I
Scheme G Sample Test Paper - I Course Name : Computer Engineering Group Marks : 25 Hours: 1 Hrs. Q.1) Attempt any THREE: 09 Marks a) Define i) Propagation delay ii) Fan-in iii) Fan-out b) Convert the following:
ECE 250 / CPS 250 Computer Architecture. Basics of Logic Design Boolean Algebra, Logic Gates
ECE 250 / CPS 250 Computer Architecture Basics of Logic Design Boolean Algebra, Logic Gates Benjamin Lee Slides based on those from Andrew Hilton (Duke), Alvy Lebeck (Duke) Benjamin Lee (Duke), and Amir
University of Guelph School of Engineering ENG 2410 Digital Design Fall There are 7 questions, answer all questions.
Final Examination Instructor: Shawki M. Areibi Co-examiner: Medhat Moussa. Location: UOG Date: Wednesday, December 5th, 2007 Time: 8:30-10:30 AM Duration: 2 hours. Type: R Closed Book. Instructions: University
COMPUTER SCIENCE TRIPOS
CST.2016.2.1 COMPUTER SCIENCE TRIPOS Part IA Tuesday 31 May 2016 1.30 to 4.30 COMPUTER SCIENCE Paper 2 Answer one question from each of Sections A, B and C, and two questions from Section D. Submit the
COMPUTER SCIENCE TRIPOS
CST0.2017.2.1 COMPUTER SCIENCE TRIPOS Part IA Thursday 8 June 2017 1.30 to 4.30 COMPUTER SCIENCE Paper 2 Answer one question from each of Sections A, B and C, and two questions from Section D. Submit the
Combinational Logic. By : Ali Mustafa
Combinational Logic By : Ali Mustafa Contents Adder Subtractor Multiplier Comparator Decoder Encoder Multiplexer How to Analyze any combinational circuit like this? Analysis Procedure To obtain the output
Floating Point Representation and Digital Logic. Lecture 11 CS301
Floating Point Representation and Digital Logic Lecture 11 CS301 Administrative Daily Review of today s lecture w Due tomorrow (10/4) at 8am Lab #3 due Friday (9/7) 1:29pm HW #5 assigned w Due Monday 10/8
Simplify the following Boolean expressions and minimize the number of literals:
Boolean Algebra Task 1 Simplify the following Boolean expressions and minimize the number of literals: 1.1 1.2 1.3 Task 2 Convert the following expressions into sum of products and product of sums: 2.1
Logic Design II (17.342) Spring Lecture Outline
Logic Design II (17.342) Spring 2012 Lecture Outline Class # 10 April 12, 2012 Dohn Bowden 1 Today s Lecture First half of the class Circuits for Arithmetic Operations Chapter 18 Should finish at least
PSEUDORANDOM BINARY SEQUENCES GENERATOR
PSEUDORANDOM BINARY SEQUENCES GENERATOR 1. Theoretical considerations White noise is defined as a random process with power spectral density that is constant in an infinite frequency band. Quasi-white
King Fahd University of Petroleum and Minerals College of Computer Science and Engineering Computer Engineering Department
King Fahd University of Petroleum and Minerals College of Computer Science and Engineering Computer Engineering Department Page 1 of 13 COE 202: Digital Logic Design (3-0-3) Term 112 (Spring 2012) Final
CprE 281: Digital Logic
CprE 28: Digital Logic Instructor: Alexander Stoytchev http://www.ece.iastate.edu/~alexs/classes/ Decoders and Encoders CprE 28: Digital Logic Iowa State University, Ames, IA Copyright Alexander Stoytchev
CpE358/CS381. Switching Theory and Logical Design. Summer
Switching Theory and Logical Design - Class Schedule Monday Tuesday Wednesday Thursday Friday May 7 8 9 - Class 2 - Class 2 2 24 - Class 3 25 26 - Class 4 27 28 Quiz Commencement 3 June 2 - Class 5 3 -
CS61c: Representations of Combinational Logic Circuits
CS61c: Representations of Combinational Logic Circuits J. Wawrzynek March 5, 2003 1 Introduction Recall that synchronous systems are composed of two basic types of circuits, combination logic circuits,
EE40 Lec 15. Logic Synthesis and Sequential Logic Circuits
EE40 Lec 15 Logic Synthesis and Sequential Logic Circuits Prof. Nathan Cheung 10/20/2009 Reading: Hambley Chapters 7.4-7.6 Karnaugh Maps: Read following before reading textbook http://www.facstaff.bucknell.edu/mastascu/elessonshtml/logic/logic3.html
CMP 338: Third Class
CMP 338: Third Class HW 2 solution Conversion between bases The TINY processor Abstraction and separation of concerns Circuit design big picture Moore s law and chip fabrication cost Performance What does
hexadecimal-to-decimal conversion
OTHER NUMBER SYSTEMS: octal (digits 0 to 7) group three binary numbers together and represent as base 8 3564 10 = 110 111 101 100 2 = (6X8 3 ) + (7X8 2 ) + (5X8 1 ) + (4X8 0 ) = 6754 8 hexadecimal (digits
DIGITAL LOGIC CIRCUITS
DIGITAL LOGIC CIRCUITS Digital logic circuits BINARY NUMBER SYSTEM electronic circuits that handle information encoded in binary form (deal with signals that have only two values, and ) Digital. computers,
Numbers and Arithmetic
Numbers and Arithmetic See: P&H Chapter 2.4 2.6, 3.2, C.5 C.6 Hakim Weatherspoon CS 3410, Spring 2013 Computer Science Cornell University Big Picture: Building a Processor memory inst register file alu
CSE 1400 Applied Discrete Mathematics Definitions
CSE 1400 Applied Discrete Mathematics Definitions Department of Computer Sciences College of Engineering Florida Tech Fall 2011 Arithmetic 1 Alphabets, Strings, Languages, & Words 2 Number Systems 3 Machine
Menu. 7-Segment LED. Misc. 7-Segment LED MSI Components >MUX >Adders Memory Devices >D-FF, RAM, ROM Computer/Microprocessor >GCPU
Menu 7-Segment LED MSI Components >MUX >Adders Memory Devices >D-FF, RAM, ROM Computer/Microprocessor >GCPU Look into my... 1 7-Segment LED a b c h GND c g b d f a e h Show 7-segment LED in LogicWorks,
THE LOGIC OF COMPOUND STATEMENTS
CHAPTER 2 THE LOGIC OF COMPOUND STATEMENTS Copyright Cengage Learning. All rights reserved. SECTION 2.4 Application: Digital Logic Circuits Copyright Cengage Learning. All rights reserved. Application:
DE58/DC58 LOGIC DESIGN DEC 2014
Q.2 a. In a base-5 number system, 3 digit representations is used. Find out (i) Number of distinct quantities that can be represented.(ii) Representation of highest decimal number in base-5. Since, r=5
ECE/CS 250: Computer Architecture. Basics of Logic Design: Boolean Algebra, Logic Gates. Benjamin Lee
ECE/CS 250: Computer Architecture Basics of Logic Design: Boolean Algebra, Logic Gates Benjamin Lee Slides based on those from Alvin Lebeck, Daniel Sorin, Andrew Hilton, Amir Roth, Gershon Kedem Admin
CSEN102 Introduction to Computer Science
CSEN102 Introduction to Computer Science Lecture 7: Representing Information I Prof. Dr. Slim Abdennadher Dr. Mohammed Salem, slim.abdennadher@guc.edu.eg, mohammed.salem@guc.edu.eg German University Cairo,
Review for Final Exam
CSE140: Components and Design Techniques for Digital Systems Review for Final Exam Mohsen Imani CAPE Please submit your evaluations!!!! RTL design Use the RTL design process to design a system that has
CSE 241 Digital Systems Spring 2013
CSE 241 Digital Systems Spring 2013 Instructor: Prof. Kui Ren Department of Computer Science and Engineering Lecture slides modified from many online resources and used solely for the educational purpose.
Combinational Logic Design Combinational Functions and Circuits
Combinational Logic Design Combinational Functions and Circuits Overview Combinational Circuits Design Procedure Generic Example Example with don t cares: BCD-to-SevenSegment converter Binary Decoders
SAMPLE ANSWERS MARKER COPY
Page 1 of 12 School of Computer Science 60-265-01 Computer Architecture and Digital Design Fall 2012 Midterm Examination # 1 Tuesday, October 23, 2012 SAMPLE ANSWERS MARKER COPY Duration of examination: