I believe this should have some multiple choice options: Application, System, Volume, Security.
The correct answer is volume.
Answer:
Check the explanation
Explanation:
#include <bits/stdc++.h>
using namespace std;
class Rectangle{
public:
int length;
int breadth;
Rectangle(int l,int b){
length = l;
breadth = b;
}
int area(){
return length*breadth;
}
int perimeter(){
return 2*(length+breadth);
}
bool equals(Rectangle* r){
// They have the exact same length and width.
if (r->length == length && r->breadth == breadth)
return true;
// They have the same area
if (r->area() == area())
return true;
// They have the same perimeter
if (r->perimeter() == perimeter())
return true;
// They have the same shape-that is, they are similar.
if (r->length/length == r->breadth/breadth)
return true;
return false;
}
};
int main(){
Rectangle *r_1 = new Rectangle(6,3);
Rectangle *r_2 = new Rectangle(3,6);
cout << r_1->equals(r_2) << endl;
return 0;
}
The options are missing from the question.
Below are the options.
A) 192.168.15.0
B) 192.168.15.16
C) 192.168.15.32
D) 192.168.15.64
Answer: The correct option to the question is option D
192.168.15.64
Explanation:
The Network is: 192.168.15.64/26 11000000.10101000.00001111.01000000
Then the Broadcast is: 192.168.15.127 11000000.10101000.00001111.01111111
We see the HostMin as: 192.168.15.65 11000000.10101000.00001111.01000001
And the HostMax as: 192.168.15.126 11000000.10101000.00001111.01111110
Answer:
When the element is not found we return -1.
Explanation:
When we use binary search we use BinarySearch() method of an array or list type when the element is found we return the index of the element if found if the element is not found we return -1.
We can decode this value since it is less than 0 and the indexing of arrays and lists starts with 0 upto the size-1.So -1 index is not present in the array or list.We have to check if the index is < 0 then the element is not present in the array or list.
for ex:-
if(index<0)
{
System.out.println("Element is not present in the array");
}
