### Instruction

- This test contains a total of 15 questions.
- Do not switch the tab or open a new window, otherwise, the test will be submitted automatically.
- Test time is 10 minutes.

### Data Structures Intermediate (Level 1)

```
public void function(Node node)
{
if(size == 0)
head = node;
else
{
Node temp,cur;
for(cur = head; (temp = cur.getNext())!=null; cur = temp);
cur.setNext(node);
}
size++;
}
```

**The array has this property that every element in array is at most k distance from its position in sorted array where k is a positive integer smaller than size of array. Which sorting algorithm can be easily modified for sorting this array and what is the obtainable time complexity?**

**A list of n string, each of length n, is sorted into lexicographic order using the merge-sort algorithm.**

**Two matrices M1 and M2 are to be stored in arrays A and B respectively. Each array can be stored either in row-major or column-major order in contiguous memory locations.**

**The number of comparisons to find an element in this list that is neither maximum nor minimum is**