Aspire Systems Web Developer Interview Questions and Answers

Nees to create an Assignment within a give time slot my was from 9am - 4pm and need to create a CRUD app small that can have update delete and insert function

Q1. It was about MYSQL query and how to slove if multiple data fetch request come through and how the server will handle load balancing
Add your answer

Q1. What are your salary expectations?
Add your answer
Q2. What is your family background?
Add your answer
Q3. What are your strengths and weaknesses?
Add your answer
Q4. Tell me about yourself.
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

On-Campus under the invigilation of College professors and campus placement ambassadors.

Q1. 
Count Subsequences Problem Statement
Given an integer array ARR of size N, your task is to find the total number of subsequences in which all elements are equal.
Explanation:
A subsequence of an array i...read more
Ans. Brute Force
The idea is to generate all the subsequences and check whether the elements present are equal or not.
 
Here is the algorithm :
 
1. Generate all the subsequences of the given array.
2. Maintain a variable ‘COUNT’ which stores the total number of subsequences in which all the elements are equal.
3. Iterate over each of the generated subsequences.
   1. In case all the elements of the current subsequence are equal, we in...read more
Answered Anonymously
Add your answer
Q2. 
Reverse Linked List Problem Statement
Given a singly linked list of integers, return the head of the reversed linked list.
Example:
Initial linked list: 1 -> 2 -> 3 -> 4 -> NULL
Reversed link...read more
Ans. Brute Force
The brute force approach is to use recursion. First, we reach the end of the Linked List recursively and at last node, we return the last node, which becomes the new head of the partially reversed Linked List. While coming back from each recursion call we add the current node in the current recursion call to the last node of the partially reversed Linked List and assign the current node to null.
 
Steps:
&...read more
Answered Anonymously
Add your answer

Round duration - 30 minutes
Round difficulty - Medium

Q1. How would you automate the process of searching for profiles using a database of stored mobile numbers and email addresses?
Add your answer

Round duration - 20 minutes
Round difficulty - Easy