Professor :  Euripides Montagne         Tele.: 823-2684               email:eurip@cs.ucf.edu

Lecture meetings: T-Th 2:00 p.m. – 3:50 p.m. (HEC 118)

Office hours:   MW from 2:30 p.m.  to 4:00 p.m (HEC 217)
TR   from 1:00 p.m.  to 1:50 p.m (HEC 217)

Lab times:
Section 11 --Th 10: 00 a.m. to 11:50 a.m. (CC2 225)
Section 12 --Th 12: 00 p.m. to   1:50 p.m. (CC2 225)
                         
TA :  Rochelle Elva                email: relva@cs.ucf.edu
Office hours:    Thursday  from 9:00 a.m.  to  10:0 0 a.m (HEC 231)

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:
Introduction to Computing and Algorithms, Russell, L. Shackleford. Also a book of your choice on the language JavaScript .  
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.Binary Math

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

Important Dates:
-     Classes begin: May 15. 
-     First Midterm exam:  June 14.

• Withdrawal deadline: June 22.
• Second Midterm exam: July  12.
• Classes end: July 31.
• Final exam:  August 2.   
• Spring  Holidays are:
• Memorial Day:  Monday, May 28th .
• Independence Day:  Wednesday, July 4th .