Software Engineer

Given an array ARR of N integers and an integer S. The task is to find whether there exists a subarray(positive length) of the given array such that the sum of elements of the subarray equals to S or not. If any subarray is found, return the start and end index (0 based index) of the subarray. Otherwise, consider both the START and END indexes as -1.

Note:

If two or more such subarrays exist, return any subarray.

For Example: If the given array is [1,2,3,4] and the value of S is equal to 7. Then there are two possible subarrays having sums equal to S are [1,2,3] and [3,4].

Explain Thrashing .
Explain segmentation
State deadlock detection and prevention methods.
Explain dinning philosopher problem
Explain page fault with example.

Write a query from an employee table to find the salaries of the employees having even emp -id number 
Explain 2,3- tier architecture and explain vies in DBMS.
Explain serialization
Explain ACID properties
Define primary keys and foreign key
State all the joins

The interviewer discussed about my final year project about the technologies used ,which papers i have referred whats my role in the project and the scope of the project in current market.

Describe who you are? or Tell me about your background. 

What are your strengths and weaknesses?