Ani need free points cus i have zero sry
Explanation:
Answer:
False
Explanation:
The private member of a class is not accessible by using the Dot notation ,however the private member are those which are not accessible inside the class they are accessible outside the class .The public member are accessible inside the class so they are accessible by using the dot operator .
<u>Following are the example is given below in C++ Language </u>
#include<iostream> // header file
using namespace std;
class Rectangle
{
private:
double r; // private member
public:
double area()
{ return 3.14*r*r;
}
};
int main()
{
Rectangle r1;// creating the object
r1.r = 3.5;
double t= r1.area(); // calling
cout<<" Area is:"<<t;
return 0;
}
Output:
compile time error is generated
<u>The correct program to access the private member of class is given below </u>
#include<iostream> // header file
using namespace std;
class Rectangle
{
private:
double r; // private member
public:
double area()
{
r1=r;
double t2=3.14*r2*r2;
return(t2); // return the value
}
};
int main()
{
Rectangle r1;// creating the object
r1.r = 1.5;
double t= r1.area(); // calling
cout<<" Area is:"<<t;
return 0;
}
Therefore the given statement is False
Details view provides the most information at a glance.
<h3>Which view in File Explorer can you use to sort files by column heading?</h3>
In Explorer windows, files and folders appear in lists with headings at the top in Details view. You can use the headings to change how files are displayed in the window. You can use filtering and sorting to display the files and folders you want.
<h3>What is the command to display the list of files in a directory?</h3>
Use the ls command to display the contents of a directory. The ls command writes to standard output the contents of each specified Directory or the name of each specified File, along with any other information you ask for with the flags.
To learn more about Details view, refer
brainly.com/question/24858866
#SPJ4
Answer:
b. Binary tree
Explanation:
The time complexity of a binary tree is O(log n). As it scales up in size (n), the time taken is only log n. This is because it makes use of divide and conquer to split up the data which makes searching and inserting very simple. However, this only holds if the data is already sorted.