Print this chapterPrint this chapter

UoPeople Online Syllabus Repository (OSR)

Computer Science

CS 3303 Data Structures

CS 3303 DATA STRUCTURES

Syllabus

Prerequisites: CS 1103 Programming 2

Course Description:

This course introduces the fundamental concepts of data structures and the algorithms that proceed from them. Although this course has a greater focus on theory than application the assignments, examples, and cases introduced throughout the course help to bridge the gap between theoretical concepts and real world problem solving. We will be using a software tool that will enhance our understanding of the operation and function of the data structures and algorithms explored throughout the course by visually animating examples of data structures and algorithms so that we can understand their operation. Key topics within this course will include recursion, fundamental data structures (including stacks, queues, linked lists, hash tables, tress, and graphs), and the basics of algorithmic analysis.

Required Textbook and Materials:

UoPeople courses use open educational resources (OER) and other materials specifically donated to the University with free permissions for educational use. Therefore, students are not required to purchase any textbooks or sign up for any websites that have a cost associated with them. The main required textbooks for this course are listed below, and can be readily accessed using the provided links. There may be additional required/recommended readings, supplemental materials, or other resources and websites necessary for lessons; these will be provided for you in the course's General Information and Forums area, and throughout the term via the weekly course Unit areas and the Learning Guides.

A Practical Introduction to Data Structures and Algorithms Analysis, Edition 3.1 By Clifford A. Shaffer
Copyright © 2009-2011 by Clifford A. Shaffer
Department of Computer Science, Virginia Tech University

Available for download from the course homepage

Data Structures and Algorithms: Annotated Reference with Examples
By Granville Barnett and Luca Del Tongo
Copyright © 2008 by Granville Barnett and Luca Del Tongo
Released to public availability by Dot.NetSlackers

Available for download from the course homepage

Software Requirements/Installation:

Data structures is a course that is steeped in theory. The focus in this course is not on the development of programs but rather understanding basic computer science concepts and as such this course will not require a lot of development with a programming language. This course does, however, present the implementation of data structures and basic algorithms through the use of pseudo code and java code. Several examples of algorithms will be implemented using Java programming and then animated and visualized with the Jeliot tool (http://cs.joensuu.fi/jeliot/downloads/jeliot372.php). Jeliot can be executed directly form a Java enabled browser (including Google Chrome, Windows Internet Explorer, and Mozilla Firefox).

Due to issues with the Jeliot tool, some students may find it easier or necessary to use Eclipse for the Assignments. Eclipse comes in two versions, a Cloud environment named Orion and a Desktop environment named Neon.  Either can be used to complete assignments.  Both version can be found at the following link: http://www.eclipse.org/downloads/. One caveat, the Eclipse software versions and packages are constantly updated, the onus is on the student to stay current. Support can be found via Eclipse message boards and through Google.

Learning Objectives and Outcomes:

By the end of this course students will be able to:

  1. Implement basic data structures and algorithms using the Java language.
  2. Select the appropriate data structure or algorithm to solve a problem.
  3. Apply methods of performance evaluation including asymptotic analysis, to assess data structures and associated algorithms.
  4. Develop an understanding of standard data structures, including lists, stacks, queues, binary search trees, and hash tables and be able to articulate the characteristics and operation of each.

Course Schedule and Topics:

This course will cover the following topics in eight learning sessions, with one Unit per week. The Final Exam will take place during Week/Unit 9 (UoPeople time).

Week 1: Unit 1– Introduction to Data Structures and Algorithms

Week 2: Unit 2- Algorithm Analysis

Week 3: Unit 3– Lists, Stacks, Queues, and Dictionaries

Week 4: Unit 4– Binary trees

Week 5: Unit 5 – Non-binary Trees

Week 6: Unit 6- Internal Sorting techniques and algorithms

Week 7: Unit 7- File Processing and external sorting

Week 8: Unit 8- Searching and indexing techniques and algorithms

Week 9: Unit 9-  Review Final Exam

Learning Guide :

The following is an outline of how this course will be conducted, with suggested best practices for students.

Unit 1: Introduction to Data Structures and Algorithms

  • Read the Learning Guide and Reading Assignments
  • Participate in the Discussion Assignment (post, comment, and rate in the Discussion Forum)
  • Make entries to the Learning Journal
  • Take the Self-Quiz

Unit 2: Algorithm Analysis

  • Read the Learning Guide and Reading Assignments
  • Participate in the Discussion Assignment (post, comment, and rate in the Discussion Forum)
  • Make entries to the Learning Journal
  • Take the Self-Quiz
  • Optionally watch the online video lectures on Asymptotic Analysis presented at MIT

Unit 3: Lists, Stacks, Queues, and Dictionaries

  • Read the Learning Guide and Reading Assignments
  • Participate in the Discussion Assignment (post, comment, and rate in the Discussion Forum)
  • Complete and submit the Programming Assignment
  • Make entries to the Learning Journal
  • Take the Self-Quiz


Unit 4: Binary Trees

  • Peer assess the Unit 3 assignment
  • Read the Learning Guide and Reading Assignments
  • Participate in the Discussion Assignment (post, comment, and rate in the Discussion Forum)
  • Complete and submit the Programming Assignment
  • Make entries to the Learning Journal
  • Take the Self-Quiz


Unit 5: Non-Binary Trees

  • Peer assess the Unit 4 assignment
  • Read the Learning Guide and Reading Assignments
  • Participate in the Discussion Assignment (post, comment, and rate in the Discussion Forum)
  • Make entries to the Learning Journal
  • Take the Self-Quiz
  • Take the Graded Quiz

Unit 6: Internal Sorting techniques and algorithms

  • Read the Learning Guide and Reading Assignments
  • Participate in the Discussion Assignment (post, comment, and rate in the Discussion Forum)
  • Complete and submit the Programming Assignment
  • Make entries to the Learning Journal
  • Take the Self-Quiz 

Unit 7: File processing and external sorting

  • Peer assess the Unit 6 assignment
  • Read the Learning Guide and Reading Assignments
  • Participate in the Discussion Assignment (post, comment, and rate in the Discussion Forum)
  • Make entries to the Learning Journal
  • Take the Self-Quiz

Unit 8: Searching and Indexing Techniques and Algorithms

  • Read the Learning Guide and Reading Assignments
  • Participate in the Discussion Assignment (post, comment, and rate in the Discussion Forum)
  • Make entries to the Learning Journal
  • Take the Self-Quiz
  • Read the Unit 9 Learning Guide carefully for instructions on the Final Exam
  • Take the Review Quiz

Unit 9: Course Review and Final Exam

  • Read the Learning Guide and take the Review Quiz, if you haven't already done so
  • Prepare for, take, and submit the Final Exam
  • The Final Exam will take place during the Thursday and Sunday of Week/Unit 9 (UoPeople time); exact dates, times, and other details will be provided accordingly by your instructor

 

Course Requirements:

Assignments & Assessment Forms

Some units in this course require that you complete a Written Assignment. You are required to submit your assignments by the indicated deadlines and, in addition, to peer assess three (3) of your classmates’ assignments according to the instructions found in the Assessment Form, which is provided to you during the following week. During this peer assessment period, you are expected to provide details in the feedback section of the Assessment Form, indicating why you awarded the grade that you did to your peer. Failure to submit Written Assignments and/or Assessment Forms may result in failure of the course.

Discussion Assignments & Response Posts/Ratings

Some units in this course require that you complete a Discussion Assignment. You are required to develop and post a substantive response to the Discussion Assignment in the Discussion Forum. A substantive response is one that fully answers the question that has been posed by the instructor. In addition, you must extend the discussion by responding to at least three (3) of your peers’ postings in the Discussion Forum and by rating their posts. Instructions for proper posting and rating are provided inside the Discussion Forum for each week. Discussion Forums are only active for each current and relevant learning week, so it is not possible to contribute to the forum once the learning week has come to an end. Failure to participate in the Discussion Assignment by posting in the Discussion Forum and responding to peers as required may result in failure of the course.

Learning Journal

Your instructor may choose to assign specific topics and/or relevant questions as a weekly Learning Journal entry for you to complete, but you are still encouraged to also use it to document your activities, record questions/problems you may have encountered, reflect on the learning process, and draft answers for other course assignments. The Learning Journal must be updated on a weekly basis, because its entries will be assessed by your instructor directly as a part of your final grade. The Learning Journal will only be seen by your instructor.

Quizzes

This course will contain three types of quizzes – the Self-Quiz, the Graded Quiz, and the Review Quiz. These quizzes may contain multiple choice, true/false, or short answer questions. The results of the Self-Quiz will not count towards your final grade. However, it is highly recommended that you complete the Self-Quiz to ensure that you have adequately understood the course materials. Along with the Reading Assignments, the results of the Self-Quiz should be used as part of an iterative learning process, to thoroughly cover and test your understanding of course material. You should use the results of your Self-Quiz as a guide to go back and review relevant sections of the Reading Assignments. Likewise, the Review Quiz will not count towards your final grade, but should also be used to assist you in a comprehensive review and full understanding of all course material, in preparation for your Final Exam. Lastly, the results of the Graded Quiz will count towards your final grade. 

Final Exam

The Final Exam will take place during the Thursday and Sunday of Week/Unit 9, following the completion of eight units of work. The format of the Final Exam is similar to that of the quizzes, and may contain a combination of different question types. You will have one attempt to take the exam, and it will be graded electronically. Specific instructions on how to prepare for and take the Final Exam will be provided during Week 8 (located inside the Unit 9 Learning Guide). Final Exams must be taken without the use of course learning materials (both those inside and outside the course). If particular materials are allowed for use during the exam, these will be noted in the exam’s instructions.

The Final Exam for this course must be done under the supervision of a proctor. Since you already secured your proctor before registering for this course, this is a reminder that you should coordinate with him/her before you take the exam. As a reminder, students are required to successfully complete proctored exams spaced throughout their program of study at UoPeople, in order to verify the student’s identity in confirming a degree and diploma upon graduation.

Calculator use: Students are allowed to use pen and blank paper for doing calculations. Students can use a basic or scientific calculator for the final exam. Calculators on the cell phone, iPad or similar devices are not allowed.

Course Forum The Course Forum is the place to raise issues and questions relating to the course. It is regularly monitored by the instructors, and is a good place to meet fellow students taking the same course. While it is not required to participate in the Course Forum, it is highly recommended.

Course Policies:

Grading Components and Weights Each graded component of the course will contribute some percentage to the final grading scale, as indicated here:Each graded component of the course will contribute some percentage to the final grading scale, as indicated here:

Discussion Assignments 20%
Written Assignments 20%
Learning Journals 10%
Graded Quiz 20%
Final Exam 30%
TOTAL 100%

Grading Scale This course will follow the standard 100-point grading scale defined by the University of the People, as indicated here:

Letter Grade Grade Scale Grade Points
A+ 98-100 4.00
A 93-97 4.00
A- 90-92 3.67
B+ 88-89 3.33
B 83-87 3.00
B- 80-82 2.67
C+ 78-79 2.33
C 73-77 2.00
C- 70-72 1.67
D+ 68-69 1.33
D 63-67 1.00
D- 60-62 0.67
F Under 60 0.00

Grade Appeal If you believe that the final grade you received for a course is erroneous, unjust, or unfair, please contact your course instructor. This must be done within seven days of the posted final grade. For more information on this topic, please review the Grade Appeal Procedure in the University Catalog.

Participation Non-participation is characterized by lack of any assignment submissions, inadequate contributions to the Discussion Forums, and/or lack of peer feedback to Discussion/Written Assignments. Also, please note the following important points about course participation:

  • Assignments must be submitted on or before the specified deadline. A course timeline is provided in the course schedule, and the instructor will specify deadlines for each assignment.
  • Any student showing non-participation for two weeks (consecutive or non-consecutive) is likely to automatically fail the course.
  • Occasionally there may be a legitimate reason for submitting an assignment late. Most of the time, late assignments will not be accepted and there will be no make-up assignments.
  • All students are obligated to inform their instructor in advance of any known absences which may result in their non-participation.

Academic Honesty and Integrity When you submit any work that requires research and writing, it is essential to cite and reference all source material. Failure to properly acknowledge your sources is known as “plagiarism” – which is effectively passing off an individual’s words or ideas as your own. University of the People adheres to a strict policy of academic honesty and integrity. Failure to comply with these guidelines may result in sanctions by the University, including dismissal from the University or course failure. For more information on this topic, please review the Academic Integrity Policy in the University Catalog.

Unless otherwise stated, any materials cited in this course should be referenced using the style guidelines established by the American Psychological Association (APA). The APA format is widely used in colleges and universities across the world and is one of several style and citation formats required for publication in professional and academic journals. Purdue University’s Online Writing LAB (OWL) is a free website that provides excellent information and resources for understanding and using the APA format and style. The OWL website can be accessed here: https://owl.purdue.edu/owl/purdue_owl.html

Code of Conduct University of the People expects that students conduct themselves in a respectful, collaborative, and honest manner at all times. Harassment, threatening behavior, or deliberate embarrassment of others will not be permitted. Any conduct that interferes with the quality of the educational experience is not allowed and may result in disciplinary action, such as course failure, probation, suspension, or dismissal. For more information on this topic, please review the Code of Conduct Policy in the University Catalog.