All categories

3 years ago

Draw a flow chart to print gratest number among two .

2 answers:

8 0

Algorithm:

Step 1: Start
Step 2: Read a, b . /* a, b two numbers */
Step 3: If a>b then /*Checking */
Display “a is the largest number”.
Otherwise
Display “b is the largest number”.
Step 4: Stop.

bagirrra123 [75]3 years ago

7 0

MYbe show a picture next time so we can see what the problem is about ?

You might be interested in

To give your app users the ability to open your app directly from other apps by clicking a link, you should use:.

pickupchik [31]

To give your app users the ability to open your app directly from other apps by clicking a link, you should use: deep link. With the deep link and its URL functionality, existing app users are driven directly inside the mobile app itself.
Deep links are usually made up of two parts: a scheme (part of the link that identifies which app to open).and a host and path (the unique location in the app where your content exists).

7 0

3 years ago

What is the limitation of computer

eimsori [14]

The limitation of computer are:

No self-intelligence
No feeling
No learning power
Dependency

3 0

3 years ago

Write the use of these computers.

xxTIMURxx [149]

Answer:

i not know mainframe computer there is many use of computer

5 0

2 years ago

A large population of ALOHA users manages to generate 50 requests/sec, including both originals and retransmissions. Time is slo

krok68 [10]

Answer:

The answer is below

Explanation:

Given that:

Frame transmission time (X) = 40 ms

Requests = 50 requests/sec, Therefore the arrival rate for frame (G) = 50 request * 40 ms = 2 request

a) Probability that there is success on the first attempt = $e^{-G}G^k$ but k = 0, therefore Probability that there is success on the first attempt = $e^{-G}=e^{-2}=0.135$

b) probability of exactly k collisions and then a success = P(collisions in k attempts) × P(success in k+1 attempt)

P(collisions in k attempts) = [1-Probability that there is success on the first attempt]^k = $[1-e^{-G}]^k=[1-0.135]^k=0.865^k$

P(success in k+1 attempt) = $e^{-G}=e^{-2}=0.135$

Probability of exactly k collisions and then a success = $0.865^k0.135$

c) Expected number of transmission attempts needed = probability of success in k transmission = $e^{G}=e^{2}=7.389$

6 0

3 years ago

Windows uses a memory-management technique known as ________ to monitor which applications you use most frequently and then prel

lukranit [14]

Answer:

SuperFetch

Explanation:

Superfetch is a memory management technique on windows service that enables or fetch frequently use applications on systems and launch them faster because the frequently use applications has been preload into the system memory for easy access when they want to be used.

SuperFetch always takes notice of all application running on your system in which when you exit a frequently used application SuperFetch will preload them immediately since it is saved on the system memory.

One of the most important part of Superfetch is that it saves alot of time because you don't have to search the applications before you get access to them in as far as the application was frequently used.

5 0

3 years ago

Draw a flow chart to print gratest number among two .​

Draw a flow chart to print gratest number among two .