Elementary Data Structures

View Resource

Read the Fine Print

Subject:

Science and Technology

Institution Name:

The Saylor Foundation

Collection:

Saylor Foundation

Grade Level:

Post-secondary

Abstract:

In this course, the student will learn the theoretical and practical aspects of algorithms and Data Structures. The student will also learn to implement Data Structures and algorithms in C/C++, analyze those algorithms, and consider both their worst-case complexity and practical efficiency. Upon successful completion of this course, students will be able to: Identify elementary Data Structures using C/C++ programming languages; Analyze the importance and use of Abstract Data Types (ADTs); Design and implement elementary Data Structures such as arrays, trees, Stacks, Queues, and Hash Tables; Explain best, average, and worst-cases of an algorithm using Big-O notation; Describe the differences between the use of sequential and binary search algorithms. (Computer Science 201)

Languages:

English

Material Type:

Assessments, Full Course, Homework and Assignments, Readings, Syllabi, Video Lectures

Media Format:

Graphics/Photos, Text/HTML, Downloadable docs, Video

Conditions of Use:

Creative Commons Attribution-Noncommercial 3.0
You are welcome to share, remix, and adapt this course under the terms of the Creative Commons Attribution 3.0 Unported License; however, many linked materials within this course are copyright of their respective authors/owners and may not be openly-licensed. Please respect the copyright and terms of use associated with each resource.

Copyright Holder:

The Saylor Foundation