CSCI 271 Syllabus

CSCI 271

Data Structures & Algorithm Analysis

Syllabus

Fall 2018

Instructor: Will Thacker

Office: 323 Thurmond

Office Hours: 2-3:15 MTWR, 9:30-10:45 WF

Office Phone: 323-2691

E-mail: thackerw@winthrop.edu

Course Web Page: faculty.winthrop.edu/thackerw/csci271

Prerequisites: A grade of C- or better in all of CSCI 208, Discrete Mathematics (Math 261) and Calculus (Math 201).

Texts:

Data Structures & Algorithm Analysis, Shaffer, Dover Publications, 2013, Online Version: http://people.cs.vt.edu/~shaffer/Book/C++3elatest.pdf

Attendance: Attendance will not be taken. You are expected to attend each and every class. There will be no formal relationship between grade and attendance. However, of course, there is the informal relationship that always exists. You are responsible for the material covered in the classes you miss.

Objectives: Study the structure of data and the efficient manipulation of such structure. Algorithm analysis and design and the appropriate use of recursion are emphasized.

Topics Covered: Lists, Stacks, Queues, Trees, Priority Queues, Graphs, Hashing, Sorting, Graph Algorithms, Algorithm Analysis, Algorithm Design techniques. Appropriate C++ implementation of such structures.