Contents: CS2

From

Revision as of 16:06, 9 April 2009 (view source) Admin (Talk | contribs) (→Unordered Collections) ← Older edit		Revision as of 16:22, 9 April 2009 (view source) Admin (Talk | contribs) (→Introduction to Computability and Complexity) Newer edit →
Line 9:		Line 9:
	== Introduction to Computability and Complexity ==		== Introduction to Computability and Complexity ==
-	*[[Computability and Complexity|Overview of computability and complexity]] <br/>	+	*[[CS2/Computability and Complexity|Overview of computability and complexity]] <br/>
-	*[[Asymptotic Measures|Asymptotic Measures]] <br/>	+	*[[CS2/Asymptotic Measures|Asymptotic Measures]] <br/>
	*[[Empirical Measures|Empirical Measures]] <br/>		*[[Empirical Measures|Empirical Measures]] <br/>
	<br/>		<br/>

---

Revision as of 16:22, 9 April 2009

This is an online, interactive text for exploring the concepts and topics normally taught in the ACM CS2 course. This online text as of Spring 2009 does have quite a bit of content, but is currently under development and certainly not close to complete.

Contents 1 Data Structures and Abstract Data Types 2 Introduction to Computability and Complexity 3 Algorithms 4 Preliminaries of Data Organization 5 ADTs and Data Structures 5.1 Linear Structures 5.2 Trees 5.3 Graphs 5.4 Unordered Collections

Data Structures and Abstract Data Types

A data structure is a means of organizing data in a computer’s memory to try to optimize either the memory needed or the time to access the data. This brings up the classic trade-off in Computer Science: the trade-off between Time and Space. In most situations today, it seems that we are primarily interested in minimizing the Time aspect. But, given smaller and smaller devices that increasingly do more (think of the evolution of the cell phone), minimizing the Space aspect can be important also.

There is sometimes a difference made between a data structure and an abstract data type (ADT). An ADT describes the public interface of a data structure: the type of data and the valid operations on the data. An ADT, however, does not consider an implementation, and this is the essential difference.

Introduction to Computability and Complexity

• Overview of computability and complexity
  
• Asymptotic Measures
  
• Empirical Measures
  

Algorithms

• Overview of Algorithms and Psuedocode
  
• Seaching
  
• Sorting
  

Preliminaries of Data Organization

• Memory Allocation
  
• Primitive and Composite Structures
  
• Concept of an Element (Node)
  
• Abstract Data Types
  

ADTs and Data Structures

Linear Structures

• Overview of Linear Abstract Data Types
  
• Stacks
  
• Queues
  
• Lists
  

Trees

• Overview of Tree Abstract Data Types
• Binary Trees
  
  • Binary Search Trees
    
  • AVL Trees
    
  • Red-Black Trees
    
  • Splay Trees
    
  • Heaps
    
• Multi-Way Trees
  
  • B-Trees
    
  • B+Trees
    
• General Trees
  

Graphs

• Overview of Graph Abstract Data Types
  
• Representing Graphs
  
• Variations of Graph ADTs
  
• Common Graph Algorithms
  

Unordered Collections

• Overview of Unordered Collection Abstract Data Types
• Sets and MultiSets (Bags)
  
• Maps and Dictionaries
  
• Hash Tables
  

---

---