From MMAE

The Computer Science Foundation Exam is split into two main sections. from Computer Science 1 and two from Intro to Discrete Math. This page will be used as a study guide for the exam. Below is an outline of the different topics covered on the exam based on the review sheet from Arup Guha's Site.

Contents 1 Discrete 2 Computer Science 2.1 Data Structures 2.2 Algorithms 3 Resources

[edit] Discrete

• Logic
• Sets
• Relations and Functions
• Summations and Induction
• Number Theory
• Counting

[edit] Computer Science

• Tracing
• Number System Conversions
• Order notation
• Recursion

[edit] Data Structures

• Stacks
• Queues
• Linked Lists
• Binary Search Trees
• AVL Trees

[edit] Algorithms

• Sorting Algorithms
• Binary Search
• Fibonacci Sequence
• Palindrome
• Towers of Hanoi

[edit] Resources

• Fall 2006 COT3100 Class
• Fall 2006 COP3502 Class