Java程序辅导

ITCS 2214 Data Structures Spring 2010
Instructor: Dr. K.R. Subramanian Rm. 435E, Woodward Hall
Phone/Email/Web: (704) 687-8579, krs@uncc.edu, http://www.cs.uncc.edu/∼krs
Office Hours: Tue. 3-4pm, Thurs. 3-4pm, or by appointment
Prerequisites: ITCS 1212, ITCS 1215, Good Programming and Problem Solving Skills, Projects in C++/Java
Lab Facilities: Woodward 335 Computer Lab (Mac OSX, Linux, Windows)
Text: John Lewis, Joseph Chase, Java Software Structures, Third Edition, Addison Wesley, 2010.
Reference: Clifford A. Shaeffer, A Practical Introduction to Data Structures and Algorithm
Analysis: Java Edition, Prentice Hall, 1998
Course Website: http://www.cs.uncc.edu/~krs/courses/2214/
Lecture Slides: On the course website, in PDF format
Grading: Projects/Homeworks: 50%, Midterms : 30%, Final: 20%
90-100% of total grade: A, 80-90%: B or better, 70-80%:C or better, 60-70%:D or better.
Passing grade on projects required to pass the course, Incompletes,
only under exceptional circumstances and at instructor discretion
Attendance Policy: Attendance of all scheduled classes is required, unless explicitly excused. Every 4 session
absences can potentially result in a letter grade reduction. You are responsible for all material
covered in class. Attendance for all quizzes/exams is mandatory. Makeup exams will be given
only under special circumstances.
Academic Integrity UNCC Code, under http://www.legal.uncc.edu/policies/ps-105.html.
This course will institute electronic turn-ins of projects. Plagiarism software
may be used to enforce academic integrity.
Course Outline and Approximate Schedule
Topic Chapters Schedule
Data Structures and Algorithm Analysis 1, 2 2 weeks
Recursion 7 1 week
Lists, Stacks, Queues 3,4,5,6 2 weeks
Midterm 1
Tree Structures 9,10,11 2 weeks
Graphs 13 2 weeks
Midterm 2
Sorting,Searching 8 2 weeks
Heaps,Indexing 11, 12 2 weeks
Final Exam,May 11, 5-7.30pm
Jan. 9, 2010 1 K.R.Subramanian