Course Description
CSE 214 is an extension of programming methodology to data storage and manipulation on 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
Prerequisite: C or higher in CSE114.
Course Objectives
Students who successfully complete this course will be able to demonstrate:
An ability to program using sophisticated features of object oriented programming.
An ability to define and use data types, and use data structures.
An understanding of the importance of time and memory efficiency in algorithm design.
Textbook and Required Materials:
Michael Main, Data Structures and Other Objects Using Java (Addison Wesley, Fourth ed. 2012)
Stephen Kochan, Programming in C (Sams, Pearson Education, Third ed. 2005.)
Supplementary Material: Frank Carrano and Janet Prichard, Data Abstraction and Problem Solving with Java (Addison Wesley, Second ed., 2006).
Lecture Meetings :
Monday, Wednesday, 2:40 PM –4:00 PM (online synchronously using zoom).
Academic Integrity Policy
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. Faculty are required to report any suspected instances of academic dishonesty 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/commcms/academic_integrity/index.html
Students found guilty of academic dishonesty will automatically receive a final grade of 'F' for the course.