COP 3502Computer Science ISpring 2006Instructor: Kanad BiswasPop-up Quiz tests 10%mid term exams 40%COP 3502Computer Science ISpring 2006http://www.cs.ucf.edu/courses/cop3502/spr06/730Instructor: Kanad BiswasOffice: CC-I Room 211email: [email protected] If you want to email me, MAKE SURE to enter in the subject line “cop 3502 “ followed by your name. General guidelines This course lays the foundations of computer science. It goes beyond “coding in C”. It will cover different ways to structure the data, and will show how each structure is useful in solving different problems. For each solution, we shall also examine the efficiency using a special mathematical tool.This course involves extensive programming, which means besidesattending the lecture classes you are required to spend substantial hours in the computer center labs working on your assignments. You may fail this course if you do not submit all the assignments.If you cannot afford to spend time on assignments, it would be in your interest to withdraw from the course.Every student will be given an account on the Olympus. The TAs grading your programs would try to execute your code on Olympususing gcc, or they can try compiling using jgrasp. If your programs cannot run on Olympus or jgrasp, there is no way that the TAs would be able to award you any points for your work. Course Objectives- Provide an introduction to the field of computing: Thecentral concept that underlies computer science is the designand implementations of algorithms to solve specificproblems.- Provide Conceptual Content and Software Skills: Thelecture component focuses on conceptual tools forconstructing and analyzing algorithms – Time Complexityand recursion, while the lab component focuses onimplementation issues involved in C programming.- Introduce elementary data structures: Arranging data inarrays, linked lists, stacks, queues and binary trees. Study ofsearching and sorting techniques.Course Content1. Review of Pointers, arrays, dynamic allocation, files2. Design of Algorithms for problem solving3. Algorithmic Complexity 4. Searching5. Recursion6. Stacks and Queues7. Linked Lists 8. Binary Trees 9. SortingLecture Classes:The sequence of lecture topics given above is tentative and may be altered as the course proceeds. Reference Books:Any book on Data structures will do for this course. The following book is available in the bookstore:Data structures, algorithms & software principles in CThomas B. StandishAddison - WesleyRecitation Sessions (Labs): In the recitation sessions, the TAs (Teaching Assistants) will provide assistance in solving problems related to material covered in the lecture classes. They may also supplement the lectures with additional topics. They will also conduct pop-quizzes.Assignments:- All the programming assignments are required to be implemented in ‘C’. You will get an OLYMPUS account, andyou can either use the computer labs at UCF, or dial up from home to run your programs on OLYMPUS. Your programs must compile under gcc or cygwin.- All assignments must be submitted through WebCT by 10 PM on the indicated due date. Assignments submitted after the due date would be accepted till the cut-off date with 10%penalty per day. No assignments would be accepted after the cutoff date.- Assignments must be carried out individually. Collaboration on any assignment is NOT acceptable. Cheating may result ina failing grade regardless of performance.Exams:There will be two mid term exams and one final exam. The dates for these exams will be announced shortly. In addition there will be a number of pop-up Quiz tests.All tests will be closed book and notes .Calculators and cell phonesare not allowed in any exam/quiz tests. You may get pop quizzes in lecture or in recitation sessions. Do NOT miss any test/exam. There are no make-up tests. If you miss a test for SERIOUS reasons you have to provide official written evidence. If evidence is accepted a form of grade recovery will be discussed with the instructor.Cheating may result in a failing grade regardless of performance.Tentative Grading Scheme:Pop-up Quiz tests 10%mid term exams 40% Final exam 25%Assignments 25% The instructor reserves the right to use plus/minus grading in this
View Full Document
Unlocking...