PLEASE NOTE:

 

This review sheet is set up as follows:

1)    A list of general points to review or study.

2)    A list of pages and TOPICS by chapter.

3)    A list of terms from the chapters and labs and class that you should know and recognize.

 

 

 

1)       

a)      The exam covers Chapters  3(end only), 4, 7, 10, 12, 13, 18, 19, some of 23.  Pages that we covered in class are listed in Part 2 below.  You do not have to read any pages that are not on this list.  Also see the list of terms below.  You DO NOT have to study any terms that are not the  term list.

 

b)      Please review the homework assignments  that you received after the miderm (homeworks 3 and 4); Dijkstra’s shortest path algorithm, and the exercise sheets (Chapter 4, Chapter 7 & 10, and two JavaScript handouts) that I gave out to you in class. 

 

c)      Review the QUESTIONS that are at the start of each lab.  Know what each lab taught you in a GENERAL. You DO NOT have to know any terms from the labs that are NOT listed in part three below. 

 

2)      Here is a list of page numbers  by Chapter:

 

a)      Chapter 3: 80-end

            Describing a Web Page

            Hypertext

            File Structure

            Directory Hierarchy

            Organizing the Directory

 

b)      Chapter 4:  You do not have to know HTML tags by heart.  I will give you a list of tags if you need them for the exam:

<b> </b>

<head> </head>

etc.

 

c)      Chapter 7 181-200

                        Precision

                        Lexical Structures

                        Debugging     

                         

 

d)      Chapter 10 260-268

            Algorithms

            Five Essential Properties of Algorithms

            Natural Language

            Programming Language

            (NOT IN THE CHAPTER, BUT FROM LECTURE: SHORTEST PATH             ALGORITHM)

            An Algorithm: Alphabetize CDs

 

e)      Chapter 12 324-336

 

            security

            viruses…etc.

            how to avoid getting a virus on your computer

 

f)       Chapter 13  all

 

            privacy

            cookies

            European Union vs the United States

            encryption (one way, private keys, public keys)

 

g)      Chapter 18-19  all pages, but you are not required to know syntax by heart and only must know what we covered in class (I will give examples of anything that you have to use)

 

            Names, Values, and Variables

            Identifiers and Their Rules

            Variable Declaration Statement

            The Statement Terminator

            Rules for Declaring Variables

            Assignment Statement

            An Expression and Its Syntax

            Arithmetic Operators

            Relational Operators

            Logical Operators

            Logical And

            Logical Or

            Conditional Statement

            if Statements

            Compound Statements

            if/else Statements

             Forms

            Events and Event Handlers

            Three Input Controls

            Event-Based Programming

            The onClick Event Handler

            Click Event

           

            Dot Operator

                       

 

 

 

h)      Chapter 23  659-666  669-677

Can Computers Think?

            The Turing Test

            Passing the Test

Acting Intelligently?

Playing Chess

The Game Tree           

Using Parallel Computation

The Universality Principle

Work Proportional to n2

How Hard Can a Problem Be?

            NP-Complete Problems

Unsolvable Problems

                        The Nonexistent Loop Checker

                        The Halting Problem

 

 

3)      The following are terms that you should recognize and know, divided by chapter.  Each list includes terms from the labs as well.   I will not include any terms that are not on this list on the exam.

 

 

Chapter 3:

 

World Wide Web

Web server

Web page

Web page source

HTML

file structure

directory, folder

directory hierarchy

 

Chapter 4:

 

hypertext markup language (HTML)

white space

source code

tags

tag attributes

hypertext link

anchor tag

hyperlink reference

absolute pathname

relative pathname

“deeper” in a directory

“higher” in a directory

image tag

GIF

JPEG

hexadecimal (hex) digit

RGB color specification

 

Chapter 7:

 

precision

debugging

troubleshooting

field inputs

lexical structure

workaround

algorithm

graph

Dijkstra’s algorithm  -- know how to use it!

shortest path

robot

loop  -- the last few terms are from the algorithms and robotics lab

 

Chapter 10:

 

algorithm

inputs

outputs

definiteness

effectiveness

finiteness

natural languages

formal languages

program

loop

 

 

Chapter 12:

 

virus

worm

Trojan horse

freeware

virus-checking software

phishing

 

Chapter 13:

 

opt-in

opt-out

cryptography

encryption

decryption

cipher text

cleartext (plaintext)

XOR

public key systems (PKS)

RSA public key crypotosystem (RSA)

cookies

 

Chapter 18:

JavaScript

value

variable

identifiers

declaring variables

declaration statement

program

undefined

data types (types)

assignment statement

assignment symbol

expressions

arithmetic operators (binary operators, unary operators)

operands

relationship operators

if statements

if/else statements

 

Chapter 19:

 

tags

buttons

forms

input control

event-handler

event-based programming

event

property of an object

 

Chapter 23:

 

Turing Test

(chess) board configuration

evaluation function

game tree

parallel computation

Deep Blue

Universality Principle

Halting Problem

unsolvable problems