Foundation Test-Out Exams
(INFS, ISA, SWE)
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.
Registration is required. Please email your intent to email@example.com. Include your name, G number and the exams you wish to register for. A photo ID must be presented on the day of the exam.
Each exam will be one hour in length. They are scheduled for the following days and times.
Upcoming Exam Information
- January 15, Room 1103, Engineering Building
INFS 501: 9:00 AM
INFS 515: 11:00 AM
INFS 519: 1:00 PM
SWE 510: 3:00 PM
In preparation for an examination, you may wish to review the following textbooks.
INFS 501: Discrete Math
Discrete Mathematics with Applications, 3rd edition (Dec. 22, 2003), by Susanna S. Epp,
Published by Brooks Cole, ISBN-10:0534359450; ISBN-13:978-0534359454.
You must bring a hand calculator that is capable of raising numbers to powers. No calculator will be provided for you. Calculator-sharing, cell-phone calculators, and computers will not be allowed.
- Chapter 1: The Logic of Compound Statements and Syllogisms: 1.1, 1.2, 1.3
- Chapter 3: Number Theory, Methods of Proof, Euclidean Algorithm: 3.1, 3.2, 3.3, 3.4, 3.8
- Chapter 4: Sequences, Sum of a Geometric Sequence, and Mathematical Induction: 4.1, 4.2, 4.3
- Chapter 5: Set Theory: 5.1, 5.2, 5.3
- Chapter 6: Counting Methods, Permutations, and Combinations: 6.2, 6.4
- Chapter 7: Functions: 7.1, 7.2, 7.4
- Chapter 8: Recursion: 8.1, 8.3
- Chapter 10: Equivalence Relations, Modular Arithmetic, and RSA: 10.1, 10.2, 10.3, 10.4
- Chapter 11: Graphs, Isomorphisms, and Trees: 11.1, 11.2, 11.4, 11.5
INFS 515: Computer Organization
Computer Organization and Architecture: Designing for Performance, 8th Edition,
by William Stallings, Prentice Hall, ISBN 0136073735
Operating System Concepts with Java, 8th Edition,
by Abraham Silberschatz, Peter B. Galvin, and Greg Gagne, Wiley Publishing, ISBN 978-470-50949-4
- Computer hardware architecture concepts include number systems
- Machine representation of numbers
- Instruction set formats
- Addressing techniques, memory organization
- Internal processor structure and operation
- Symbolic assembly language
- Process synchronization and scheduling
- Inter-process communication
- Memory management
- Virtual memory
- File I/O and disk management
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.
- 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
Absolute Java, 4th Edition by Walter Savitch, Addison-Wesley, 2009, ISBN: 978-0136083825.
- Chapter 1: Getting Started
- Chapter 2: Console Input and Output
- Chapter 3: Flow of Control
- Chapter 4: Defining Classes I
- Chapter 5: Defining Classes II
- Chapter 6: Arrays
- Chapter 7: Inheritance
- Chapter 8: Polymorphism and Abstract Classes
- Chapter 9: Exception Handling
- Chapter 10: File I/O
- Chapter 12: UML and Patterns (Section 12.1 only)
- Chapter 13: Interfaces and Inner Classes