Computer Science 1000, Fall '21
Final Exam Review
Copyright 2021 by H.T. Wareham
All rights reserved
- Know the relationships between problems, algorithms, and programs
(slides #3-10).
- Know how to read and trace a given piece of pseudocode.
- Know the Sequential List Search, List Maximum Search, and
Selection Sort algorithms -- how they work in general, what
their best and worst runtime cases are, and what types of
inputs underlie those cases (slides 44-48, 53-56, 57-61, and 68).
- Know how to represent positive and negative decimal numbers in
positional binary notation (slides # 14-22).
- Know the types of digital circuits (slides # 2-3).
- Know the basics of Boolean logic (slides # 4-6).
- Know how to use the Sum-of-Peroducts algorithms to derive
Boolean expressions for the outputs in a circuit behaviour
specification table (slides # 12-15).
- Know the two types of control circuits (multiplexors and
decoders) and their characteristics (slides # 22-28).
- Know the history of implementing digital circuits (slides # 29-34).
- Know the characteristics and parts of the Von Neumann architecture
(slides # 2-5).
- Know the structure and general operation of a computer processor
(slides # 11-15).
- Know the history of implementing computers (slides # 21-32).
- Know the history of implementing system software (slides # 18-28).
- Know the history and characteristics of stored data (slides # 2-4).
- Know the characteristics of relational databases and the relational
database model (slides # 5-15).
- Know the history of the beginnings of computer networks, including
the characteristics and operation of packet switching networks
(slides # 3-15).
- Know the characteristics, operation, and history of the World Wide
Web (slides # 24-32).
- Know the basic tasks of computer security (slide # 2).
- Know the history of computer hackers (slides # 14-17).
- Know the characteristics, operation, and history of cryptography
(slides # 19-28).
- Know what asymptotic worst-case time-complexity and Big-Oh notation are
(slides # 2-9).
- Know the characteristics of polynomial-time reductions and how
in a chain of reductions, polynomial-time solvability and
unsolvability results propogate from one problem in the chain
to another (slides # 17-20).
- Know the main types of AI (slide # 3).
- Know the four main types of knowledge representation in AI and their
characteristics (slides # 14-17).
- Know the four types of AI techniques and their characteristics
(slides # 18-36).
- Know the history of AI in the workplace (slides # 54-56).
- Know the types of possible future computing technology (slide # 5),
Created: November 23, 2021
Last Modified: November 23, 2021