Contents: CS2

From

(Difference between revisions)
Jump to: navigation, search
m (Data Structures and Abstract Data Types)
 
(63 intermediate revisions not shown)
Line 1: Line 1:
-
Introduction (needs to be written)
+
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. [[Credits to the primary content contributors]]
-
== Data Structures ==
+
== 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
+
A data structure is a means of organizing data in a computer’s memory to try to optimize either the memory usage 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.
-
(ADT). An ADT describes the public interface of a data structure: the type of data and the
+
<br/><br/>
-
valid operations on the data. An ADT, however, does not consider an implementation, and
+
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.
-
this is the essential difference.
+
<br/><br/>
-
== Introdution to Data Structures, Algorithms, and Complexity ==
+
== Introduction to Computability and Complexity ==
 +
*[[Computability and Complexity|Overview of computability and complexity]] <br/>
 +
*[[Asymptotic Measures|Asymptotic Measures]] <br/>
 +
*[[CS2/Empirical Measures|Empirical Measures]] <br/>
 +
<br/>
-
*[[/index.php/Memory Allocation|Memory Allocation]]  
+
== Algorithms ==
-
*[[/index.php/Asymptotic Measures|Asymptotic Measures]]  
+
*[[Algorithms and Psuedocode|Overview of Algorithms and Psuedocode]] <br/>
-
*Algorithms
+
*[[Searching|Seaching]] <br/>
 +
*[[Sorting|Sorting]] <br/>
 +
<br/>
-
#[[/index.php/Searching|Seaching]]  
+
== Preliminaries of Data Organization ==
-
#[[/index.php/Sorting|Sorting]]
+
*[[Memory Allocation|Memory Allocation]] <br/>
 +
*[[Primitive and Composite Structures]]  <br/>
 +
*[[Concept of an Element (Node)|Concept of an Element (Node)]]  <br/>
 +
*[[Abstract Data Types|Abstract Data Types]] <br/>
 +
<br/>
-
*[[/index.php/Primitive Structures|Primitive Structures]]  
+
== ADTs and Data Structures ==
-
*[[Concept of an Element (Node)|Concept of an Element (Node)]]  
+
===Linear Structures===
-
*[[Abstract Data Types|Abstract Data Types]]  
+
*[[Linear ADTs|Overview of Linear Abstract Data Types]] <br/>
-
*Linear Structures
+
*[[Stacks|Stacks]] <br/> 
 +
*[[Queues|Queues]] <br/>
 +
*[[Lists|Lists]] <br/>
-
#[[Lists|Lists]]  
+
===Trees===
-
#[[Stacks|Stacks]]  
+
*[[Tree ADTs|Overview of Tree Abstract Data Types]]
-
#[[Queues|Queues]]
+
*[[Binary Trees|Binary Trees]] <br/> 
 +
**[[Binary Search Trees]]  <br/>
 +
**[[AVL Trees]]  <br/>
 +
**[[Red-Black Trees]] <br/> 
 +
**[[Splay Trees]]  <br/>
 +
**[[Heaps]]  <br/>
 +
*[[Multi-Way Trees]] <br/>
 +
**[[B-Trees]] <br/>
 +
**[[B+Trees]] <br/>
 +
*[[General Trees]] <br/>
-
*Trees
+
===Graphs===
-
 
+
*[[Graph ADTs|Overview of Graph Abstract Data Types]] <br/>
-
#[[Binary Trees|Binary Trees]]  
+
*[[Representing Graphs]]  <br/>
-
#Binary Search Trees
+
*[[Variations of Graph ADTs]] <br/>
-
#AVL Trees
+
*[[Common Graph Algorithms]] <br/>
-
#Red-Black Trees
+
-
#Splay Trees
+
-
#Heaps
+
-
#B-Trees
+
-
 
+
-
*Graphs  
+
-
*Un-ordered Collections
+
-
 
+
-
#Sets
+
-
#Maps and Dictionaries
+
-
#Hash Tables
+
 +
===Unordered Collections===
 +
*[[Unordered Collection ADTs|Overview of Unordered Collection Abstract Data Types]]
 +
*[[Sets and MultiSets (Bags)]]  <br/>
 +
*[[Maps and Dictionaries]]  <br/>
 +
*[[Hash Tables]] <br/>
<br>
<br>
 +
----
 +
{{CS2/ChapNav}}
 +
----
 +
[[Category:CS2|{{SUBPAGENAME}}]]

Current revision as of 08:08, 15 January 2010

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. Credits to the primary content contributors

Contents

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 usage 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


Algorithms


Preliminaries of Data Organization


ADTs and Data Structures

Linear Structures

Trees

Graphs

Unordered Collections



CS2: Data Structures
Theory of Computation - ADT Preliminaries
Linear ADTs - Tree ADTs - Graph ADTs - Unordered Collection ADTs


Personal tools
MediaWiki Appliance - Powered by TurnKey Linux