CIS 5511. Programming Techniques

Section 001. Fall 2026

Syllabus

Instructor

Dr. Pei Wang
Email: pei.wang@temple.edu
Office: Room 347, Science Education and Research Center (SERC)
Office Hours: Tuesday/Thursday 3:30 - 5:00 pm, and by appointment on Zoom

Time and Location

Lecture time: Tuesday 5:30 - 8:00 PM
Classroom: Tuttleman Learning Center 302

Course Description

A more formalized view of data structures. Stacks, trees, tables, lists, multilinked structures, strings and files are considered. These are viewed in terms of their general usefulness in the construction of algorithms and in their efficient implementation. Both theoretical results and programming techniques will be stressed.

Prerequisites

CIS 2168 - Data Structures and CIS 3223 - Data Structures and Algorithms

Textbook

Cormen, Leiserson, Rivest, and Stein. Introduction to Algorithms, 4th Edition, MIT Press, 2022. [Available at Temple Library with a single-user license. The 3rd edition of the book is also acceptable.]

Schedule

http://www.cis.temple.edu/~pwang/5511-PT/5511-index.htm

Grading

Homework

There will be around 10 homework assignments, announced and collected on Canvas. For each assignment, the results should include 3 separate files (do not compress them into a ZIP file):
  1. Report: It is highly recommended to prepare the reports in LaTeX, and to produce them in PDF. Other acceptable formats of reports are HTML, DOC, TXT, and JPG. For any other format, ask for permission in advance. The use of AI tools should be properly acknowledged.
  2. Source code: The preferred programming language is Java, C++, and Python. For any other language, ask for permission in advance. The source code should have proper format and comments.
  3. Sample input/output: they can be in a plain text file or other proper format. Their analysis should be included in the report.
There will be a 10% late penalty on each day after the due date until the problem is explained in the class.

Policies and Rules