Chapter A, Problem 1E

a.

Program Plan Intro

Array:

• An array is a data structure that stores the sequence of similar type of data.
• It contains the sequence of data with common variable name and similar data type.

Explanation of Solution

Applications of arrays:

• An array is used for organizing the homogenous data as an aggregation to execute the instructions related to the data.
• Windows media player uses arrays for shuffling the song list.
• An array can be accessed in constant time hence; it is used in the areas where high performance is required.
• It is used in implementing the data structures like stacks, queues, strings and many such.
• Three dimensional arrays are used for creating games.

b.

Program Plan Intro

Queue:

• Queue is a linear data structure in which the data is inserted from one end called rear-ends and deleted from another end called front-end.
• It follows the principle First-In-First-Out (FIFO).
• It includes different types like circular queue, priority queue, enqueue, dequeue and many such.

Explanation of Solution

Applications of Queue:

• Queues are used for scheduling the Central Processing Unit (CPU).
• The operations to be performed are inserted into the queue and deleted by executing one by one.
• It is used in printers to assign the printing list.

c.

Program Plan Intro

Linked list:

• Linked list is a linear data structure which includes the nodes in particular order.
• The nodes are divided into two different parts.
  • The first part represents the data.
  • The second part represents the address of next node.
• There are different types of linked lists like single linked list, double linked list and circular linked list.

Explanation of Solution

Applications of linked list:

• A linked list is used in implementing the stacks, queues and their variations.
• It is mostly used for insertion and deletion of elements.
• These operations can be done at a time if the information of insertion and deletion of element is provided.

d.

Program Plan Intro

Stack:

• Stack is a linear data structure used for inserting and deleting the elements at the one end called top.
• It follows the principle Last-In-First-Out (LIFO).

Explanation of Solution

Applications of Stack:

• A stack is used in recursion to store the data during run-time.
• It is used for the operations like push, pop and access to last element.
• It is used for evaluating the prefix, postfix and infix operations.
• It is used in undo/redo operations of computers.

e.

Program Plan Intro

Tree:

Tree is an Abstract Data Type (ADP) used for implementing the hierarchical tree structure. It is accessed at the beginning of the root node and all other nodes are known as leaf node or internal node. They are of different types like binary tree, heap tree, binary search tree and many others.

Explanation of Solution

Applications of tree:

• The practical applications of tree are graphs.
• It is used for storing the elements depending on their priority using heaps.
• It can be used for searching the elements in logarithmic time.
• They are used for implementing the file systems in Operating Systems (OS) and Database Management System (DBMS).