📄 http:^^www.cis.ufl.edu^~crummer^cop3530.html
字号:
Date: Tue, 14 Jan 1997 23:57:49 GMT
Server: Stronghold/1.3.2 Ben-SSL/1.3 Apache/1.1.1
Content-type: text/html
Set-Cookie: Apache=gs3519554853286269836; path=/
<HTML><HEAD><TITLE>Data Structures and Algorithms COP 3530</TITLE><H2>Data Structures and Algorithms COP 3530, Spring 1996, Dr. Crummer</H2><PRE>This core course in computer science has prerequisites CIS3020 (Intro toComputer Science) and CDA3101 (Intro to Computer Organization) and isdescribed in the official U.F. catalog. The following information is mydescription in finer detail of how I plan to conduct the course. </ul><li><B>ATTENDANCE IS MANDATORY.</B><li><B>Instructor: Teaching Assistants:================== ===================================</B>Dr. Arthur Crummer Owen Moore Greg CusickCSE 352 Univ of FL CSE E555 CSE E406 (352) 392-1507 392-3848 392-2594crummer@cis.ufl.edu omm@cis.ufl.edu gjc@cis.ufl.eduOffice hrs:10-11AM: M,W,F M,W,F 4th; M 5th M,W,F 6th; Tu 7th<li> <B>TEXT</B>: Data Abstraction and Problem Solving with C++, (Walls And Mirrors), by Frank Carrano, 1995 Practice exercises will be assigned but not collected. These are listed below.<li><B>UNDERGRADUATE CONSULTANT:</B> Michael Mark, <mpm@cis.ufl.edu> is a consultant on duty for this course.He holds consulting hours in the "fishbowl" area on the 2nd floor of CSEnear the CIRCA labs (just to the left as you enter the lab) with this currentschedule. Here are the current hours:WEEK AFTER SPRING BREAK:Mar 18- Mar 21 : <to be updated periodically>============== Monday 6 - 8pm Tueday 6 - 7pm Wednesday 5 - 8pm Thursday 6 - 10pm<li><B>DISCUSSION SECTIONS:</B>Based on the section number you registered for, you will attend onediscussion section per week. In that discussion section, you will1) take occasional quizzes (announced or not), 2) receive instruction on C++ implementation details of the abstractions you are learning, and 3) get instructions and guidance on the assigned personal and homework projects which you will submit on-line.<li><B>COMPUTER LANGUAGE: C++</B>We will use C++ in the lectures, discussion sections and all homeworks.No prior knowledge of C or C++ is assumed, but you must have the courseprerequisites including experience in one or more high level languages.You will using Borlands Turbo C++ on any CIRCA machines on campus.<li><B>HOMEWORK SUBMISSION:</B> The electronic submission of homeworks requires that you have a "grove"account. This process is explained in an evening hands-on session the firstweek of class (sign-up in the first lecture).EARLY HW: If you submit a homework early and then improve upon it, you may resubmit. Thelast version submitted before the deadline will be used for grading.LATE HW: Homework may be submitted late if there has not been a solution given out ordiscussed in class. The penalty is 15% for each 24 hours or fraction thereof.<li><B>COURSE GRADE COMPONENTS:</B> EXAM 1 .. 100 EXAM 2 .. 150 EXAM 3 .. 150 QUIZZES .. 50 HOMEWORK PROJECTS .. 150 FINAL EXAM .. 150 ==== 750 <H2>COP 3530 Spring 1996 Dr. Crummer PAGE 2 of 2</H2></ul> <B> <li> ANTICIPATED COURSE CONTENT AND SCHEDULE: </B>Week TextNumber Pages Chapter Topics===== ====== ======= ======1 1-45 1 Problem solving & Software Engineering A1-A26 Appendix, Summary of C++ fundamentals2 49-70 2 Recursion, Power, Fibonacci, Mr. Spock3 71-95 2 Mad scientist, Searching, Binary search * * TEST 14 102-125 3 ADTs: Interface, Implementation (Lists, appt book, SphereClass)5 125-139 3 Programming Details, classes, Arrays 6 140-164 4 Pointers, Pointer-based linked lists 7 164-184 4 More on linked lists implementations and variations8 203-222 5 Using Recursion: Towers, Lists, Backtracking * * TEST 2 : pages 102-184 9 223-243 5 Grammars, Languages, Algebraic expressions -------------- Spring break: Week of March 10 ------10 248-280 6 Stack: ADT, implementations, applications 11 281-296 6 Applications and analysis12 353-372 8 Class relationships, virtual functions, late binding, abstract base class13 372-386 8 Class templates, overloading, the O-O approach14 * * TEST 3 : pages 203-386 393-420 9 Orders of Growth, efficiency (sorting, search)15 437-503 10 Binary tree: as an ADT, implementations, traversals, and applications============================================================================In addition to the homework projects you submit electronically, here areyour personal homework exercises from the textbook:Pages Exercise Number----- ---------------94 1,2,495 2,4,7,9,13,19137 1,2,3,5,7193 1,2,3,5196 3,7,8,9198 28,33241 14,15,16,17296 2,4,6,7,9298 1,2,6,8,11,14388 2,3,4,7390 2a,7504 1-10505 2a,3,6,7,11a-c</PRE></ol><B>FINAL EXAM MONDAY APRIL 29, 1996 (3:00-5:00 PM, CSE 222 or TBA)</B><HR><ADDRESS>EMail: crummer@cis.ufl.edu</ADDRESS><HR><BODY><HTML>⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -