Please enable JavaScript.

Coggle requires JavaScript to display documents.

Kump 6 - Coggle Diagram

- - - - This defines a new type, StaffRecord
      - The convention is to capitalize the first letter in any new type name
  - - - Syntax :
      - Example :
- - - - Element − Each item stored in an array is called an element.
      - Index − Each location of an element in an array has a numerical index, which is used to identify the element.
  - - - Index starts with 0.
      - Array length is 8 which means it can store 8 elements.
      - Each element can be accessed via its index. For example, we can fetch an element at index 6 as 9.
  - - - Deletion − Deletes an element at the given index.
      - Search − Searches an element using the given index or by the value.
      - Insertion − Adds an element at the given index.
      - Update − Updates an element at the given index.
      - Traverse − print all the array elements one by one.
- - - - 1.Integer: This is used to represent a number without decimal point.
      - 2.Float and Double: This is used to represent a number with decimal point.
      - 3.Character : This is used to represent single character
      - 4.String: This is used to represent group of characters
      - 5.Boolean: This is used represent logical values either true or false
    - - 1.Arrays : a collection of elements (values or variables), each identified by at least one array index or key
      - 2.Structure : a specialized format for organizing and storing data
      - 3.Union : a value that may have any of several representations or formats
      - 4.Linked List : a linear collection of data elements, called nodes, each pointing to the next node by means of a pointer
      - 5.Stacks : an ordered list of similar data type
      - 6.Queues : an abstract data structure, somewhat similar to Stacks
  - - - The elements are adjacently attached to each other and in a specified order. It consumes linear memory space, the data elements are required to store in a sequential manner in the memory.
        
        Examples:
        
        Stacks
        
        Queues
        
        Linked list
    - - The data elements can be attached to more than one element exhibiting the hierarchical relationship
        
        Examples:
        
        Graphs
        
        Trees
  - - - The size of the data structure is set from the beginning. Fixed size.
    - - Is a data structure that changes in size as a program needs it by allocating and de-allocating memory