Computer Science 2

General

Prefix

CSCI

Course Number

301

Course Level

Undergraduate

College/School

College of Science and Engineering

Description

Recursion and recurrence. Trees, binary trees, 2/3 trees, directed and undirected graphs, searching and sorting, program layering. Sequential file processing, indexed files, and hashing techniques.

Prerequisites

Credits

Min

4

Max

4

Repeatable

No

Goals and Diversity

MN Goal Course

No

Cultural Diversity

No

Learning Outcomes

Outcome

Design and implement programs that separate the interface from the implementation and use generic components (templates) as a mechanism for re-using code.

Outcome

Design and implement applications that use linear data structures such as linked list, stacks, queues and priority queues.

Outcome

Design and implement applications that use nonlinear data structures such as binary and binary search trees, 2/3 trees, directed and undirected graphs

Outcome

Apply recursive definitions and their relation to the development of algorithms in trees and graphs and perform time complexity analysis of these algorithms

Outcome

Write programs that use complicated sorting techniques.

Outcome

Generate documents that adequately and accurately explain the design, testing, and use of moderately complicated programs.

Outcome

Maintain a record of time allocation and productivity throughout the development and completion of programming projects. Design, carry out, and document tests for programs of moderate complexity.

Dependencies

Courses

CSCI301 is a completion requirement for:
CSCI301 is a prerequisite for:

Programs

CSCI301 is a completion requirement for: