CSE 214, Data Structures, Fall 2019

CSE 214 is an introduction to data structures and algorithms, and an extension of programming methodology to data storage and manipulation of complex data sets. Topics include: programming and applications of data structures; stacks, queues, lists, binary trees, heaps, priority queues, balanced trees and graphs. Recursive programming is heavily utilized. Fundamental sorting and searching algorithms are examined along with informal efficiency comparisons.

CSE 114 or equivalent is a prerequisite for this course and we will assume you have knowledge of Java and object-oriented programming.

Details

Time:	Tues/Thurs 4:00 pm - 5:20 pm
Place:	Javits Lecture Hall 111
Lecturer:	Tim Barron
Office Hours:	NCS 358, Mon 3:00pm - 4:00pm, Wed 4:00pm - 5:00pm, or by appointment
Contact:	Important: When sending me an email about the course, make sure your title starts with [CSE 214]. Mislabeled or unlabeled emails will, most likely, not be read.
Teaching Assistants:	Names and office hours on Piazza

Piazza

https://piazza.com/stonybrook/fall2019/cse21402/home

Course communication will be handled through Piazza. You are responsible for checking piazza for announcements. Rather than using email, we encourage you to make use of this space to discuss the course with classmates and ask questions of the instructors. You may not post answers for any assignment, recitation or exam, in whole or in part. You may ask for assistance or provide assistance with homework problems (with respect to understanding what you are required to do), specific language syntax, compilation errors, program environments, topics discussed in class or in your textbook, and other course related matters. You are asked to treat each other with respect. Please do not post or respond with derogatory remarks, or these remarks will be removed at the instructor's discretion.

Textbook

A textbook is not required for this course. However, for those who are looking for additional resources, this is the book I am using.

• Data Structures & Algorithms 5th Edition, Goodrich & Tamassia

Requirements and Grading

Subject to minor tweaks throughout the semester.

10%	Participation	Attending and participating in recitations
40%	Homework	Programming assignments to be completed and submitted individually
15%	Midterm exam 1	Date: October 17th
15%	Midterm exam 2	Date: November 21st
20%	Final exam	Final Exam on everything covered in this class Date: December 17th

Students with disabilities

If you have a physical, psychological, medical or learning disability that may impact on your ability to carry out assigned course work, please contact the staff in the Student Accessibility Support Center, Room 128, Educational Communications Center (ECC), 631-632-6748. The center will review your concerns and determine with you what accommodations are necessary and appropriate. All information and documentation of disability are confidential. For more information, please visit their website: https://www.stonybrook.edu/commcms/studentaffairs/sasc/

Academic Integrity

Each student must pursue his or her academic goals honestly and be personally accountable for all submitted work. Representing another person's work as your own is always wrong. Any suspected instance of academic dishonesty will be reported to the Academic Judiciary. For more comprehensive information on academic integrity, including categories of academic dishonesty, please refer to the academic judiciary website at http://www.stonybrook.edu/uaa/academicjudiciary/.