Syllabus

• Instructor: Linh B. Ngo
• Office: UNA 138
• Office Hours:
  • Monday and Wednesday: 1:00PM - 3:00PM
  • Tuesday and Thursday: 11:00AM - 12:30PM
• Email: lngo AT wcupa DOT edu
• Phone: 610-436-2595

Course Information

• The course runs from August 26, 2024 until December 09, 2024. It is an in-person course.

Required Materials:

• You are expected to be comfortable with programming and to be familiar with fundamental concepts such as recursion, list, stack, and queues. We will spend one to two weeks reviewing these concepts.

• There is no required textbook for the course. Reading materials will be provided.

Recommended References:

• Open Data Structures by Pat Morin

Course Description

Data structures are essential building blocks in obtaining efficient algorithms. This course aims to introduce students to advanced data structure concepts, including geometry (multi-dimensional data structures), dynamic optimality, memory hierarchy, hash, integers, dynamic graphs, strings, and succinct.

Learning Objectives

Course Student Learning Outcomes (CSLO)

1. Understand definitions and tradeoffs of advanced data structures.
2. Be able to implement, in a programming language of choice, these advanced data structures.

MS in CS Program Objectives (CSPO):

1. Be well prepared to enter a career.
2. Be exposed to the latest, cutting-edge technology.

Assessments and Grading:

Method of Evaluation

Grade Scale:

D grades are not used. Refer to the Graduate Catalog for description of NG (No Grade), W, & other grades.

Assessments:

• Assignments: Be able to understand and implement complete software program based on pseudocode.
• Presentation: Be able to read and understand research papers on advanced data structures.
• Partition: A mixture of attendance check and degree of participation in class discussion

Lateness Policy:

Assignments that are late are assessed a 10% per day late penalty. Saturday and Sunday are each days.

{!assets/text/policy.md!}

Course Topics and Schedules (subject to change)