Answer:
the depth of the shaft,
the carrying load of the skip and the mass of the counterweight,
the approximate size of the winding drum,
the approximate height of the headgear and the sheave wheel
Answer:
Here!
Hope this helps. Please mark brainliest!
Answer:
The correct answer to the following question will be "It is a discrete random variable".
Explanation:
A variable that assumes algebraic expressions defined by a randomized occurrence result, is a Random variable.
- There are several potential or possible values for a single randomized variable.
- A discrete random variable's chances for each value is between 0 (zero) and 1 (One), as well as the total amount among all possible outcomes, is equitable to 1.
So, a Discrete random variable is the right answer.
Answer:
The answer is "Option d".
Explanation:
In networking, NAT refers to the Network Address Translation. This process is used to translate computer IP addresses into a single IP address in your local network. It allows private IP networks to connect to the Internet using unregistered IP addresses. and other options are incorrect that can be described as follows:
- In option a, SSL stands for Secure Sockets Layer. It is used in transmission of documents or data over a network that's why it is not correct.
- In option b, RADIUS stands for Remote Authentication Dial-In User Service. It is used to manage the data on a network.
- In option c, PPTP stands for Point-to-Point Tunneling Protocol. It is used to provide a set of rules for communicating through a network that's why it is not correct.
Answer:
1) Bottom-up
2) Top-down
Explanation:
In general dynamic programming is a divide and conquer strategy which can be implemented using bottom up approach or top down approach.
Bottom-up approach in dynamic programming will solve a relatively simple sub-problem first and then use the solution to build and arrive at solutions to a bigger sub-problem.
Top down approach is reversed to bottom-up approach and is also known as Memoization Method. Instead of solving a problem started from the base state sub-problem, the top down approach break a problem into a smaller problems from the top most destination state until it reaches the bottom most base state.
