CSC 103 - Introduction to Data Structures
An introduction to basic data structures, and a continuation of CSC 101 for Computer Science majors. Topics include sequential lists, linked lists, stacks, queues, recursion, binary trees, searching and sorting. Other topics include algorithm analysis and design, inheritance, polymorphism. An object oriented language such as Java will be used to implement algorithm and further develop general programming skills. Students will be required to complete several programming projects outside of class. Three class hours, two laboratory hours.
Prerequisite: CSC 101 with a grade of C or better.
Course Learning Outcomes
1. Create the following Abstract Data Types using a computer programming language: Sequential List, Linked List, Stack, Queue, Tree, and Binary Tree.
2. Design and develop a computer programming language solution to a problem using the appropriate Abstract Data Type.
3. Evaluate the computing time analysis (complexity) of an algorithm written in a computer programming language using Big-O Notation.
4. Develop and Evaluate using Big-O Notation, Searching and Sorting Algorithms
Course Offered Fall and Spring