Datasoft Application Software India Interview Questions and Answers

Round duration - 90 minutes
Round difficulty - Medium

It was Technical + Aptitude MCQ round.The technical section consisted if MCQ related to DSA,OS,DBMS.The aptitude section consisted of questions related to basic mathematics.

Q1. 
Candies Distribution Problem Statement
Prateek is a kindergarten teacher with a mission to distribute candies to students based on their performance. Each student must get at least one candy, and if two s...read more
Ans. 
The task is to distribute candies to students based on their performance while minimizing the total candies distributed.
• Create an array to store the minimum candies required for each student.

• Iterate through the students' ratings array to determine the minimum candies needed based on the given criteria.

• Consider the ratings of adjacent students to decide the number of candies to distribute.

• Calculate the total candies req...read more
Answered by AI
Add your answer

Round duration - 30 minutes
Round difficulty - Medium

It was a technical interview testing the basic skills of OS and DBMS of candidates along with few project discussions from your CV.

Q1. Can you write 15 Linux commands along with their functions?
Ans. 
List of 15 Linux commands with their functions
• ls - list directory contents

• pwd - print working directory

• cd - change directory

• mkdir - make a new directory

• rm - remove files or directories

• cp - copy files and directories

• mv - move or rename files and directories

• grep - search for patterns in files

• chmod - change file permissions

• ps - display information about running processes

• top - display and update sorted information about pr...read more
Answered by AI
Add your answer
Q2. What are DDL (Data Definition Language) and DML (Data Manipulation Language)?
Ans. 
DDL is used to define the structure of database objects, while DML is used to manipulate data within those objects.
• DDL includes commands like CREATE, ALTER, DROP to define database objects like tables, indexes, etc.

• DML includes commands like INSERT, UPDATE, DELETE to manipulate data within tables.

• Example of DDL: CREATE TABLE employees (id INT, name VARCHAR(50));

• Example of DML: INSERT INTO employees VALUES (1, 'John Doe
Answered by AI
Add your answer

Round duration - 120 Minutes
Round difficulty - Easy

The round was conducted in day around 3PM.

Q1. 
Partition Equal Subset Sum Problem
Given an array ARR consisting of 'N' positive integers, determine if it is possible to partition the array into two subsets such that the sum of the elements in both sub...read more
Ans. 
The problem is to determine if it is possible to partition an array into two subsets with equal sum.
• Use dynamic programming to solve this problem efficiently.

• Create a 2D array to store the results of subproblems.

• Check if the sum of the array is even before attempting to partition it.

• Iterate through the array and update the 2D array based on the sum of subsets.

• Return true if a subset with half the sum is found, false ot
Answered by AI
Add your answer

Round duration - 30 Minutes
Round difficulty - Easy

The interview was preponed and was conducted at 9AM.
The interviewer was friendly and I had saw him earlier at pre-placement talk.

Q1. 
Convert Sentence to Pascal Case
Given a string STR, your task is to remove spaces from STR and convert it to Pascal case format. The function should return the modified STR.
In Pascal case, words are con...read more
Ans. 
Convert a given string to Pascal case format by removing spaces and capitalizing the first letter of each word.
• Iterate through each character in the string

• If the character is a space, skip it

• If the character is not a space and the previous character is a space or it is the first character, capitalize it
Answered by AI
Add your answer
Q2. Write an SQL query to retrieve the Nth highest salary from a database.
Ans. 
SQL query to retrieve the Nth highest salary from a database
• Use the ORDER BY clause to sort salaries in descending order

• Use the LIMIT clause to retrieve the Nth highest salary

• Consider handling cases where there might be ties for the Nth highest salary
Answered by AI
Add your answer

Round duration - 30 Minutes
Round difficulty - Easy

This round was conducted 15mins after 1st round.

Q1. 
Remove the Kth Node from the End of a Linked List
You are given a singly Linked List with 'N' nodes containing integer data and an integer 'K'. Your task is to delete the Kth node from the end of this Lin...read more
Ans. 
Remove the Kth node from the end of a singly linked list.
• Traverse the list to find the length 'N'.

• Calculate the position of the node to be removed from the beginning as 'N - K + 1'.

• Remove the node at the calculated position.

• Handle edge cases like removing the head or tail of the list.

• Update the pointers accordingly after removal.
Answered by AI
Add your answer