edit-task
Home
Up
Delete
Task Name:
Task Description:
tasks -
TaskGroup ID:
Start Date:
Start Time:
Duration:
Priority:
Status:
To Do
Completed
In Process
Add Photo:
Owner ID:
Content:
use HTML
Edit Content
<h1 style="text-align: center;">LIST - book(data structures)</h1> <h2>[previously]</h2> <ol> <li>]</li> <li><strong>[2015-04-22][12:00] NEW chapter IN BOOK/dev-sw/data-structures</strong></li> <ol> <li>x] # 970 - lists -</li> <li>x] # 971 - trees -</li> <li>x] # 972 - graphs -</li> </ol></ol> <h2>[currently]</h2> <ol> <li>] </li> </ol> <h2>[next]</h2> <ol> <li><strong>> [00:00] NEW task IN </strong><ol> <li>i] # # - CREATE-article# 4469 - linked-list</li> </ol></li> <li><strong>> [00:00] NEW task IN </strong></li> <ol> <li>i] # 5062 - CREATE-article# # joel osteen notes</li> </ol> <li><strong>> [10:00] UPDATE article IN dev-sw</strong></li> <ol> <li>i] # 2599 - data structures overview -</li> </ol> <li><strong>[11:30] UPDATE article in dev-sw/introduction</strong></li> <ol> <li>x] # 2597 - introduction to data structures in .net</li> </ol> <li>] <a href="http://en.wikipedia.org/wiki/Hash_table" target="_blank">http://en.wikipedia.org/wiki/Hash_table</a> </li> <li><strong>] > array VS linked list(ll)</strong></li> <ol> <li>array = sequential series of like elements, ex strings[4] = {"string1", "string2", ...}, accessed by index,</li> <li>linked list = an ordered set of elements, each element contains a link to its successor,</li> <li>+] REF = programmer competency matrix</li> </ol></ol>