Data Structures and Implementation_Unit2_IP

Data Structures and Implementation_Unit2_IP - Data...

Info iconThis preview shows pages 1–3. Sign up to view the full content.

View Full Document Right Arrow Icon
Data Structures and Implementation Unit 2 Individual Project Kregg M. Soltow February 19, 2011 American Intercontinental University
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Analyze the possible uses for doubly linked lists. For most possible uses, double linked lists use additional memory. Furthermore, each additional basic process is just a little bit longer and conveniently one additional pointer to preserve.(Galler,1964) The advantages of these uses are greatly dependent on the fact that double linked lists can be iterated with out the need for recursion and in reverse. (Knuth,2007) The user can feel free to remove and insert from a double linked list at some random node much quicker given the fact that they no longer have to examine through the beginning of a list to find a specific previous node. Discuss the types of list manipulation that would be useful. 1. gdsl_list_alloc (const char *NAME, gdsl_alloc_func_t ALLOC_F, gdsl_free_func_t FREE_F) Creates a new list 2. gdsl_list_free (gdsl_list_t L) Destroys a list 3. gdsl_list_get_name (const gdsl_list_t L) Gets the name of a list 4. gdsl_list_get_size (const gdsl_list_t L) Gets the size of a list 5. gdsl_list_insert_head (gdsl_list_t L, void *VALUE) Inserts an element at the head of a list 6. gdsl_list_delete (gdsl_list_t L, gdsl_compare_func_t COMP_F, const void *VALUE) Deletes a particular element from a list
Background image of page 2
Image of page 3
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 02/17/2012 for the course ITCO 101 taught by Professor Gugenhiem during the Spring '12 term at AIU Online.

Page1 / 6

Data Structures and Implementation_Unit2_IP - Data...

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online