Technical Assessment – Problem Statements

Choose one of the following problem statements and write a program to solve the problem in programming language mentioned in the respective job description. Send archive of program and associated project files to ( hr @ raykor.co.in).

The program will be assessed and if found acceptable, you will be called for the interview. Before the interview, you will be asked to update your program for a modified problem statement.

Problem statements:

1. Write a program to print INPUT XML on screen and formatted as in OUTPUT XML. Note that each XML node level is indented by one tab space in OUTPUT XML e.g. first node level (e.g. <name>) has 1 tab space, second node level (e.g. <employees>) has 2 tab spaces and so on.

INPUT XML:

<?xml version="1.0" encoding="UTF-8"?>
<company>
<name>Raykor Technologies PVT. Ltd.</name>
<employees>
<employee id="1">
<name>ABC PQR</name>
<address>
<line1>M G Road</line1>
<line2>Baner</line2>
<state>Maharashtra</state>
<city>Pune</city>
</address>
<phones>
<mobile>9876543210</mobile>
<landline>0209876543</landline>
</phones>
<education>
<degree>
<college>
<name>College of engineering</name>
<address>
<line1>M G Road</line1>
<line2>Baner</line2>
<state>Maharashtra</state>
<city>Pune</city>
</address>
</college>
</degree>
</education>
</employee>
</employees>
</company>

OUTPUT XML:

<?xml version="1.0" encoding="UTF-8"?>
<company>
    <name>Raykor Technologies PVT ltd</name>
    <employees>
        <employee id="1">
            <name>ABC PQR</name>
            <address>
                <line1> M G Road </line1>
                <line2> Baner </line2>
                <state> Maharashtra </state>
                <city> Pune </city>
            </address>
            <phones>
                <mobile> 9876543210 </mobile>
                <landline> 0209876543 </landline>
            </phones>
            <education>
                <degree>
                    <college>
                        <name>College of engineering</name>
                        <address>
                            <line1> M G Road </line1>
                            <line2> Baner </line2>
                            <state> Maharashtra </state>
                            <city> Pune </city>
                        </address>
                    </college>
                </degree>
            </education>
        </employee>
    </employees>
</company>

2. Write a program to find lowest number of integers in the array that sums up the given number. The program should ask user to input array of integers (“Input Array”) and the required sum (“Required Sum”). The output (“Output”) should list the lowest number of integers from the input array that sums up the “Required Sum”. ¬†Refer to examples given below.

Input :

  1. Array of integers
  2. Required sum

Output :

  1. Elements from array which makes sum equals to given value

Example:

Input Array : [10, 0, -1, 20, 25, 30]
Required Sum: 45
Output: [20, 25]

Required Sum: 59
Output: [10, -1, 20, 30]

Required Sum: 60
Output: [10, 20, 30]

3. Write a program to display value of each tree node starting from lowest node (H) till root node of the tree such that:

  1. Each node value is displayed on a separate line.
  2. Values of nodes are displayed from right to left e.g. in case of first level: E will be printed first before B or in case of second level, print order will be: G, F, D and C.
  3. Values of same level nodes are displayed first e.g. all nodes of last level will be printed before second-last level.
  4. Program should define class similar to as below given.
  5. Main class should contain logic to output the values.
  6. Each node should be visited only once.