Softcell Technologies Workshop Supervisor Interview Questions and Answers

Easy MCQ based on job type

Q1. Mostly Scenario based
Add your answer

Q1. Please tell your current CTC
Ans. 
My current CTC is confidential and I prefer not to disclose it.
• I am not comfortable sharing my current compensation details.

• I believe my value is based on my skills and experience, not my current salary.

• I am open to discussing salary expectations for this role.
Answered by AI
Add your answer
Q2. Please tell your expected CTC
Ans. 
I expect a competitive salary based on my experience, skills, and the responsibilities of the Senior Executive role.
• I have extensive experience in leading teams and driving business growth, which warrants a higher salary.

• I have a proven track record of successfully implementing strategic initiatives and achieving targets.

• I have strong negotiation and communication skills, which are valuable in senior executive roles.

• I ...read more
Answered by AI
Add your answer

Q1. About my experience and skills set
Add your answer

Q1. Explain sticky bit example
Ans. 
Sticky bit is a permission set on a directory to allow only the owner to delete or rename files within that directory.
• Sticky bit is represented by a 't' at the end of the permission string for a directory.

• It is commonly used on directories like /tmp to prevent users from deleting each other's files.

• Example: chmod +t /tmp
Answered by AI
Add your answer
Q2. /tmp is an example
Ans. 
The /tmp directory is a temporary directory used for storing temporary files in Unix-like operating systems.
• Used for storing temporary files

• Files in /tmp are typically deleted upon system reboot

• Should not be used for storing important data
Answered by AI
Add your answer

Aptitude and reasoning

Q1. About my skills and experience
Add your answer

Round duration - 30 minutes
Round difficulty - Medium

This was a MCQ round. 30 ques in 30 mins consisting of difficult quantitative aptitude questions were to be solved.

Round duration - 60 minutes
Round difficulty - Medium

In this test round, 2 coding questions were given. Either write the code or pseudo code

Q1. 
N Queens Problem
Given an integer N, find all possible placements of N queens on an N x N chessboard such that no two queens threaten each other.
Explanation:
A queen can attack another queen if they ar...read more
Ans. 
The N Queens Problem involves finding all possible placements of N queens on an N x N chessboard without threatening each other.
• Use backtracking algorithm to explore all possible configurations.

• Keep track of rows, columns, and diagonals to ensure queens do not threaten each other.

• Generate all valid configurations and print them out.
Answered by AI
Add your answer
Q2. 
Sort 0 1 2 Problem Statement
Given an integer array arr of size 'N' containing only 0s, 1s, and 2s, write an algorithm to sort the array.
Input:
The first line contains an integer 'T' representing the n...read more
Ans. 
Sort an array of 0s, 1s, and 2s in linear time complexity.
• Use three pointers to keep track of 0s, 1s, and 2s while traversing the array.

• Swap elements based on the values encountered to sort the array in-place.

• Time complexity should be O(N) and space complexity should be O(1).
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

This was a technical round with questions on DSA.

Q1. 
Reverse Words in a String: Problem Statement
You are given a string of length N. Your task is to reverse the string word by word. The input may contain multiple spaces between words and may have leading o...read more
Ans. 
Reverse words in a string while handling leading, trailing, and multiple spaces.
• Split the input string by spaces to get individual words

• Reverse the order of the words

• Join the reversed words with a single space in between
Answered by AI
Add your answer
Q2. 
Circular Linked List Detection
You are provided with the head of a linked list containing integers. Your task is to determine if the linked list is circular.
Note:
• A linked list is considered circula...read more
Ans. 
Detect if a given linked list is circular by checking if it forms a closed loop.
• Traverse the linked list using two pointers, one moving at double the speed of the other.

• If the two pointers meet at any point, the linked list is circular.

• If the faster pointer reaches the end of the list (NULL), the linked list is not circular.
Answered by AI
Add your answer

Round duration - 30 minutes
Round difficulty - Easy

HR round with typical behavioral problems.