Contents: CS2

From

(Difference between revisions)
Jump to: navigation, search
(Topics)
Line 8: Line 8:
== Topics ==
== Topics ==
-
 
+
-
*[[Memory Allocation|Memory Allocation]]
+
*[[Asymptotic Measures|Asymptotic Measures]]  
*[[Asymptotic Measures|Asymptotic Measures]]  
 +
*[[Emperical Measures|Emperical Measures]]
*Algorithms
*Algorithms
Line 16: Line 16:
#[[Sorting|Sorting]]
#[[Sorting|Sorting]]
 +
*[[Memory Allocation|Memory Allocation]]
*[[Primitive Structures|Primitive Structures]]  
*[[Primitive Structures|Primitive Structures]]  
*[[Concept of an Element (Node)|Concept of an Element (Node)]]  
*[[Concept of an Element (Node)|Concept of an Element (Node)]]  

Revision as of 17:53, 25 March 2009

Introduction (needs to be written)

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.

Topics

  1. Seaching
  2. Sorting
  1. Lists
  2. Stacks
  3. Queues
  • Trees
  1. Binary Trees
  2. Binary Search Trees
  3. AVL Trees
  4. Red-Black Trees
  5. Splay Trees
  6. Heaps
  7. B-Trees
  • Graphs
  • Un-ordered Collections
  1. Sets
  2. Maps and Dictionaries
  3. Hash Tables


Personal tools
MediaWiki Appliance - Powered by TurnKey Linux