Final Exam Review Instructor : Yuan Long CSC2010 Introduction to Computer Science Apr. 23, 2013.

Slides:



Advertisements
Similar presentations
Course Outline Presentation Term: F09 Faculty Name : Asma Sanam Larik Course Name :INTRO TO COMPUTING Course Code : CSE145 Section :1 Semester : 1.
Advertisements

Logic Circuits Design presented by Amr Al-Awamry
Assembly Language for x86 Processors 6 th Edition Chapter 1: Introduction to ASM (c) Pearson Education, All rights reserved. You may modify and copy.
Assembly Language for Intel-Based Computers, 4 th Edition Chapter 1: Basic Concepts (c) Pearson Education, All rights reserved. You may modify and.
Give qualifications of instructors: DAP
التصميم المنطقي Second Course
CS 151 Digital Systems Design Lecture 37 Register Transfer Level
 Readings: Chapter 1-8 (Berger)  Instructor: Rob Nash  Exam: Monday, Mar 11 th  Same time and place.
Chapter 4: The Building Blocks: Binary Numbers, Boolean Logic, and Gates Invitation to Computer Science, Java Version, Third Edition.
Computer Organization Boolean Logic and the CPU i206 Fall 2010 John Chuang Some slides adapted from Marti Hearst, Brian Hayes, or Glenn Brookshear.
Chapter 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 & Fourth Edition Spring 2008:
Midterm Wednesday Chapter 1-3: Number /character representation and conversion Number arithmetic Combinational logic elements and design (DeMorgan’s Law)
COMS W1004 Introduction to Computer Science June 11, 2008.
1 Lecture 11: Digital Design Today’s topics:  Evaluating a system  Intro to boolean functions.
Chapter 1 Data Storage. 2 Chapter 1: Data Storage 1.1 Bits and Their Storage 1.2 Main Memory 1.3 Mass Storage 1.4 Representing Information as Bit Patterns.
Assembly Language for Intel-Based Computers, 5 th Edition Chapter 1: Basic Concepts (c) Pearson Education, All rights reserved. You may modify.
Outline Chapter 1 Hardware, Software, Programming, Web surfing, … Chapter Goals –Describe the layers of a computer system –Describe the concept.
Combinational Logic1 DIGITAL LOGIC DESIGN by Dr. Fenghui Yao Tennessee State University Department of Computer Science Nashville, TN.
Chapter 4: The Building Blocks: Binary Numbers, Boolean Logic, and Gates Invitation to Computer Science, C++ Version, Fourth Edition.
CEN 226: Computer Organization & Assembly Language :CSC 225 (Lec#1) By Dr. Syed Noman.
CS 105 Digital Logic Design
Binary System and Logical Gates
1 Intro to Computer Science I Chapter 1 Introduction to Computation Algorithms, Processors, and Programs.
Quiz # 2 Chapters 4, 5, & 6.
CPSC 171 Introduction to Computer Science Boolean Logic, Gates, & Circuits.
CS 1308 – Computer Literacy and the Internet. It’s Not Magic  The goal of the next series of lectures is to show you exactly how a computer works. 
OCR GCSE Computing © Hodder Education 2013 Slide 1 OCR GCSE Computing Chapter 2: Binary Logic.
Chapter 4 The Building Blocks: Binary Numbers, Boolean Logic, and Gates.
Assembly Language for x86 Processors 7th Edition
Chapter 1 Introduction Dr. Frank Lee. 1.1 Why Study Compiler? To write more efficient code in a high-level language To provide solid foundation in parsing.
©Brooks/Cole, 2003 Foundations of Computer Science from Data Manipulation to Theory of Computation Behrouz A. Forouzan, Brooks/Cole — Thomson Learning,
Computer Systems Organization CS 1428 Foundations of Computer Science.
Apr. 3, 2000Systems Architecture I1 Systems Architecture I (CS ) Lecture 3: Review of Digital Circuits and Logic Design Jeremy R. Johnson Mon. Apr.
Invitation to Computer Science 6th Edition Chapter 4 The Building Blocks: Binary Numbers, Boolean Logic, and Gates.
التحليل والتصميم المنطقي DIGITAL DESIGN Instructor : Khalil Alsulbi Mobile : Room : 217.
Chapter 7 Logic Circuits 1.State the advantages of digital technology compared to analog technology. 2. Understand the terminology of digital circuits.
Computer Science 101 Computer Systems Organization.
1 Text Reference: Warford. 2 Computer Architecture: The design of those aspects of a computer which are visible to the programmer. Architecture Organization.
CS 1308 – Computer Literacy and the Internet Building the CPU.
CPS3340 Computer Architecture Fall Semester, 2013
ICC Module 3 Lesson 1 – Computer Architecture 1 / 6 © 2015 Ph. Janson Information, Computing & Communication Computer Architecture Clip 3 – Instruction.
Simple ALU How to perform this C language integer operation in the computer C=A+B; ? The arithmetic/logic unit (ALU) of a processor performs integer arithmetic.
CS 3843 Computer Organization Prof. Qi Tian Fall 2013
To Compute: To Do Math. Information is collected by tallying data as it travels across circuits. The key part of integrated circuits are transistors.transistors.
COMPUTER ARCHITECTURE & OPERATIONS I Instructor: Yaohang Li.
Logic Gates and Boolean Algebra Introduction to Logic II.
Materials on the Exam Introduction Data Representation in Computer Systems Boolean Algebra Digital Logic MARIE: An Introduction to a Simple Computer Until.
CS 1428 Final Exam Review. Exam Format 200 Total Points – 60 Points Writing Programs – 45 Points Tracing Algorithms and determining results – 20 Points.
Algorithms in Programming Computer Science Principles LO
Lecture 1 Gunjeet kaur Dronacharya group of institutions.
Chapter I: Introduction to Computer Science. Computer: is a machine that accepts input data, processes the data and creates output data. This is a specific-purpose.
Computer Architecture & Operations I
Invitation to Computer Science, C++ Version, Fourth Edition
CS 270: Mathematical Foundations of Computer Science
Computer Organisation
COMPUTER ORGANIZATION & ASSEMBLY LANGUAGE
Chapter 2.3 Binary Logic.
Invitation to Computer Science, Java Version, Third Edition
CS 1308 Exam 2 Review.
Chapter 1 Data Storage.
Computer Science 210 Computer Organization
Data Types, Identifiers, and Expressions
CSC Classes Required for TCC CS Degree
The Building Blocks: Binary Numbers, Boolean Logic, and Gates
Invitation to Computer Science 6th Edition
CS 1428 Final Exam Review.
Low Level Programming Languages
Combinational Circuits
SYEN 3330 Digital Systems Chapter 2 – Part 1 SYEN 3330 Digital Systems.
Presentation transcript:

Final Exam Review Instructor : Yuan Long CSC2010 Introduction to Computer Science Apr. 23, 2013

Chapter 1 The Algorithmic Foundations of Computer Science  The definition of Computer Science.  What did Von Neumann internalize in his 1946 computer design that marked a radical change from previous computers?

Chapter 2 Algorithm Discover and Design  Condition Operation.  Modifications on algorithm, convert algorithm using “ if else if” statement to the new while loop algorithm.

Chapter 3 The Efficiency of Algorithm  Worst case & best case in Sequential Search and Binary search algorithm.  Order of magnitude: Given the time complexity, choose the slowest or fastest one.

Chapter4 The Building Blocks  Binary representation of integer and fractional numbers and corresponding conversion method.  Using truth table to show the Boolean expression, and build a circuit diagram with AND,OR and NOT gate.  Compress text stream, and show the compression ratio.(Run-length encoding and variable length code )

Chapter 5 Computer Systems Organization  Average Access Time  Principle of Locality  Arithmetic Logic Unit  Multiplexor circuit and decoder circuit  MAR, memory unit maximum size, dimensions of memory, row select lines,column select lines.  Structure of instruction: operation codes number, memory size, bytes required for the instruction.

Chapter 6 An introduction to System Software and Virtual Machines  The content of register and memory after execution of instruction.  Symbol table construction in assembly language.

Chapter Java  Write down the output of some simple java programs.

 This review covers at least 80% of the questions of the final.  To prepare for your final exam, please go over the contents in slides in each chapter, and you also need to review your previous tests, homework.