East Carolina University
Department of Computer Science

CSCI 3200
Data Structures and Their Applications
Standard Syllabus

Catalog entry

Common data structures and how to use them in advanced problem solving.

Course summary

Course topics

• Fundamental concepts of object-oriented programming, including inheritance, polymorphism, dynamic binding, abstract classes, generic data types, and recursion.
• Abstract data types, including lists, stack, queues, trees, and additional abstract data types of instsructor's choosing, such as tables, graphs, maps, and sets.
• Developing algorithms which use data structures to solve problems. Various sorting algorithms and comparisons.
• Building, testing and debugging programs.

Student learning outcomes

• Explain and use fundamental data structures in common programming tasks, including lists, stacks, queues, trees, and other ADTs such as graphs, tables, and sets.
• Choose the appropriate abstract data structure for a given computational problem.
• Explain how different data structures influence the efficiency of the algorithms which use them.
• Employ programming language principles, including recursion, to develop algorithms.
• Implement multimodular program(s) that involve the use of abstract data types from the Java API.

Textbook

Grading

Grading will be based on a midterm, a final exam, assignments, and quizzes. The midterm exam counts 25%, final exam 30%, assignments and quizzes 45%.

Grade cutoffs are 94% for an A, 90% for an A-, 87% for a B+, 83% for a B, 80% for a B-, 77% for a C+, 73% for a C, 70% for a C-, 67% for a D+, 63 for a D, 60% for a D-, below 60% for a F.

Grade meanings