Contents: CS2

From

Revision as of 23:04, 24 March 2009 (view source) Admin (Talk | contribs) ← Older edit		Revision as of 23:06, 24 March 2009 (view source) Admin (Talk | contribs) Newer edit →
Line 14:		Line 14:
	this is the essential difference.		this is the essential difference.
-	== Introdution to Data Structures, Algorithms, and Complexity ==	+	== Topics ==
	*[[/index.php/Memory Allocation|Memory Allocation]]		*[[/index.php/Memory Allocation|Memory Allocation]]

---

Revision as of 23:06, 24 March 2009

Introduction (needs to be written)

Data Structures

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

• Memory Allocation
• Asymptotic Measures
• Algorithms

1. Seaching
2. Sorting

• Primitive Structures
• Concept of an Element (Node)
• Abstract Data Types
• Linear Structures

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