Employees information system source code ..please

Your baby brother has found the hammer and is eagerly eyeing one of the boxes. Describe and analyze an algorithm to determine if

erastovalidia [21]

Answer:

Question is incomplete.

Assuming the below info to complete the question

You have a collection of n lockboxes and m gold keys. Each key unlocks at most one box. Without a matching key, the only way to open a box is to smash it with a hammer. Your baby brother has locked all your keys inside the boxes! Luckily, you know which keys (if any) are inside each box.

Detailed answer is written in explanation field.

Explanation:

We have to find the reachability using the directed graph G = (V, E)

In this V are boxes are considered to be non empty and it may contain key.

Edges E will have keys .

G will have directed edge b1b2 if in-case box b1 will have key to box b2 and box b1 contains one key in it.

Suppose if a key opens empty box or doesn’t contain useful key means can’t open anything , then it doesn’t belongs to any edge.

Now, If baby brother has chosen box B, then we have to estimate for other boxes reachability from B in Graph G.

If and only if all other boxes have directed path from box B then just by smashing box B we can get the key to box b1 till last box and we can unlock those.

After first search from B we can start marking all other vertex of graph G.

So algorithm will be O ( V +E ) = O (n+m) time.

7 0

3 years ago

Which algorithm makes the most efficient use ofmemory?

SashulF [63]

Answer:

Best-fit Algorithm

Explanation:

Best-fit: Allocating the smallest memory location that is greater than or equal to the size of process.

<u>Example</u>

Let these are the memory locations-210kb,310kb,260kb,610kb

and size of processes-160kb,450kb,250kb,300kb

For the first-fit,

We allocate 160 kb to the 210kb memory location

Then, we allocate 450 kb to the 610kb because others don't have the size.

Then,we allocate 250kb to the 310 kb.

300 kb will stop,as no memory locations can execute.

For the Best-fit,

We allocate 160 kb to the 210kb memory location

Then,we allocate 450kb to the 610kb.

Then,we allocate 250kb to the 260kb not 310kb according to best-fit.

Then we allocate 300kb to the 310kb.

For the worst fit,

We allocate 160 kb to the 610kb memory location according to the worst-fit algorithm.

Then,we can't allocate 450kb to any memory location.

Then,we allocate 250kb to the 310kb .

We can' allocate 300kb in 260kb memory location.

As we can see from this example that in First-fit algorithm 300kb process will stop as no memory location is there.

In worst-fit algorithm ,We can't allocate 450kb,300kb to any memory locations.

In Best-fit algorithm,we can allocate the process to each location,so this algorithm is using memory in a efficient way.

5 0

3 years ago

Computer that process digital as well as analogue signals

Nuetrik [128]

Answer:

The answer is hybrid computer coz it is the combination of both analog and digital computers

Explanation:

hope it helps

good day

5 0

3 years ago

Write 9 words but each word starting with a letter of computer? After your finished the first letter of each of your words shoul

oksian1 [2.3K]

Answer:

<h2>C- rippled</h2><h2>O- utstanding</h2><h2>M- agical</h2><h2>P- eace</h2><h2>U- npredictable</h2><h2>T- riumph</h2><h2>E - xcellent</h2><h2>R- obust</h2>

Explanation:

<h3><u>Acronym</u>- a word that composes of long words that start with its initial letter.</h3><h3>Example: OTG (on the go)</h3>

$\tt{ \green{P} \orange{s} \red{y} \blue{x} \pink{c} \purple{h} \green{i} e}$