Syllabus Entrance
Printer Friendly
Email Syllabus

CS 352 Data Structures
Wu, Ping


Mission Statement: The mission of Park University, an entrepreneurial institution of learning, is to provide access to academic excellence, which will prepare learners to think critically, communicate effectively and engage in lifelong learning while serving a global community.

Vision Statement: Park University will be a renowned international leader in providing innovative educational opportunities for learners within the global society.
CourseCS 352 Data Structures BE
SemesterS2A2005
FacultyWu, Ping
TitleProfessor of Computer Science
Degrees/CertificatesPh.D., University of Florida
M.S.,  University of Florida
Office LocationAustin Center
Office HoursTuesday and Thursday: 9:00am – 1:00pm
E-Mailping.wu@park.edu
Semester DatesMarch 14 – May 08, 2004
Class Days--T-R--
Class Time8:00 - 10:30 PM
PerquisitesCS 208, a grade of “C” or better in CS 225
Credit Hours3

Textbook:
“Data Structures and Algorithms in C++” by Adam Drozdek, Brooks/Cole, Thomson Learning, 2001, Second Edition.

Textbooks can be purchased though the MBS bookstore


Course Description:
This course introduces the student to various data structures and advanced algorithmic concepts.   These concepts will be put into practice using C++ for programming projects.  These data structures will be covered: stacks, trees, graphs, queues, linked lists.  These concepts will be covered: recursion, sorting, searching, hashing.  Space and time complexities of algorithms will be analyzed.  Pre-requisites: CS219. 3:0:3

Educational Philosophy:
The instructor's educational philosophy is one of interactiveness based on lectures, readings, quizzes, dialogues, examinations, Internet, videos, web sites, and creative writings. The instructor will engage each learner in what is referred to as disputatious learning to encourage the lively exploration of ideas, issues, and contradictions. Helping students to develop life-long learning skill is the goal of education.

Learning Outcomes:
The main goal of the course is to provide the student with an understanding of data structures and advanced algorithmic concepts, and the ability to demonstrate creativity and problem-solving skills in C++. On completion of this course, the student should be able to

  1. Explain the basic data structures (stacks, queues, trees, graphs, linked lists);
  2. Explain the advantages and disadvantages of each of the basic data structures;
  3. Understand and implement the algorithmic concepts associated with the data structures;
  4. Demonstrate creativity and problem-solving skills;
  5. Use the Visual C++ .NET integrated development environment (IDE) to enter, run, and debug C++ programs;
  6. Implement the data structures in C++ programs with proper style and documentation;
  7. Demonstrate proper use of the object-oriented principles (inheritance and composition) in C++ programs.

Course Assessment:
Required readings, homework assignments, examinations, C++ programming assignments.

Grading:
Make-up examinations must be scheduled prior to the date of the examination. The final grade will be determined as follows:

Homework Assignments      15%
Programming Assignments   30%
Midterm Exam              25%
Midterm Exam              25%

A = 100 – 90
B =   89 – 80
C =   79 – 70
D =   69 – 60
F = below 60

Late Submission of Course Materials:
Assignments are due on the due date, no credit for late assignments.

Classroom Rules of Conduct:
Students are expected to be courteous to each other and behave professionally. Each student is expected to complete all reading assignments prior to class and be prepared to participate in all class activities and discussions.

Add/Drop Deadline:
March 21, 2005

Last Day to Withdraw:
April 17, 2005

Course Topics/Dates/Assignments:

Chapter / Topics Date
Class policies; Introduction to the course;
Description of programming assignments and examinations;
Chapter 1: Object-Oriented Programming Using C++
Mar. 15
Chapter 2: Complexity AnalysisMar. 17
Chapter 3: Linked List
Programming Assignment #1
Mar. 22
Chapter 4: Stacks and QueuesMar. 24
Chapter 5: RecursionMar. 29
Chapter 6: Binary Trees  (Part 1)
Programming Assignment #1 Due;
Programming Assignment #2;
Mar. 31
Chapter 6: Binary Trees (Part 2)Apr. 5
Chapter 7: Multiway TreesApr. 7
Midterm ExamApr. 12
Chapter 8: Graphs (Part 1)
Programming Assignment #2 Due;
Programming Assignment #3
Apr. 14
Chapter 8: Graphs (Part 2)Apr. 19
Chapter 9: SortingApr. 21
Chapter 10: Hashing
Programming Assignment #3 Due
Apr. 26
Chapter 11: Data CompressionApr. 28
Chapter 12: Memory ManagementMay 3
Final ExamMay 5

Academic Honesty:
Academic integrity is the foundation of the academic community. Because each student has the primary responsibility for being academically honest, students are advised to read and understand all sections of this policy relating to standards of conduct and academic life.  
Park University 2004-2005 Undergraduate Catalog
Page 101

Plagiarism:
Plagiarism involves the use of quotations without quotation marks, the use of quotations without indication of the source, the use of another's idea without acknowledging the source, the submission of a paper, laboratory report, project, or class assignment (any portion of such) prepared by another person, or incorrect paraphrasing. <a href="http://www.park.edu/catalog">
Park University 2004-2005 Undergraduate Catalog</a> Page 101

Attendance Policy:
Instructors are required to maintain attendance records and to report absences via the online attendance reporting system.

  1. The instructor may excuse absences for valid reasons, but missed work must be made up within the semester/term of enrollment.
  2. Work missed through unexcused absences must also be made up within the semester/term of enrollment, but unexcused absences may carry further penalties.
  3. In the event of two consecutive weeks of unexcused absences in a semester/term of enrollment, the student will be administratively withdrawn, resulting in a grade of "WH".
  4. A "Contract for Incomplete" will not be issued to a student who has unexcused or excessive absences recorded for a course.
  5. Students receiving Military Tuition Assistance or Veterans Administration educational benefits must not exceed three unexcused absences in the semester/term of enrollment. Excessive absences will be reported to the appropriate agency and may result in a monetary penalty to the student.
  6. Report of a "F" grade (attendance or academic) resulting from excessive absence for those students who are receiving financial assistance from agencies not mentioned in item 5 above will be reported to the appropriate agency.

Park University 2004-2005 Undergraduate Catalog Page 100

Disability Guidelines:

Park University is committed to meeting the needs of all students that meet the criteria for special assistance. These guidelines are designed to supply directions to students concerning the information necessary to accomplish this goal. It is Park University's policy to comply fully with federal and state law, including Section 504 of the Rehabilitation Act of 1973 and the Americans with Disabilities Act of 1990, regarding students with disabilities. In the case of any inconsistency between these guidelines and federal and/or state law, the provisions of the law will apply. Park University is committed to meeting the needs of all learners that meet the criteria for special assistance. These guidelines are designed to supply directions to learners concerning the information necessary to accomplish this goal. It is Park University's policy to comply fully with federal and state law, including Section 504 of the Rehabilitation Act of 1973 and the American with Disabilities Act of 1990, regarding learners with disabilities and, to the extent of any inconsistency between these guidelines and federal and/or state law, the provisions of the law will apply. Additional information concerning Park University's policies and procedures related to disability can be found on the Park University web page:
http://www.park.edu/disability
 
.

Copyright:
This material is copyrightted and cannot be reused without the author's permission.