Answer:
// code in C++.
#include <bits/stdc++.h>
using namespace std;
// main function
int main()
{
// variables
int length=10,height=7,width=5;
// find the volume of
int vol=length*height*width;
// find the surface area
int sa=2*(length*width+length*height+height*width);
// find the perimeter
int peri=4*(length+width+height);
// print the volume
cout<<"Volume is: "<<vol<<" cm^3."<<endl;
// print the surface area
cout<<"Surface area is: "<<sa<<" cm^2."<<endl;
// print the perimeter
cout<<"Perimeter is: "<<peri<<" cm."<<endl;
return 0;
}
Explanation:
Declare and initialize length=10, width=5 and height=7.calculate volume by multiply length, width and height and assign to variable "vol".Then find the surface area as 2*(length*width+length*height+height*width) and assign it to variable "sa".Then find the perimeter as 4*(length+width+height) and assign to variable "peri". Print the volume, perimeter and surface area.
Output:
Volume is: 350 cm^3.
Surface area is: 310 cm^2.
Perimeter is: 88 cm.
Answer:
Explanation:
/*# represents ID selector
*/
#feature{
font-family: 'Arial';
font-size: 10px;
color: red;
background: white;
width: 80%;
filter: drop-shadow(30px 10px 4px #4444dd);
}
The step in the penetration testing life cycle is accomplished using rootkits or trojan horse programs is option a: maintain access.
<h3>What is maintaining access in penetration testing?</h3>
“Maintaining Access” is a stage of the penetration testing life cycle and it is said to have a real purpose.
It is one that tends to allow the pentester to stay in the set systems until he get the information he need that is valuable and then manages to take it successfully from the system.
Hence, The step in the penetration testing life cycle is accomplished using rootkits or trojan horse programs is option a: maintain access.
Learn more about penetration testing from
brainly.com/question/26555003
#SPJ1
Answer: Two direction
Explanation: Doubly linked list is a data structure which contains node's end linked with the start of the next node and also a previous pointer .These node persist two link fields and one data field in the doubly linked list.
The transversing as well as searching can be done in both direction. Inorder transversal (forward direction)and the reverse order (backward direction)transversal are the techniques through which the reversal is carried out in two ways.
Answer:
HELLOOOO
Alr lets start with steps by dividing by 2 again and againn..
265 / 2 = 132 ( rem = 1 )
132 / 2 = 66 ( rem = 0 )
66/2 = 33 ( rem = 0 )
33/2 = 16 ( rem = 1 )
16/2 = 8 ( rem = 0 )
8/2 = 4 ( rem = 0 )
4/2 = 2 ( rem = 0 )
2/2 = 1 ( rem = 0 )
1/2 = 0 ( rem = 1 )
now write all the remainders from bottom to up
100001001
is ur ans :)))
