Answer: Logical security list
Explanation:Logical security list that is used for checking of the authentication and authorization for the organizations. It consist the safeguarding the software, security access of password and other keys, system auditing, stages of the security etc.
These factors helps in the maintaining the level of the security and only authorized access to place in the system of a particular organization.Other options are incorrect because physical security system consist of the guards , locks etc physical devices, response plane is the feedback strategy and whiltelist is related with the acceptable people.
Answer:
what exactly is the question because I don't see anything
Answer:
Yes it is possible for the following cases:-
- When the queue is full.
- When the queue is empty.
Explanation:
When the queue is full the the front and the rear references in the circular array implementation are equal because after inserting an element in the queue we increase the rear pointer.So when inserting the last element the rear pointer will be increased and it will become equal to front pointer.
When the queue is empty the front and rear pointer are equal.We remove an element from queue by deleting the element at front pointer decreasing the front pointer when there is only one element and we are deleting that element front and rear pointer will become equal after deleting that element.
Seems nice I mean yeah its be fine