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.
Most computer devices are connected to the computer through port
Keyboard through usb port
Printer through usb port
Hand point device through usb port
Also computer equipped with LPT port for printers and COM port for additional devices like external modems e.t.c
Answer:
False.
Explanation:
The description provided matches better with Software performance testing, and shouldn't be confused with a benchmark.
In computing, a benchmark is a tool or software designed to measure the average performance of another program, by running several tests and trials against it.
A performance testing is designed to measure the performance and responsiveness of a computer system (not a program) under a heavy workload.
Answer:
Follows are the method definition to this question:
void Reverse_Order(struct Node* h)//defining a recursive method Reverse_Order that takes structure in parameter
{
if (h == NULL)//use if block to check head equal to null
return;//use return keyword
Reverse_Order(h->next);//call method recursively
cout<<h->data;//print data
}
Explanation:
In the above code, a recursive method "Reverse_Order" takes structure as the parameter, and inside the method, structure variable h is used that uses the if conditional statement to check the header equal to null.
In the condition is true, it will use the return keyword, and in the next step, it calls the method recursively, and print its value in the reverse order.
