Computer Science, asked by sehgalshilpa1986, 4 months ago

In the first Phase of Partition Algorithm

(A) Logically divides into a number of non-overlapping partitions

(B) Logically divides into a number of overlapping Partitions

(C) Not divides into partitions

(D) Divides into non-logically and non-overlapping Partition​

Answers

Answered by dualadmire
0

Logically divides into a number of non-overlapping partitions.

  • Algorithms divide the whole process or program into parts which are easy to understand, it creates a flowchart that makes the steps easy and understandable.
  • The first step of the algorithm is to divide the procedure into small fragments that, so that one fragment is different from others and each fragment has steps that are related to each other.

Similar questions