This course covers the organization of data and the algorithms that act upon them. The topics of arrays, linked lists, stacks, queues, trees, sets, and hash tables are introduced. Fundamentals of algorithm performance are also introduced, with an emphasis placed on time complexity analysis. Laboratory activities include implementation of data structures as well as the application of data structures from standard libraries. (prereq: SE1021) (324) OutcomesOn successful completion of this course, the student will:
The above course description and goals were taken from the official course description. General Course PoliciesPlease review the general course policies webpage. TextbookData Structures Abstraction and Design Using Java 2^{nd} Ed., by Koffman and Wolfgang, Wiley, 2010. ISBN: 9780470128701 QuizzesQuizzes will be given nearly every at the beginning of lab. The lowest quiz score will be dropped. No makeup quizzes will be given. LaboratoryAll Lab assignments are worth 100 points per week (i.e., a two week lab assignment is worth 200 points). HomeworkHomework assignments will not be graded however, you are expected to complete them by the given due dates. Homework may consist of watching screencasts, assigned reading, completing online surveys, writing code, etc. AttendanceThis class follows my general attendance policy with the following addition: There may be days where students will not be allowed to attend class unless they have completed an optional homework assignment. My Schedule
Please send me a calendar invite in Outlook if you would like to meet during my office hours. We can meet via a Teams Meeting. Grading
