User contributions
From
(Latest | Earliest) View (newer 50) (older 50) (20 | 50 | 100 | 250 | 500)
- 15:15, 11 November 2009 (hist) (diff) ATE Grant Meetings (→Initial discussion of potential for ATE Center Grant)
- 15:15, 11 November 2009 (hist) (diff) ATE Grant Meetings (→Oct. 15, 2009 Fall OCCC Meeting)
- 15:14, 11 November 2009 (hist) (diff) ATE Grant Meetings (→2009 Fall OCCC Meeting)
- 15:02, 11 November 2009 (hist) (diff) ATE Grant Resources (→Existing Grants and Funding)
- 15:02, 11 November 2009 (hist) (diff) ATE Grant Resources (→Potential CS/Eng resources/programs to support under this grant)
- 15:02, 11 November 2009 (hist) (diff) ATE Grant Resources (→Potential Supporting Organizations)
- 15:37, 9 November 2009 (hist) (diff) ATE Center grant (→Emails of the working group)
- 15:36, 9 November 2009 (hist) (diff) ATE Center grant (→Emails of the working group)
- 15:33, 9 November 2009 (hist) (diff) ATE Center grant (→Emails of the working group)
- 20:15, 8 November 2009 (hist) (diff) OCCC Discussions (→OCCC Discussion page list)
- 20:14, 8 November 2009 (hist) (diff) OCCC Discussions (→OCCC Discussion page list)
- 20:12, 8 November 2009 (hist) (diff) ATE Grant Goals (→Bullet List from brainstorming session)
- 02:20, 19 October 2009 (hist) (diff) N OCCC White Papers (Created page with '== White Papers from OCCC == '''Computer Literacy AAOT Requirement - White Paper (May 10, 2006)''' *Word Format *PDF Format <br> == Other submitted White Papers == None rig...')
- 02:15, 19 October 2009 (hist) (diff) OCCC Links
- 02:13, 19 October 2009 (hist) (diff) N OCCC Links (Created page with '<H1><CENTER>Other Links of Interest<BR> Submitted by OCCC Members</CENTER></H1><P><HR ALIGN=LEFT><p>The URL for the listing of ALL online classes at the Oregon Community Colleges...')
- 02:10, 19 October 2009 (hist) (diff) OCCC Courses
- 02:08, 19 October 2009 (hist) (diff) N OCCC Courses (Created page with '<CENTER> {| BORDER="2" CELLSPACING="2" CELLPADDING="2" ! BGCOLOR="#336699" | <FONT COLOR="#ffffff">School</FONT> ! BGCOLOR="#336699" | <FONT COLOR="#ffffff">Link</FONT> |- |...')
- 08:05, 27 May 2009 (hist) (diff) Variations of Graph ADTs (→Cyclic & Acyclic Graphs)
- 08:04, 27 May 2009 (hist) (diff) Variations of Graph ADTs (→Weighted Graphs)
- 08:04, 27 May 2009 (hist) (diff) Variations of Graph ADTs (→Directed Graphs)
- 08:02, 27 May 2009 (hist) (diff) Variations of Graph ADTs (→Undirected Graphs)
- 20:15, 9 April 2009 (hist) (diff) Representing Graphs
- 17:42, 29 March 2009 (hist) (diff) Graph ADTs (→Graph Representations)
- 17:28, 29 March 2009 (hist) (diff) Graph ADTs
- 17:27, 29 March 2009 (hist) (diff) N Graph ADTs (Created page with 'A graph ADT consists of a set of nodes (also called vertices) and a set of edges that establish relationships (connections) between the nodes. The graph ADT follows directly from...')
- 18:34, 28 March 2009 (hist) (diff) Goals
- 18:32, 28 March 2009 (hist) (diff) Goals
- 18:27, 28 March 2009 (hist) (diff) Hash Tables (→Hash Table Behavior)
- 18:27, 28 March 2009 (hist) (diff) Hash Tables (→Closed Hashing)
- 18:22, 28 March 2009 (hist) (diff) Hash Tables (→Closed Hashing)
- 18:21, 28 March 2009 (hist) (diff) Hash Tables (→Closed Hashing)
- 18:20, 28 March 2009 (hist) (diff) Hash Tables (→Hash Table Behavior)
- 18:11, 28 March 2009 (hist) (diff) Hash Tables (→Hash Table Behavior)
- 18:10, 28 March 2009 (hist) (diff) N Hash Tables (Created page with 'Hashing is called a ''Key to Address'' system. Objects (records) are stored in a table, and each object stored occupies a slot in the table. The location of the slot is called th...')
- 18:06, 28 March 2009 (hist) (diff) Contents: CS2 (→Trees)
- 18:05, 28 March 2009 (hist) (diff) B+Trees
- 18:05, 28 March 2009 (hist) (diff) N B+Trees (Created page with 'The variation of a B-Tree that is most often implemented in the B+ Tree. In this tree, internal nodes store only keys and all the data is stored in the leaves. The keys are simpl...')
- 18:04, 28 March 2009 (hist) (diff) N B-Trees (Created page with 'A tree structure that is very useful is called a B-Tree. There are several extensions or variation to the basic B-Tree: B+-Tree, B*-Tree, and B′-Tree. <br/><br/> Part of the de...')
- 17:54, 28 March 2009 (hist) (diff) Goals
- 17:53, 28 March 2009 (hist) (diff) Goals
- 17:45, 28 March 2009 (hist) (diff) Contents: CS2 (→Trees)
- 17:40, 28 March 2009 (hist) (diff) Heaps (→Constructing a Heap)
- 17:39, 28 March 2009 (hist) (diff) Heaps (→Heap Behavior)
- 17:37, 28 March 2009 (hist) (diff) Heaps (→Heap Behavior)
- 17:37, 28 March 2009 (hist) (diff) N Heaps (Created page with 'We have talked about a memory area called the heap. It is from this area that memory for dynamic allocation is taken. However, there is also a data structure called a heap. This ...')
- 17:23, 28 March 2009 (hist) (diff) Red-Black Trees (→Red-Black Tree Behavior)
- 17:21, 28 March 2009 (hist) (diff) N Splay Trees (Created page with 'A Splay tree is not actually a data structure, rather it is a set of rules for improving the performance of a BST, and they were first introduced by D. D. Sleator and R. E. Tarja...')
- 17:18, 28 March 2009 (hist) (diff) N Red-Black Trees (Created page with 'Another approach to self-balancing binary search trees was published in 1978 by L. J. Guibas and R. Sedgewick. These trees are called Red-Black Trees because every node has a col...')
- 14:10, 28 March 2009 (hist) (diff) Contents: CS2 (→Graphs)
- 14:05, 28 March 2009 (hist) (diff) Tree ADTs
(Latest | Earliest) View (newer 50) (older 50) (20 | 50 | 100 | 250 | 500)