DOC PREVIEW
UCF COP 2500C - Syllabus

This preview shows page 1 out of 2 pages.

Save
View full document
View full document
Premium Document
Do you want full access? Go Premium and unlock all 2 pages.
Access to all documents
Download any document
Ad free experience
Premium Document
Do you want full access? Go Premium and unlock all 2 pages.
Access to all documents
Download any document
Ad free experience

Unformatted text preview:

COP 2500 Concepts in Computer ScienceSummer 2006SyllabusUCFSchool of Computer ScienceCOP 2500 Concepts in Computer ScienceSummer 2006SyllabusProfessor : Euripides Montagne Tele.: 823-2684 email:[email protected] meetings: T-Th 2:00 p.m. – 3:50 p.m. (ENG2 105)Office hours: MW from 2:00 p.m. to 4:00 p.m (CSB 239) TR from 12:00 p.m. to 1:50 p.m (CSB 239)Lab times:Section 11 --Th 10: 00 a.m. to 11:50 a.m. (CC2 225)Section 12 --Th 12: 00 a.m. to 1:50 a.m. (CC2 225) TA : Kang Zheng Tele.:823-2524 email: [email protected] hours: W from 4:00 p.m. to 6:0 0 p.m (CC1 202)Website: http://www.cs.ucf.edu/courses/cop2500/sum2006Course 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. Basic computer architecture. Introduction to algorithms and functions. Transforming algorithms into code. Data types and structures. Program control structures.Recursion, iteration, modularity. 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 thetalking and the student doing most of the listening. Rather, meetings will consist of discussions oneach 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 examweek.- (30%) Lab assignmentsLetter grades: 90% - 100% = A ; 80% - 89% = B; 70% - 79% = CNote: Any academic dishonesty (including, but not limited to, Cheating, copying and/orplagiarism) 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 GoldenRule : a handbook for students.The Semester Plan: Tentative. 1. Binary Math2. Basic Computer Architecture3. Model of a Computer4. Introduction to Algorithms and Functions (Chapter 2)5. Basic data types and operations (Chapter 3)6. Data Types and Structures (Chapter 3)7. Program Control Mechanisms (Chapter 4)8. Procedural Abstraction: Recursion, Iteration, Modularity (Chapter 4)9. Data Structures: Arrays, Linked Lists, Stacks, Queues, Graphs. (Chapter 3, 5)10. The Cost of Computation (Chapter 9)11. The Hierarchy of Problems (Chapter 11)Important Dates:Last Day to Withdraw: June 23rd First Midterm Exam: June 15th Second Midterm Exam: July 13th Final Exam: Thursday August 3rd (2 p. m. to 3:50 p. m.)Holidays: Memorial Day: May 29th. Independence Day: July


View Full Document

UCF COP 2500C - Syllabus

Download Syllabus
Our administrator received your request to download this document. We will send you the file to your email shortly.
Loading Unlocking...
Login

Join to view Syllabus and access 3M+ class-specific study document.

or
We will never post anything without your permission.
Don't have an account?
Sign Up

Join to view Syllabus 2 2 and access 3M+ class-specific study document.

or

By creating an account you agree to our Privacy Policy and Terms Of Use

Already a member?