Please enable JavaScript.

Coggle requires JavaScript to display documents.

kump 5 C2 - Coggle Diagram

- - - - allocate memory for new node
        
        store data
        
        traverse to last node
        
        change next of last node to recently created node
    - - allocate memory and store data for new node
        
        traverse to node before required position of new node
        
        change nest pointers to include new node in between
    - - allocate memory for new mode
        
        store data
        
        change next of new node to point to head
        
        change head to point recently create node
  - - - traverse to second last element
        
        change its next pointer to null
    - - Traverse to element before the element to be deleted
        
        change next pointers to exclude the node from the chain
    - - point head to the second node
- - - - Some data
      - A link to the next element
      - The link is used to chain the data
  - - - First node calles as Head meanwhile the last node called as taill
      - Elements or nodes only link to the next element in the list. When a single linked list is null terminating, that mean the list is finished.
      - To store a single linked list, only the reference or pointer to the first node in that list must be stored.
      - Size for single linked list never fixed.
      - Example: Gallery in features in Mobile Phone Or PC it is because in this process we can click next button to proceed into next photo
    - - Has pointer the previous and next node that make it easy to implement skip forward/backward
      - Pointer to the next node also make it quite easy to start the next track when the previous track is over
      - Because of the double linked list has head and tail properties this provides for an easy way to delineate the beginning and end of a playlist
      - Example Of The Process: Music Streaming Application has the Basic Function of Double Linked List because it has next or previous button
    - - In the last node of a list, the link field often contains a null reference, a special value used to indicate the lack of further nodes.
      - A less common convention is to make it point to the first node of the list; in that case the list is said to be 'circular' or 'circularly linked‘
      - Example: Running a multiple software in PC can cause of Circular Linked List Process. All the running applications are kept in a circular linked list and the OS gives a fixed time slot to all for running.
        The Operating System keeps on iterating over the linked list until all the applications are completed.
    - - More complexed type of data structure in which a node contains pointers to its previous node doesn't contain NULL in any of the nodes
      - We will have a two-pointer that will point to starting node and the end node, which will help in insertion at both starting as well as end
      - The last node of the list contains the address of the first node of the list.
      - The first node of the list also contains the address of the last node in its previous pointer.
      - Circular Linked List exist in every Software in PC or Application in mobile Phone. For example in PC we have Groove music player that user can play the music, User just need to click on next button to the next sing and previous button to hear the previous song. In Circular Double Linked is has a special features which the process can loop into where its started
- - - - Have Maximum Size
        
        Array for sorting entries
        
        Number of elements
        
        Current position
      - EXAMPLE OF OPERATION THAT EXIST IS ARRAY/LIST
        
        INSERTION
        
        Process to enter a data in array or list. This process can be do at the beginning, middle or the last process
        
        int score[2]={80,85,90}
        
        DELETION
        
        Before proceed into delete process. First user must find where location of data that we want to delete
        
        RETRIEVEL
        
        Located in data to calling a module without changings a available contents.
        
        TRAVESAL
        
        Retrieve all the elements in sequence
        
        EXAMPLE TO CREATE A LIST
        
        define maxSIZE10 //to declare a maximum size of arraytext
        
        int listNumber[maxSize]; // declaration of an array
        
        int NoOfItem; // used to store no. of item in an array