Data Structures for Information Systems – CSE214

---

Instructor: Nicoleta Roman

Office: Galvin Hall 460E   Phone: 419-995-8224

Email address: roman.45@osu.edu

Instructor Website: lima.osu.edu/people/nroman

Description

Subroutines and modular programming; searching; basic data structures; recursion; introduction to sequential files.

The course is worth 4 credits.

Prerequisites

CSE201.

Course Objectives

• Be familiar with modular design and structured programming techniques.
• Be familiar with commonly used data structures.
• Be familiar with how to design and implement abstract data types.
• Be familiar with sequential file I/O.

Textbooks

Lecture Notes – Instructor

Representative Topics List

Number of Hours	Topic
8	Object-oriented programming
4	Recursion
8	Sorting and binary search
6	Linked lists
3	Stacks
3	Queues
4	Binary trees
4	Quizzes, exams, and review

Lab Assignments

• Manipulating strings and file I/O
• Towers of Hanoi using recursion
• Sorting and recursion
• Linked lists and databases
• Trees and traversals

Grading Plan

Midterm Exam	20%
Final Exam	35%
Homework Assignments	10%
Lab Assignments	25%
Quizzes	10%

Important Note: A passing grade on the final exam is required in order to receive a passing grade for the course.