Instructor:  Dr. Euripides Montagne
Tel: 407-823-2684
Email: eurip@cs.ucf.edu

Lecture meetings: MWF 12:30 (Noon) to 1:20 p.m. (HEC 125)
Instructor's Office hours:  
MW from 10:00 a.m. to 12:00 p.m. (HEC 217)
TR from 2:00 p.m. to 4:00 p.m. (HEC 217)

Lab times
Section 11 --F 7: 30 a.m. to 8:20 a.m. (HEC - 308) (Himanshu Pagey)
Section 12 --F 8: 30 a.m. to 9:20 a.m. (HEC - 308) (Himanshu Pagey)
Section 13 --F 9: 30 a.m. to 10:20 a.m. (HEC - 308) (Yao Ho)
Section 14 --F 10: 30 a.m. to 11:20 a.m. (HEC - 308) (Yao Ho)
Section 15 --F 11: 30 a.m. to 12:20 p.m. (HEC - 308) (Yao Ho)
                         
Teaching Assistants:

Himanshu Pagey
Email:  hpagey@cs.ucf.edu
Tel:  407 823 3483
Office hours:   Thursday 3.30 p.m. - 5.30 p.m. (HEC 250)

Yao Ho Tel.: (407) 823-3483
Email:  yho@cs.ucf.edu
Tel:  407 823 3483
Office hours:   Office hours: Friday 1:00 p.m. to 3:00 p. m. (HEC 250)

Course Objective:
This course is designed to provide the fundamental concepts in program design, data structures, algorithm analysis, and a survey of topics in computer science.
 
Course Topics:
Binary math                                                  Data types and structures      
Basic computer architecture                         Program control structures
Introduction to algorithms and functions    Recursion, iteration, modularity
Transforming algorithms into code            Arrays, linked lists, stacks, queues, graphs.

Note:  Not Open to Computer Science majors.
 
Required textbook:
JavaScript by Example, E. Quigleyd, Prentice Hall, 2004, ISBN 0-13-140162-9

Style of Class Meetings:
Class meetings will not consist of traditional lectures, with the instructor doing most of the talking and the student doing most of the listening. Rather, meetings will consist of discussions on each topic and the instructor will help guide the discussion by asking questions.
             
Grading Policy:

• (20%) First Midterm exam – closed book, closed notes exam given in class.
• (20%) Second Midterm exam – closed book, closed notes exam given in class.
• (30%) Final Exam – closed book, closed notes comprehensive exam given during final exam week.
• (30%) Lab assignments

 
Letter grades: A =  90% - 100%;   B  =   80% - 89% ;     C  =  70% - 79%

Note: Any academic dishonesty (including, but not limited to, Cheating, copying and/or plagiarism) with respect to any exam or assignment in this class will result in a grade of F, following by the usual procedures for dealing with such behavior, as describe in the UCF Golden Rule : a handbook for students.

The Semester Plan: (Tentative)

1. Binary Math
2. Basic Computer Architecture
3. Model of a Computer
4. Introduction to Algorithms and Functions
5. Basic data types and operations
6. Data Types and Structures
7. Program Control Mechanisms
8. Procedural Abstraction: Recursion, Iteration, Modularity
9. Data Structures: Arrays, Linked Lists, Stacks, Queues, Graphs.
10. The Cost of Computation
11. The Hierarchy of Problems

Important Dates:

• Classes begin: Monday August 25
• First Midterm exam:  TBA
• Withdrawal deadline: Friday October 17.
• Second Midterm exam: TBA
• Classes end: Saturday December 6
• Final exam:  TBA
• Fall Holidays are:
• Labor Day:   Monday September 1.
• Veteran’s Day:   Tuesday November 11.
• Thanksgiving:   November 27 - 29.