Associate Software Engineer

1. In detail about the OOPS concepts.
2. Inheritance types.
3. Explain static and dynamic memory allocation?
4. How to identify the head node in the Circular linked list?
5. What is join? Explain the types of joins?
6. What are primary key, unique key, and foreign key constraints?
7. Sorting techniques time complexity.
8. Explain about server-side mechanism?

You are given a Singly Linked List of integers and an integer 'K'.

Your task is to modify the linked list by inserting a new node after every 'K' node in the linked list with the node value being equal to the sum of the previous 'K' nodes.

Note :

If you reach a situation when the number of nodes remaining in the linked list is less than 'K' but greater than zero, just insert a node with the value equal to the sum of the remaining nodes.

The n-th term of Fibonacci series F(n), where F(n) is a function, is calculated using the following formula -

    F(n) = F(n - 1) + F(n - 2), 
    Where, F(1) = 1, F(2) = 1

Provided 'n' you have to find out the n-th Fibonacci Number. Handle edges cases like when 'n' = 1 or 'n' = 2 by using conditionals like if else and return what's expected.

"Indexing is start from 1"

Example :

Input: 6

Output: 8

Explanation: The number is ‘6’ so we have to find the “6th” Fibonacci number.
So by using the given formula of the Fibonacci series, we get the series:    
[ 1, 1, 2, 3, 5, 8, 13, 21]
So the “6th” element is “8” hence we get the output.

1. Explain how to find the distance between the points on the map in general terms?
2. Explain how a stack works?
3. What is normalisation? Briefly explain the normalisation types.
4. List OSI model layers and explain with a real-time example.