Explanation:
A ready queue is more adequate since in this method the load balancing occurs in a proper way. The goal of multiple processing is the correct distribution of load.
But in the cases when a processor is doing quicker or taking a smaller queue, it will self assign processes allotted for execution, configuring it with a constant busy state.
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.
Answer:
The correct option for the given question is option(B) i.e dot operator
Explanation:
Structure are collection of different datatypes member element .
Let us consider the example of structure
Struct test
{
int age ;
char name[45];
};
Here test is an "structure" which member is age of "integer" type and name of "String" type.if we have to access the member of structure,firstly we create structure variable name then after that we use dot operator which is also known as member access operator that access the members of structure.
struct test op;// structure variable name
op.age=12; // access the member age
For example
Following is the code in c language :
#include <stdio.h> // header file
struct test // structure declaration
{
int age ;
char name[45];
};
int main() // main function
{
struct test op;// structure variable name
op.age=12; // access the member age
printf("%d",op.age);
return 0;
}
Output:12
so correct answer is "dot operator"
