Foundation Test-Out Exams
(INFS, ISA, SWE)

Exams

The Department of Computer Science offers the opportunity to "test out" of the INFS 501, 515, 519, and SWE 510 foundation courses.

The exams are given each January and August. It is important to note that you will be permitted to take each exam one time only. Failure to pass the exam will mean that you MUST take the foundation classes before enrolling in any core curriculum course.

There is no need to register for the exams. Simply be present at the date, time and location specified with some form of photographic identification. Each exam will be one hour in length. They are scheduled for the following days and times.

Upcoming Exam Information

August 25, Room to be determined later: INFS 501: 2:00 PM
INFS 515: 3:30 PM
August 26, Room to be determined later: INFS 519: 2:00 PM
SWE 510: 3:30 PM

Exam Preparation

In preparation for an examination, you may wish to review the following textbooks.

INFS 501: Discrete Math

Discrete Mathematics with Applications, third edition, by Susanna S. Epp, Published by Brooks Cole, ISBN: 0-534-94446-9.

Syllabus

Chapter 1: The Logic of Compound Statements: 1.1, 1.2, 1.3
Chapter 2: The Logic of Quantified Statements: 2.1, 2.2, 2.3, 2.4
Chapter 3: Elementary Number Theory and Methods of Proof: 3.1, 3.2, 3.3, 3.4, 3.5, 3.6
Chapter 4: Sequences and Mathematical Induction: 4.1, 4.2, 4.3
Chapter 5: Set Theory: 5.1, 5.2, 5.3
Chapter 7: Functions: 7.1, 7.2, 7.4
Chapter 8: Recursion: 8.1, 8.4
Chapter 9: O-Notation and the Efficiency of Algorithms: 9.1, 9.2, 9.3, 9.4
Chapter 10: Relations: 10.1, 10.2, 10.3, 10.5
Chapter 11: Graphs and Trees: 11.1, 11.2, 11.4, 11.5
Chapter 12: 12.2

INFS 515: Computer Organization

The Essentials of Computer Organization and Architecture, 2nd Edition, Linda Null and Julia Lobur, Jones and Barlett Publishers, 2006, ISBN: 0-7637-3769-0.

Syllabus

Chapter 1: Introduction - Historical Overview
Chapter 2: Data Representation
Chapter 3: Boolean Algebra and Digital Logic
Chapter 4: MARIE
Chapter 5: Instruction set Architectures
Chapter 6: Memory Concepts
Chapter 7: Input/Output and Storage Systems
Chapter 8: System Software
Chapter 9: Alternative Architectures
Chapter 10: Embedded Systems
Chapter 11: Performance Measurement and Analysis

INFS 519: Program Design and Data Structures

Data Structures and Problem Solving Using JAVA, by Weiss, published by Addison-Wesley, ISBN: 0-201-74835-5.

Syllabus

Chapter 1: Primitive Java
Chapter 2: References
Chapter 3: Objects and Classes
Chapter 4: Inheritance
Chapter 5: Algorithm Analysis
Chapter 6: Collections API
Chapter 7: Recursion
Chapter 8: Sorting Algorithms
Chapter 11: Stacks and Compilers
Chapter 14: Graphs
Chapter 16: Stacks and Queues
Chapter 17: Linked Lists
Chapter 18: Trees
Chapter 19: Binary Search Trees
Chapter 20: Hash Tables
Chapter 21: Priority Queue: The Binary Heap

SWE 510: Object-Oriented Programming in Java

Java Gently, by Judith Bishop, 3rd Edition, Addison-Wesley, 2001, ISBN: 0-201-71050-1.

Syllabus

Chapter 1: Introduction
Chapter 2: Basic of Object Orientation
Chapter 4: Input and Output
Chapter 5: Flow of Control
Chapter 6: Arrays and Tablees
Chapter 9: Abstraction and Inheritance
Chapter 10: Graphics and User Interfaces
Chapter 11: Event-driven Programming
Chapter 12: Applets and Servlets
Chapter 13: Multithreading