###### Data-Structures

October 3, 2023###### Functional-Dependency

October 3, 2023# Data-Structures

Question 266 |

In an array of 2N elements that is both 2-ordered and 3-ordered, what is the maximum number of positions that an element can be from its position if the array were 1-ordered?

1 | |

2 | |

N/2 | |

2N-1 |

Question 266 Explanation:

Given data,

Array=2N elements

Elements are used 2-ordered and 3-ordered

Step-1: If array used 2-ordered, if it contains an element which is at most two positions away

from its original position in a sorted array.

Sep-2: Maximum number of positions that an element can be from its position if the array were

1-ordered = 1

Array=2N elements

Elements are used 2-ordered and 3-ordered

Step-1: If array used 2-ordered, if it contains an element which is at most two positions away

from its original position in a sorted array.

Sep-2: Maximum number of positions that an element can be from its position if the array were

1-ordered = 1

Correct Answer: D

Question 266 Explanation:

Given data,

Array=2N elements

Elements are used 2-ordered and 3-ordered

Step-1: If array used 2-ordered, if it contains an element which is at most two positions away

from its original position in a sorted array.

Sep-2: Maximum number of positions that an element can be from its position if the array were

1-ordered = 1

Array=2N elements

Elements are used 2-ordered and 3-ordered

Step-1: If array used 2-ordered, if it contains an element which is at most two positions away

from its original position in a sorted array.

Sep-2: Maximum number of positions that an element can be from its position if the array were

1-ordered = 1