Syllabus Entrance
Printer Friendly
Email Syllabus

CS 352 Data Structures
Vargas, Jorge


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.

Course

CS 352 Data Structures

Semester

S1B 2011 BL

Faculty

Vargas, Jorge

Title

Adjunct Faculty

Degrees/Certificates

M.S. Computer Science
M.S. Mathematics

Office Hours

By Appointment

E-Mail

Jorge.Vargas03@park.edu

Semester Dates

1/10/2011 to 3/6/2011

Class Days

-----F-

Class Time

5:00 - 10:00 PM

Credit Hours

3


Textbook:
Data Structures with C++ Using STL, Second Edition, by William Ford and William Topp, ISBN 978-0-13-085850-4

Additional Resources:

McAfee Memorial Library - Online information, links, electronic databases and the Online catalog. Contact the library for further assistance via email or at 800-270-4347.
Career Counseling - The Career Development Center (CDC) provides services for all stages of career development.  The mission of the CDC is to provide the career planning tools to ensure a lifetime of career success.
Park Helpdesk - If you have forgotten your OPEN ID or Password, or need assistance with your PirateMail account, please email helpdesk@park.edu or call 800-927-3024
Resources for Current Students - A great place to look for all kinds of information http://www.park.edu/Current/.


Course Description:
CS352 Data Structures: This course introduces the student to various data structures and advanced algorithmic concepts. Students will put what they learn into practice by using C++ for programming projects. These data structures will be covered: linked lists, stacks,queues, and trees. These concepts will be covered: recursion,searching, sorting and time complexity analysis. Prerequisites: CS208, a grade of "C" or better in CS225. 3:0:3

Educational Philosophy:

Learning Outcomes:
  Core Learning Outcomes

  1. Evaluate and analyze these data structures concepts: *recursion *the Standard Template Library *stacks *queues (including priority queues) *trees (including binary search trees)
  2. Demonstrate creativity and problem-solving skills.
  3. Analyze the efficiency of an algorithm using the Big-O notation.
  4. Appraise C++ programs to ensure that they use proper coding conventions and documentation.
  5. Compare and utilize various sorting algorithms (e.g., selection sort, insertion sort, bubble sort).
  6. Construct various data structures using: *function templates and class templates *pointers *dynamic memory allocation *linked lists (including doubly-linked lists)
  7. Formulate C++ programs that use: *recursion *templates *pointers *dynamic memory allocation *linked lists *stacks *queues *trees
  8. Optional - upon completion of this course the student should be able to write C++ programs that use one or more of these data structures – heaps, b-trees, graphs, hash tables.


  Instructor Learning Outcomes
  1. Describe the characteristics of various data structures.
  2. Describe the advantages and disadvantages of various sorting algorithms.
  3. Be able to implement a recursive solution to a problem.
  4. Be able to select an appropriate data structure given a specific problem.
Core Assessment:

All Park University courses must include a core assessment tool that measures the degree to which students learn the course's learning outcomes. School policy dictates that a student's performance on the core assessment tool must count for at least 20% of the student's total course grade. School policy also dictates that the core assessment tool must cover at least 75% of a course's learning outcomes.

For this course, the core assessment tool is a final exam. Teachers must create their own final exam and pattern it after the CS352 example exam found in the password-protected ICS PirateNet faculty area, https://piratenet.park.edu/ics/Offices/ICS/Faculty.jnz. To avoid collaboration between students in different sections, teachers should not use the example exam's questions verbatim. But teachers are required to cover its same content, and they are strongly encouraged to follow its format closely.

In the final exam, there are two broad categories of questions that we evaluate separately – concepts and problem solving:

Concepts (terminology and concepts that should be memorized): relevant learning outcomes – 1, 3, 5

Multiple-choice and true/false questions that ask the student about CS 352 concepts.

Short answer questions that ask the student to explain various concepts and trace and debug code fragments and/or programs.

For example questions, see the CS352 example exam, questions 1-22.

Problem solving (technical skills, critical thinking, and communication):

relevant learning outcomes –  2, 4, 6, 7

Given a problem description, produce a solution in the form of a short program or a method(s).

For example questions, see the CS352 example exam, questions 23-24.

Recommended guideline for evaluating the core assessment final exam:

Exceeds expectations

Meets expectations

Does not meet expectations

No evidence

Concepts

≥ 85%

65% to 84%

< 65%

no exam graded

Problem solving

≥ 75%

50% to 74%

< 50%

no exam graded

Comprehensive Exam

All Park degree programs are required to have an assessment tool that measures the success of the degree program as a whole. The Information and Computer Science (ICS) degree program uses a comprehensive exam embedded in senior-level courses. CS352 is one of those courses, and, as such, all CS352 students are required to take the ICS comprehensive exam. To ensure student motivation, teachers are required to weight the comprehensive exam by at least 3% of the course’s total grade. The recommended weight is 5%.

Class Assessment:
There will be weekly quizzes starting the second week.  The quizzes will be worth 10% of your final grade and will cover material reviewed up to that point.  There will be 6 quizzes, but only 5 will count towards your final grade.  I will use your top 5 grades.  Quizzes cannot be made-up for any reason.  There will also be weekly programming assignments.  These assignments will count for 30% of your final grade.  In addition to correctness, programming style and documentation will constitute part of the grade. Every assignment will contain a bonus section which will be worth 1% of the final grade as extra credit. A student can accumulate up to 5% of extra credit in the entire term. Two exams will be given, a midterm and a comprehensive final exam. The midterm will count for 20% of your final grade and the final 30% of your final grade. Your participation in class, which also includes attendance and classroom behavior,  will count for the remaining 10% of your final grade.

Grading:
The final grade for the course will be assigned using the following grading scale.


Class Participation: 10%
Quizzes: 10%
Programming Assignments: 30%
Midterm: 20%
Final Exam: 30%
Total: 100%

The letter grade awarded corresponds to the following percent averages.
> 90%: A
80%-89%: B
70%-79%: C
60%-69%: D
< 60%: F

Late Submission of Course Materials:
Programming assignments should be turned in by midnight the day they are due. After the due date, 10% will be deducted for every day the assignment is late, including weekends. Assignments more than 5 days late will not be accepted.

Classroom Rules of Conduct:

Course Topic/Dates/Assignments:
Week 1: Object –Oriented Programming (Chapter 1); Complexity Analysis, Big-O Notation (Chapter 3).
Week 2: Quiz 1. Sorting (Chapter 3).
Week 3: Quiz 2. Recursion (Chapter 3), Linked Lists (Chapter 9).
Week 4: Quiz 3. Midterm. Stacks (Chapter 7), Queues (Chapter 8).
Week 5: Quiz 4. Binary Trees (Chapter 10)
Week 6: Quiz 5. Binary Trees (continued), Heaps (Chapter 14).
Week 7: Quiz 6. Hash tables (Chapter 12), Graphs (Chapter 16)
Week 8: Recursive Algorithms (Chapter 15). Review and Final Exam


Note. The dates above are tentative. I reserve the right to adjust the topics and assignments based on overall class performance.

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 students and faculty members are encouraged to take advantage of the University resources available for learning about academic honesty (www.park.edu/current or http://www.park.edu/faculty/).from Park University 2010-2011 Undergraduate Catalog Page 92
NOTE: You can discuss assignments with others. But any work you submit must be wholly your own. Cheating is not acceptable and will not be tolerated. Any assignment containing source code copied from an external source will automatically receive a zero.

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. from Park University 2010-2011 Undergraduate Catalog Page 92-93

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 "F".
  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 2010-2011 Undergraduate Catalog Page 95-96

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. 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 .

Additional Information:


Bibliography:

Copyright:

This material is protected by copyright and can not be reused without author permission.

Last Updated:12/12/2010 4:12:24 PM