Skip to main content
ICT
Lesson AB29 - Linked List
  
Main Previous Next
Title Page >  
Summary >  
Lesson A1 >  
Lesson A2 >  
Lesson A3 >  
Lesson A4 >  
Lesson A5 >  
Lesson A6 >  
Lesson A7 >  
Lesson A8 >  
Lesson A9 >  
Lesson A10 >  
Lesson A11 >  
Lesson A12 >  
Lesson A13 >  
Lesson A14 >  
Lesson A15 >  
Lesson A16 >  
Lesson A17 >  
Lesson A18 >  
Lesson A19 >  
Lesson A20 >  
Lesson A21 >  
Lesson A22 >  
Lesson AB23 >  
Lesson AB24 >  
Lesson AB25 >  
Lesson AB26 >  
Lesson AB27 >  
Lesson AB28 >  
Lesson AB29 >  
Lesson AB30 >  
Lesson AB31 >  
Lesson AB32 >  
Lesson AB33 >  
Vocabulary >  
  

H. Static vs. Dynamic Data Structures page 10 of 16

  1. An array is a somewhat static data structure that has the following advantages and disadvantages:

    Advantages of an array
    Disadvantages of an array

    1. Easy to implement and use
    2. Fast, random-access feature

    		1. Memory is usually wasted
    2. Inserting/deleting is slower

  2. A linked list (LL) is a dynamic data structure that has the following advantages and disadvantages:

    Advantages of LL
    Disadvantages of LL

    1. Memory is allocated when the program is run; therefore, the data structure is only as big as it needs to be.
    2. Memory is conserved.

    		 1. Each node of the list takes more memory.
    2. The data structure is not random access so processing must be done in sequential order.

 
Main Previous Next
Contact
 © ICT 2006, All Rights Reserved.