CS - CS1332DataStructuresandAlgorithms...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
CS1332 – Data Structures and Algorithms Course Learning Objectives Purpose:  CS1332 provides an overview of basic data structures and algorithms on those  structures.  Searching, Sorting, linear, non-linear and randomized structures are  covered.  Students are expected to understand these structures and algorithms,  to implement them in a programming language – but not to prove properties  about them.  Specific named algorithms and examples can vary by instructor. Outcomes: (Competency - Application) Apply knowledge of basic complexity (Big – O) to  calculate the runtime or space requirements of an algorithm/data structure given  the actual source code or pseudo-code. (Competency – Analysis) Differentiate between the common linear data  structures (list, array, set, bag, stack and queue).  Student will select and  implement the correct structure to use for any given situation. (Competency – Analysis) Differentiate between the common non-linear data 
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 09/07/2011 for the course CS 1332 taught by Professor Lebanon during the Spring '08 term at Georgia Institute of Technology.

Page1 / 2

CS - CS1332DataStructuresandAlgorithms...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online