System Engineer

You are given an integer 'N'.

Return the summation of its multiplication table up to 10.

For Example :

Let 'N' = 5.
The multiplication table of 5 up to 10 is: 5, 10, 15, 20, 25, 30, 35, 40, 45, 50.
The summation is 5 + 10 + 15 + 20 + 25 + 30 + 35 + 40 + 45 + 50 = 275.
Therefore, the answer is 275.

You are given a string 'S' of length 'N', you need to find the frequency of each of the characters from ‘a’ to ‘z’ in the given string.

Example :

Given 'S' : abcdg
Then output will be : 1 1 1 1 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 

Given a sequence of numbers ‘ARR’. Your task is to return a sorted sequence of ‘ARR’ in non-descending order with help of the merge sort algorithm.

Example :

Merge Sort Algorithm -

Merge sort is a Divide and Conquer based Algorithm. It divides the input array into two-parts, until the size of the input array is not ‘1’. In the return part, it will merge two sorted arrays a return a whole merged sorted array.

The above illustrates shows how merge sort works.

Note :

It is compulsory to use the ‘Merge Sort’ algorithm.

Write code to implement OOP concepts.

1. What is the difference between ArrayList and LinkedList in the Java Collection framework? (Learn)
2. How do you add an element to a LinkedList using an index, and how is that element stored in memory internally?
3. Which is better to use: ArrayList or LinkedList?
4. When is it better to use a LinkedList over an ArrayList?

1. Give an introduction.
2. Explain your final year project.
3. Talk about your strengths and weaknesses.
4. Discuss relocation and night shifts.
5. Talk about your family background.
6. Describe your achievements during your engineering degree.