Compare and contrast the utilization of three data structures (array & Queue & Graphs) that could be useful in the development of Information Systems?

Information system is based on all the data structures like array,queue,linked list,graph,trees to manage and secure data of organization in their information system.

Similarities:

• All of them are used to model and map the data of the organization in managing their information system.
• All provide sequential access to the data as used in the internal of most of the software OS use in any organization is also based on these.

Differences:

Array:

• Data is accessed through indexes.
• Fixed memory is assigned.
• No memory optimization.
• It can be used for small size data in information systems.

Queue:

• Data access on the basis of priority assigned.
• It can grow dynamically.
• Memory optimization is present.
• Use for small size of data compared to graphs.

Graph:

• Data access through adjacent node traversal.
• Grow dynamically.
• Memory optimization.
• Use for large collection of data.

Step-by-step explanation

Information system is managed through use of highly qualified software in a secure environment and each software is made using array,queue,linked list,graph,trees to manage the data in the system.

Similarities among Array,queue and graph are as follows:

• Array,queue and graph are used to map and model the data for efficient use and accessibility in the organization.
• All three provide sequential access to data as used in most of software system:

Array:

• Data can be access sequential through base address 
• Example:  saving password in the system

Queue:

• Data can be access sequentially from start through traversing to next node
• Example: Prioritising the process on the basis of priority and scheduling is done in the OS.

Graph:

• Nodes are accessed through traversal to adjacent nodes sequentially.
• Example:It is used in connecting all network nodes and visualizing at one platform for log analysis. 

Differences between array,queue and graph are as follow:

Array in information system:

• In the array,  the data is accessed through indexes from the base address.
• A fixed memory is assigned to an array during initialization.
• There is no memory optimization as it didn't grow on demand.
• Use for small size data as memory is allocated from stack.
• Example:It can be used by search engines and can store the keyword search in the array.

Queue in the information system:

• Data is accessed on the basis of priority like First in first out,the data which came first set high priority and is accessed first.
• It can grow dynamically as memory is allocated from the heap.
• Memory can be allocated and deallocated dynamically on demand.
• It can be used for large amounts of data.
• Example:The organization can use it for scheduling of processes in the OS for the information system.

Graph in the information system:

• Nodes in the graph are accessed through adjacent node traversal.
• Graphs grow dynamically as memory is assigned from the heap.
• Memory can be initialised dynamically on demand as per the requirement of organization.
• It is used for large amounts of data.
• Example:ELK stack can be used for log analysis in the organization.