Final Exam ReviewInstructor : Yuan Long

CSC2010 Introduction to Computer Science

Apr. 23, 2013

Chapter 1The 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 2Algorithm Discover and Design

Condition Operation.

Modifications on algorithm, convert algorithm using “ if else if” statement to the new while loop algorithm.

Chapter 3The 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 5Computer 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 6An 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.