Welcome to the Summer 2019 offering of CSE 247 / 502N: Data Structures and Algorithms!

Course Meetings

Lecture + Studio: MWF 9:30 a.m. - 12:00 p.m. Urbauer 218

Communication via Piazza

The course's Piazza board is the central hub of all communication: announcements from the instructor and TAs, Q&A about assignments, etc. Please direct all questions and communication through Piazza or the "common requests" page on this website; the instructor and TAs may be unable to respond to e-mails sent outside of these mechanisms.

Other Important Links

  • We use Canvas as the official repository for grades.
  • We use Gradescope for turning in lab writeups and returning both these writeups and your exams.
  • See the common requests page for links to make common requests related to class logistics.

Course Description

Study of fundamental algorithms, data structures, and their effective use in a variety of applications. Emphasizes importance of data structure choice and implementation for obtaining the most efficient algorithm for solving a given problem. A key component of this course is worst-case asymptotic analysis, which provides a quick and simple method for determining the scalability and effectiveness of an algorithm. Two evening exams at which attendance is required will be on Wednesdays, February 20th and April 3rd from 6:30-8:30 PM. (Accommodations will be made for those with a religious or medical need to reschedule.) Prerequisite: CSE 131.

Course Prerequisites

Many students are interested in more detail on course prerequisites than can be explained in the course description. Take a look at the CSE 247 prereqs page for a good overview of what you should know going into this course and how to get up to speed if necessary.

Acknowledgments: This course includes materials developed by Dr. Ron Cytron, Dr. Jeremy Buhler, and Dr. Steve Cole. We use an Atlassian Bitbucket academic plan for studio/lab infrastructure.