INFORMATION TECHNOLOGY EDUCATION PROGRAMMING & ANALYSIS COURSE SYLLABUS Course Title and Number: Instructor: Data Structures Debbie Reid COP2535 all sections Year and Term: Course Credits: Office Location: Spring 2017 03 N-210 Office Phone: Office Hours: Location: (352)395-4402 See instructor web page Section 0M1: online section no – campus requirement Meeting Time/Days: Email Address: N/A debbie.reid@sfcollege.edu Web Page Address: Fax Number: 352.395.4154 Course Description This course will focus on the design and analysis of data structures and the use of algorithms. Through the introduction of the most widely used data structures employed in solving commonly encountered problems, such as linked lists, binary trees, queues, and stacks, students will learn different ways to organize data for easy access and efficient manipulation. Algorithms to solve classic problems, such as searching, sorting, hashing, and graph algorithms will also be presented. This course assumes the student has a basic understanding of object-oriented programming in the C++ or Java programming language. Prerequisites COP2000 with a grade of C or higher. Course Objectives Reflecting Expected Understand the of software design Describe and utilize an ADT Student Learning Use unsorted lists to implement utility routines Outcomes Use sorted lists using an array-based implementation Understand and implement operations Demonstrate the effect of operations Implement linked lists as an array of records Demonstrate how a binary tree can be represented in an Implement a heap in a nonlinked tree representation in an array Compare the efficiency of the sorting and searching algorithms
INFORMATION TECHNOLOGY EDUCATION PROGRAMMING & ANALYSIS COURSE SYLLABUS Course Title and Number: Data Structures COP2535 all sections Instructor: Debbie Reid Year and Term: Spring 2017 Course Credits: 03 Office Location: N-210 Office Phone: (352)395-4402 Office Hours: See instructor web page Location: Section 0M1: online section – no campus requirement Meeting Time/Days: N/A Email Address: debbie.reid@sfcollege.edu Web Page Address: Fax Number: 352.395.4154 Course Description This course will focus on the design and analysis of data structures and the use of algorithms. Through the introduction of the most widely used data structures employed in solving commonly encountered problems, such as linked lists, binary trees, queues, and stacks, students will learn different ways to organize data for easy access and efficient manipulation. Algorithms to solve classic problems, such as searching, sorting, hashing, and graph algorithms will also be presented. This course assumes the student has a basic understanding of object-oriented programming in the C++ or Java programming language. Prerequisites COP2000 with a grade of C or higher. Course Objectives Reflecting Expected Student Learning Outcomes Understand the of software design Describe and utilize an ADT Use unsorted lists to implement utility routines Use sorted lists using an array-based implementation Understand and implement operations Demonstrate the effect of operations Implement linked lists as an array of records Demonstrate how a binary tree can be represented in an Implement a heap in a nonlinked tree representation in an array Compare the efficiency of the sorting and searching algorithms