answer this question true or false

Queue:

linked list:

EXERCISES EXERCISE 1: QUEUE 1. Following the questions, give your answer in the form of TRUE or FALSE a. A queue is a data structure in which the items are added at one end and removed from the other end. b. A queue is a First In First Out (FIFO) data structure, c. The basic operations on a queue are as follows; add an item to the queue, remove an item from the queue, retrieve the first or last element of the queue, initialize the queue, check whether the queue is empty, and check whether the queue is full d. A queue can only be implemented as an array but not as linked list. e. The middle element of a queue can be accessed directly. f. Queues are restricted versions of array and linked lists. g. The advantage of a queue implemented by linked list (pointer based) is no rightward-drift problem will occur. EXERCISES EXERCISE 1: LINKED LIST AND ARRAY a. 1. Determine whether each of the following statements are TRUE or FALSE. The field link, in a singly linked list implemented using pointer, normally is used to keep the data for the next node in the list. b. The nodes in a singly linked list implemented using pointer can only be accessed linearly c. When a new node is going to be inserted in front of a linear linked list, the field link of the new node must be assigned with the address of the node pointed by header. a d. One of the advantages of the list implemented using array is that we can increase or decrease the size of the array during the execution of the program. e. In order to traverse all the nodes in a linked list , an external pointer must be used to access all the nodes starting from header node. f. The delete node operation can be implemented on an empty list. & The add node operation can be applied to an empty list implemented using pointer and array h. In a linked list implemented using pointer, the last node in the list can be identified when the link of the node contain NULL value. i. The class declaration below, declares node in doubly linked list. class aNode { float volume, int length, width; aNode *next; aNode *previous; )