Introduction to Computers & Programming

Similar documents
Chapter 1: Data Storage. Copyright 2015 Pearson Education, Inc.

Data Storage and Manipulation

8/30/2010. Chapter 1: Data Storage. Bits and Bit Patterns. Boolean Operations. Gates. The Boolean operations AND, OR, and XOR (exclusive or)

I B.SC (INFORMATION TECHNOLOGY) [ ] Semester II CORE : DIGITAL COMPUTER FUNDAMENTALS - 212B Multiple Choice Questions.

NUMBER SYSTEMS AND CODES...

Chapter 3 Digital Data

Theory Lecture Day Topic Practical Day. Week. number systems and their inter-conversion Decimal, Binary. 3rd. 1st. 1st

CS302 Digital Logic Design Solved Objective Midterm Papers For Preparation of Midterm Exam

TIME SCHEDULE. MODULE TOPICS PERIODS 1 Number system & Boolean algebra 17 Test I 1 2 Logic families &Combinational logic

Bachelor Level/ First Year/ Second Semester/ Science Full Marks: 60 Computer Science and Information Technology (CSc. 151) Pass Marks: 24

DIGITAL CIRCUIT COMBINATORIAL LOGIC

CS6201 UNIT I PART-A. Develop or build the following Boolean function with NAND gate F(x,y,z)=(1,2,3,5,7).

Introduction to Digital Logic Missouri S&T University CPE 2210 Exam 2 Logistics

SEMESTER ONE EXAMINATIONS 2002

QUICK GUIDE COMPUTER LOGICAL ORGANIZATION - OVERVIEW

Minnesota State College Southeast

The word digital implies information in computers is represented by variables that take a limited number of discrete values.

MODU LE DAY. Class-A, B, AB and C amplifiers - basic concepts, power, efficiency Basic concepts of Feedback and Oscillation. Day 1

1. Convert the decimal number to binary, octal, and hexadecimal.

North Shore Community College

UNIT 1: DIGITAL LOGICAL CIRCUITS What is Digital Computer? OR Explain the block diagram of digital computers.

Tribhuvan University Institute of Science and Technology Bachelor of Science in Computer Science and Information Technology

TYPICAL QUESTIONS & ANSWERS

1 Hour Sample Test Papers: Sample Test Paper 1. Roll No.

The basic logic gates are the inverter (or NOT gate), the AND gate, the OR gate and the exclusive-or gate (XOR). If you put an inverter in front of

Chapter 7 Memory and Programmable Logic

R13 SET - 1 '' ''' '' ' '''' Code No: RT21053

2 Marks Q&A. Digital Electronics. K. Michael Mahesh M.E.,MIET. Asst. Prof/ECE Dept.

Introduction to Digital Logic Missouri S&T University CPE 2210 Exam 3 Logistics

[2 credit course- 3 hours per week]

DHANALAKSHMI SRINIVASAN INSTITUTE OF RESEARCH AND TECHNOLOGY CS6201-DIGITAL PRINCIPLE AND SYSTEM DESIGN. I Year/ II Sem PART-A TWO MARKS UNIT-I

S.K.P. Engineering College, Tiruvannamalai UNIT I

Lab 2 Part 1 assigned for lab sessions this week

R13. II B. Tech I Semester Regular Examinations, Jan DIGITAL LOGIC DESIGN (Com. to CSE, IT) PART-A

REPEAT EXAMINATIONS 2002

DIGITAL FUNDAMENTALS

DIGITAL ELECTRONICS MCQs

A Review of logic design


Logic. Andrew Mark Allen March 4, 2012

CSCI 120 Introduction to Computation Bits... and pieces (draft)

RS232 Decoding (Option)

Combinational vs Sequential

Where Are We Now? e.g., ADD $S0 $S1 $S2?? Computed by digital circuit. CSCI 402: Computer Architectures. Some basics of Logic Design (Appendix B)

COMP12111: Fundamentals of Computer Engineering

Digital Circuits. Electrical & Computer Engineering Department (ECED) Course Notes ECED2200. ECED2200 Digital Circuits Notes 2012 Dalhousie University

ECE 715 System on Chip Design and Test. Lecture 22

DIGITAL SYSTEM DESIGN UNIT I (2 MARKS)

1. True/False Questions (10 x 1p each = 10p) (a) I forgot to write down my name and student ID number.

Users guide for PB units Interface unit, 4- or 6-digit

Chapter Contents. Appendix A: Digital Logic. Some Definitions

Introduction. Serial In - Serial Out Shift Registers (SISO)

WINTER 14 EXAMINATION

Condensed Notes On Digital Logics (According to BScCSIT syllabus TU) By Bishnu Rawal. csitnepal. Binary Systems Page 1.

Lesson No Lesson No

FE REVIEW LOGIC. The AND gate. The OR gate A B AB A B A B 0 1 1

COMP2611: Computer Organization. Introduction to Digital Logic

Mounting Dimensions / Viewing 2 Mounting Options 3. Wiring Configuration 4. Quick Set up Procedure 5. Changing Intensity 6.

ECE 263 Digital Systems, Fall 2015

Midterm Examination II

EXPERIMENT: 1. Graphic Symbol: OR: The output of OR gate is true when one of the inputs A and B or both the inputs are true.

Principles of Computer Architecture. Appendix A: Digital Logic

Find the equivalent decimal value for the given value Other number system to decimal ( Sample)

PLTW Engineering Digital Electronics Course Outline

EE292: Fundamentals of ECE

LECTURE NOTES. ON Digital Circuit And Systems

DIGITAL CIRCUIT LOGIC UNIT 9: MULTIPLEXERS, DECODERS, AND PROGRAMMABLE LOGIC DEVICES

Register Transfer Level (RTL) Design Cont.

Digital Electronics Course Outline

AIM: To study and verify the truth table of logic gates

Contents Circuits... 1

Using minterms, m-notation / decimal notation Sum = Cout = Using maxterms, M-notation Sum = Cout =

Digital Circuits I and II Nov. 17, 1999

Chapter 5 Sequential Circuits

EECS 270 Final Exam Spring 2012

Lossless Compression Algorithms for Direct- Write Lithography Systems

ME 515 Mechatronics. Introduction to Digital Electronics

1.b. Realize a 5-input NOR function using 2-input NOR gates only.

CHAPTER1: Digital Logic Circuits

Semester 6 DIGITAL ELECTRONICS- core subject -10 Credit-4

1. a) For the circuit shown in figure 1.1, draw a truth table showing the output Q for all combinations of inputs A, B and C. [4] Figure 1.

To design a sequential logic circuit using D-Flip-flop. To implement the designed circuit.

AC103/AT103 ANALOG & DIGITAL ELECTRONICS JUN 2015

ECS 15: Introduction to Computers Midterm November 6, 2013

SRM UNIVERSITY FACULTY OF ENGINEERING AND TECHNOLOGY SCHOOL OF ELECTRONICS AND ELECTRICAL ENGINEERING DEPARTMENT OF ECE COURSE PLAN

Course Plan. Course Articulation Matrix: Mapping of Course Outcomes (COs) with Program Outcomes (POs) PSO-1 PSO-2

Chapter 2. Digital Circuits

The reduction in the number of flip-flops in a sequential circuit is referred to as the state-reduction problem.

CS302 - Digital Logic & Design

For Teacher's Use Only Q Total No. Marks. Q No Q No Q No

BHARATHIDASAN ENGINEERING COLLEGE, NATTRAMPALLI DEPARTMENT OF ECE

Data Encoding CTPS 2018

Department of Electrical and Computer Engineering Mid-Term Examination Winter 2012

Department of Computer Science and Engineering Question Bank- Even Semester:

VU Mobile Powered by S NO Group

Computer Architecture and Organization

TEST-3 (DIGITAL ELECTRONICS)-(EECTRONIC)

THE KENYA POLYTECHNIC

WELCOME. ECE 2030: Introduction to Computer Engineering* Richard M. Dansereau Copyright by R.M. Dansereau,

Digital Logic Fundamentals

Transcription:

6.070 Introduction to Computers & Programming Machine architecture: data storage, memory organisation, logic gates Prof. Kristina Lundqvist Dept. of Aero/Astro, MIT

Chapter Summary: B Chapter presents the rudiments of data storage within digital computers. It introduces the basics of digital circuitry and how a simple flip-flop can be used to store a single bit. It then discusses addressable memory cells and mass storage systems (magnetic disk, compact disks, and magnetic tape). The chapter then discusses how information (text, numeric values, images, and sound) are encoded as bit patterns. The optional sections delve more deeply into these topics by presenting the problems of overflow errors, truncation errors, error detection and correction techniques, and data compression.

Bits and Their Storage Bit (binary digit) Two symbols: 0 and Boolean operations AND, OR, XOR, and NOT

Pictorial Representation of AND and OR

Pictorial Representation of XOR and NOT

NAND / NOR DeMorgans s Theorem http://hyperphysics.phy-astr.gsu.edu/hbase/electronic/nor.html#c

Boolean Algebra Theorems ABC=(AB)C=A(BC), A+B+C=(A+B)+C=A+(B+C) AND, OR are associative AB=BA, A+B=B+A AND, OR operations are commutative A+BC=(A+B)(A+C), A(B+C)=AB+AC Forms of the distributive property A+B=AB a form of DeMorgan s Theorem AB=A+B a form of DeMorgan s Theorem AA=A, A+A=A, A+A=, AA=0, A=A Single Variable Theorems A+AB=A, A+AB=A+B Two-variable theorems A=A, A+=, A+0=A, A0=0, =0, 0= Identity and Null operations

A Simple Flip-flop Circuit A flip-flop The output will flip or flop between two values under control of external stimuli

Setting the Output of a Flip-Flop to

Setting the Output of a Flip-Flop to

Setting the Output of a Flip-Flop to 0

Another way of constructing a flip-flop Alternative way to build flip-flop

Other Storage Techniques Cores http://www.fortunecity.com/marina/reach/435/coremem.htm DRAM (Capacitors, transistors) http://www.cordis.lu/nanotechnology/icons/count_projectsilicon-wafer.jpg

The Hexadecimal Coding System Hex is often used in processing telemetry from a spacecraft Data transmitted from the spacecraft to the ground is a stream of bits s and 0 s: 000000000000000 00000000

Main Memory Main memory arranged in manageable units called: Cells Typically 8 bits: Byte

Memory Cells Each cell is assigned a unique name, called its address Stored data can be accessed in random order Read/ write

Little/Big-Endian 00000000 00000000 0000000 0000000 Address 00 0 02 03 Big-Endian repr. of 025 0000 0000 0000 0000 0000 000 0000 000 Little-Endian repr. of 025 0000 000 0000 000 0000 0000 0000 0000

Memory Capacity Main memory systems usually has total number of cells as a power of two 2 0 = 024 = KB 2 20 =,048,576 = MB 2 30 =,073,74,824 = GB

Mass Storage Mass storage systems Magnetic disk, CD, Magnetic tape Less volatility Large storage capacity Remove form machine for archival purpose

Memory Cells Arranged by Address

CD Storage Format

Information as Bit Patterns Representing text, numeric values, images, sound Text (Extended) ASCII (American Standard Code for Information Interchange) EBCDIC (Extended Binary Coded Decimal interchange Code) Unicode ISO standards http://tronweb.super-nova.co.jp/characcodehist.html

ASCII ASCII Hex Symbol ASCII Hex Symbol ASCII Hex Symbol 0 2 3 4 5 6 7 8 9 0 2 3 4 5 0 2 3 4 5 6 7 8 9 A B C D E F NUL SOH STX ETX EOT ENQ ACK BEL BS TAB LF VT FF CR SO SI 48 49 50 5 52 53 54 55 56 57 58 59 60 6 62 63 30 3 32 33 34 35 36 37 38 39 3A 3B 3C 3D 3E 3F 0 2 3 4 5 6 7 8 9 : ; < = >? 96 97 98 99 00 0 02 03 04 05 06 07 08 09 0 60 6 62 63 64 65 66 67 68 69 6A 6B 6C 6D 6E 6F ` a b c d e f g h i j k l m n o 00000 0000 0000 0000 00

Numeric Values Storing the value of 25 0 using ASCII: 00000 0000 Binary notation: 00000000 000000 2 2 5 2 4 2 3 2 2 2 2 0

Finding Binary Representation of Large Values. Divide the value by 2 and record the remainder 2. As long as the quotient obtained is not 0, continue to divide the newest quotient by 2 and record the remainder 3. Now that a quotient of 0 has been obtained, the binary representation of the original value consists of the remainders listed from right to left in the order they were recorded