AmbitionBox
Interview Questions
- Reviews
- Salaries
- Interview Questions
- About Company
- Benefits
- Jobs
- Office Photos
- Community
i
Calsoft
Work with us 
Compare
Filter interviews by
Calsoft Computer Programmer Interview Questions and Answers
6 Interview questions
Sub-typing is a concept in programming where a derived class inherits properties and behaviors from a base class.
Sub-typing allows for code reuse and promotes modularity.
In multiple inheritance, the order of solving is determined by the order of inheritance in the class definition.
For example, if a class inherits from two base classes A and B, and both have a method with the same name, the method from class A will...
VirtualBox is a virtualization software that allows running multiple operating systems on a single physical machine.
VirtualBox is an open-source virtualization software developed by Oracle.
It allows users to create and run virtual machines on their computer.
VirtualBox supports various operating systems including Windows, Linux, and macOS.
It provides features like snapshotting, which allows saving the state of a vi...
Python uses automatic memory management through a process called garbage collection.
Python uses reference counting to keep track of objects in memory.
When an object's reference count reaches zero, it is automatically deallocated.
Python also employs a garbage collector to handle cyclic references.
Memory management in Python is transparent to the programmer.
Django is a high-level Python web framework that follows the model-view-controller architectural pattern.
Django uses the MTV (Model-Template-View) architectural pattern.
It provides a robust set of tools and libraries for building web applications.
Django follows the DRY (Don't Repeat Yourself) principle, promoting code reusability.
It includes an ORM (Object-Relational Mapping) layer for database operations.
Django s...
A dictionary program that stores and retrieves words and their definitions.
Use an array of strings to store the words and their definitions.
Implement functions to add new words, retrieve definitions, and update existing definitions.
Consider using a hash table or a trie data structure for efficient word lookup.
Handle cases where multiple definitions or synonyms exist for a word.
Django memory is managed through garbage collection and reference counting.
Django uses a combination of garbage collection and reference counting to manage memory.
Garbage collection automatically frees up memory by identifying and removing objects that are no longer in use.
Reference counting keeps track of the number of references to an object and deallocates it when the count reaches zero.
Django's memory manageme...
Calsoft Computer Programmer Interview Experiences
1 interview found
I appeared for an interview in Jun 2017.
Interview Questionnaire
11 Questions
- Q1. What is Sub-typing and order of solving multiple inheritance
- Ans.
Sub-typing is a concept in programming where a derived class inherits properties and behaviors from a base class.
Sub-typing allows for code reuse and promotes modularity.
In multiple inheritance, the order of solving is determined by the order of inheritance in the class definition.
For example, if a class inherits from two base classes A and B, and both have a method with the same name, the method from class A will be c...
- Q2. Decorators,iterators and generators
- Q3. Some small programs on list dictionary and tuples
- Q4. Lambda functions,map reduce and filter
- Q5. How memory is managed in python
- Ans.
Python uses automatic memory management through a process called garbage collection.
Python uses reference counting to keep track of objects in memory.
When an object's reference count reaches zero, it is automatically deallocated.
Python also employs a garbage collector to handle cyclic references.
Memory management in Python is transparent to the programmer.
- Q6. Hashing
- Q7. How Django framework works
- Ans.
Django is a high-level Python web framework that follows the model-view-controller architectural pattern.
Django uses the MTV (Model-Template-View) architectural pattern.
It provides a robust set of tools and libraries for building web applications.
Django follows the DRY (Don't Repeat Yourself) principle, promoting code reusability.
It includes an ORM (Object-Relational Mapping) layer for database operations.
Django suppor...
- Q8. How Django memory is managed and many more
- Ans.
Django memory is managed through garbage collection and reference counting.
Django uses a combination of garbage collection and reference counting to manage memory.
Garbage collection automatically frees up memory by identifying and removing objects that are no longer in use.
Reference counting keeps track of the number of references to an object and deallocates it when the count reaches zero.
Django's memory management he...
- Q9. Many more on python and django
- Q10. Concept of virtual box in python
- Ans.
VirtualBox is a virtualization software that allows running multiple operating systems on a single physical machine.
VirtualBox is an open-source virtualization software developed by Oracle.
It allows users to create and run virtual machines on their computer.
VirtualBox supports various operating systems including Windows, Linux, and macOS.
It provides features like snapshotting, which allows saving the state of a virtual...
- Q11. Dictionary program
- Ans.
A dictionary program that stores and retrieves words and their definitions.
Use an array of strings to store the words and their definitions.
Implement functions to add new words, retrieve definitions, and update existing definitions.
Consider using a hash table or a trie data structure for efficient word lookup.
Handle cases where multiple definitions or synonyms exist for a word.
Interview Preparation Tips
Experience: I was answered all the questions .
even it was bit difficult round starting from all the python basic to advanced topics.
My first round ended after 45-50 minutes.
despite of 1 or 2 wrong answers selected for second round
Round: Technical Interview
Experience: This round lasts for 20 minutes.
As I didn't provide satisfactory answers on Django was rejected from this round
Skills evaluated in this interview
Top trending discussions
Interview questions from similar companies
Software Developer Interview Questions & Answers
Bounteous x Accolite
Anonymous
posted on 11 Mar 2022
I appeared for an interview before Mar 2021.
(3 Questions)
Round duration - 60 minutes
Round difficulty - Medium
21 students were shortlisted from the 1st MCQ round and in this round we were asked to write the codes (function only) of 3 questions in 1 hour time.
- Q1.
Rotting Oranges Problem Statement
You are given a grid containing oranges where each cell of the grid can contain one of the three integer values:
- 0 - representing an empty cell
- 1 - representing a fre...
- Ans.
Find the minimum time required to rot all fresh oranges in a grid.
Use Breadth First Search (BFS) to simulate the rotting process
Track the time taken to rot all oranges and return -1 if any fresh oranges remain
Handle edge cases like no fresh oranges or all oranges already rotten
Consider using a queue to efficiently process adjacent oranges
- Q2.
Majority Element Problem Statement
Given an array/list 'ARR' consisting of 'N' integers, your task is to find the majority element in the array. If there is no majority element present, return -1.
Exampl...
- Ans.
Find the majority element in an array, return -1 if no majority element exists.
Iterate through the array and keep track of the count of each element using a hashmap.
Check if any element's count is greater than floor(N/2) to determine the majority element.
Return the majority element or -1 if no majority element exists.
- Q3.
Maximum Path Sum Between Two Leaves Problem Description
You are provided with a non-empty binary tree in which each node contains a non-negative integer value. Your task is to find and return the maximum ...
- Ans.
Find the maximum path sum between two leaf nodes in a binary tree.
Traverse the tree to find the maximum path sum between two leaf nodes.
Keep track of the maximum sum found so far.
Consider all possible paths between leaf nodes.
Handle cases where the tree has only a single leaf node.
Implement a recursive function to calculate the maximum path sum.
(3 Questions)
Round duration - 60 minutes
Round difficulty - Medium
This was a technical round with DSA based questions.
- Q1.
N-th Node From The End Problem Statement
You are given a Singly Linked List of integers. The task is to find the N-th node from the end of the list.
Example:
Input:
If the given list is (1 -> -2 -&g...
- Ans.
Find the N-th node from the end of a Singly Linked List of integers.
Traverse the list to find the length L of the list.
Calculate the position of the N-th node from the beginning as L - N + 1.
Traverse the list again to reach the calculated position and return the node's value.
- Q2.
LCA of Binary Tree Problem Statement
You are given a binary tree consisting of distinct integers and two nodes,
XandY. Your task is to find and return the Lowest Common Ancestor (LCA) of these two nodes... - Ans.
Find the Lowest Common Ancestor (LCA) of two nodes in a binary tree.
Traverse the binary tree to find the paths from the root to nodes X and Y.
Compare the paths to find the last common node, which is the LCA.
Handle cases where one node is an ancestor of the other or when one node is the LCA itself.
- Q3.
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... - Ans.
Reverse words in a string while handling leading/trailing spaces and multiple spaces between words.
Split the input string by spaces to get individual words
Reverse the list of words
Join the reversed words with a single space in between
Handle leading/trailing spaces by stripping them before and after reversing
(3 Questions)
Round duration - 60 minutes
Round difficulty - Easy
Technical Interview round with questions based on DSA
- Q1.
Minimum Time To Solve The Problems
Given 'N' subjects, each containing a certain number of problems, and 'K' friends, assign subjects to friends such that each subject goes to exactly one friend, maintain...
- Ans.
Assign subjects to friends to minimize maximum workload, find minimum time for most loaded friend.
Sort subjects in descending order
Assign subjects to friends one by one until all subjects are assigned
The maximum workload will be the sum of problems assigned to the friend with the most problems
Return the maximum workload as the minimum time required
- Q2. What is grammar in the context of compiler design?
- Ans.
Grammar in compiler design defines the syntax and structure of a programming language.
Grammar specifies the rules for forming valid statements in a programming language.
It consists of a set of production rules that define how valid programs can be constructed.
There are different types of grammars such as context-free grammar, regular grammar, etc.
Example: In C programming language, the grammar specifies that a for loop...
- Q3. What is a token in compiler design?
- Ans.
A token in compiler design is a basic unit of syntax that the compiler can understand and process.
Tokens are the smallest units of a program that are meaningful to the compiler.
Examples of tokens include keywords, identifiers, operators, and punctuation symbols.
Tokens are generated by the lexical analysis phase of the compiler.
Tokens are used by the parser to build the abstract syntax tree of the program.
(3 Questions)
Round duration - 60 minutes
Round difficulty - Easy
Technical round with questions on DSA and Compiler Design mainly. He told me that you’ll be having your final HR round in some time. I knew that I was going well because he seemed to be quite satisfied with my answers.
- Q1.
Sum Root to Leaf Numbers
You are given an arbitrary binary tree consisting of N nodes, each associated with an integer value from 1 to 9. Each root-to-leaf path can be considered a number formed by concat...
- Ans.
Find the total sum of all root to leaf paths in a binary tree formed by concatenating node values.
Traverse the binary tree from root to leaf nodes, keeping track of the current path sum
Add the current path sum to the total sum when reaching a leaf node
Use modulo (10^9 + 7) to handle large outputs
- Q2. What is a regular language?
- Ans.
A regular language is a language that can be recognized by a finite automaton.
Regular languages can be described by regular expressions.
Regular languages are closed under union, concatenation, and Kleene star operations.
Examples of regular languages include the set of all strings over an alphabet that contain an even number of 'a's.
- Q3. What are NP and NP-Hard problems?
- Ans.
NP problems are decision problems that can be verified in polynomial time, while NP-Hard problems are at least as hard as the hardest problems in NP.
NP problems can be verified in polynomial time but not necessarily solved in polynomial time.
NP-Hard problems are at least as hard as the hardest problems in NP, but may not be in NP themselves.
Examples of NP problems include the subset sum problem and the traveling salesm...
Round duration - 30 minutes
Round difficulty - Easy
That was the round for which I’ve been waiting for hours
She was very friendly and nice to talk to. It didn’t seem that I was talking to the HR. It was more like talking to a friend. Finally we discussed about the pay-scale and work culture in Accolite.
Interview Preparation Tips
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
Skills evaluated in this interview
Software Developer Interview Questions & Answers
Bounteous x Accolite
Anonymous
posted on 24 Jan 2022
I applied via Campus Placement and was interviewed before Jan 2021. There were 3 interview rounds.
Interview Questionnaire
3 Questions
- Q1. 1. Write a code to split an array of integers into two subarray where both the array has equal sum.
- Ans.
Code to split an array of integers into two subarrays with equal sum.
Iterate through the array and calculate the total sum.
Divide the sum by 2 to get the target sum for each subarray.
Use dynamic programming to find a subset of the array that adds up to the target sum.
Return the two subarrays.
Example: [1, 2, 3, 4, 5, 6] -> [1, 2, 3, 6], [4, 5]
Example: [1, 2, 3, 4, 5] -> [1, 4, 5], [2, 3]
- Q2. To write code to build up a binary tree from scratch (implement a BST) and then to write all the methods like all the tree traversal algo, and all other stuffs.
- Ans.
Implementing a binary search tree and its traversal methods.
Start by defining a Node class with left and right child pointers.
Implement insert() method to add nodes to the tree.
Implement inorder(), preorder(), and postorder() traversal methods.
Implement search() method to find a node in the tree.
Implement delete() method to remove a node from the tree.
Consider edge cases like empty tree, duplicate nodes, etc.
- Q3. Other OOPs concept and questions related to DSA and OS.
Interview Preparation Tips
Skills evaluated in this interview
Interview Questionnaire
1 Question
- Q1. Java multithreading, oops
Software Developer Interview Questions & Answers
Quantiphi Analytics Solutions Private Limited
Anonymous
posted on 29 Nov 2021
I appeared for an interview before Nov 2020.
(1 Question)
Round duration - 90 Minutes
Round difficulty - Medium
- Q1.
Fruits and Baskets Problem Statement
You are given 'n' fruit trees planted along a road, numbered from 0 to n-1. Each tree bears a fruit type represented by an uppercase English alphabet. A Ninja walking ...
- Ans.
The problem is to find the maximum number of fruits the Ninja can put in both baskets after satisfying given conditions.
The Ninja can start at any tree and end at any tree, but cannot skip a tree.
He can pick one fruit from each tree until he cannot, i.e., when he has to pick a fruit of the third type.
The restriction is that each basket can have only one type of fruit.
We need to find the maximum number of fruits that ca...
(1 Question)
Round duration - 30 Minutes
Round difficulty - Medium
Was Shortlisted For this round with in total of 22 students, 7 in my profile.
It was Technical round with 30 mins of time allotted.
The interviewer was friendly, started with basic questions about me followed by project specific and then a puzzle.
- Q1.
Sort 0 1 2 Problem Statement
Given an integer array
arrof 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... - Ans.
The problem requires sorting an array of 0s, 1s, and 2s in a single scan.
Use three pointers to keep track of the positions of 0s, 1s, and 2s.
Initialize the low pointer at the beginning of the array and the high pointer at the end.
Iterate through the array using a current pointer and swap elements based on their values.
Move the pointers accordingly until the array is sorted.
The time complexity of this solution is O(N) a...
Round duration - 20 Minutes
Round difficulty - Hard
The interview was scheduled for 15 mins and 12 students were shortlisted for this round. 5 in my profile.
The interviewer didn't on his video whereas mine was, the interviewer was friendly and maintained a poker voice.
Asked Basic HR questions but crossed questioned several times.
Interview Preparation Tips
Tip 1 :Practice at least 3-4 coding questions daily. Start from basics of Pointers and Array and progress to Algo and Data structure specific like DP and Graphs. Try to time your sessions into 15-20 mins.
Tip 2 : Have Patience don't rush into problem solving, understand the Algo/Data structure first and then look for common problems for a particular Algo/Data structure.
Tip 3 : Have Basic Knowledge about all CS subjects, no need for in depth. Just cover Top 100 interview questions for each subject and topics covered in GFG and CodeStudio.
Tip 1 : Have at least 3-4 Projects in your resume but on diverse bases, like 1 ML based, 1-2 DBMS 1 with Computer vision/ Frontend. Don't obsess over internships so much.
Tip 2 : Be well verse with projects you put in resume, and specify your particular job role if a team project.
Tip 3 : Mention some extra curricular activities or Interests and hobbies (Non Tech) , if you sync with interviewer then it could be beneficial.
Skills evaluated in this interview
I applied via Campus Placement and was interviewed in Mar 2024. There was 1 interview round.
(1 Question)
- Q1. Basic question on node js and nestjs with experience
(2 Questions)
- Q1. Basic of OPPs concept and logic to write code, state Management, basics coding
- Q2. Kotlin : Coroutines, threading, multi threading
Selected
I applied via LinkedIn and was interviewed before Jul 2023. There were 2 interview rounds.
(2 Questions)
- Q1. Promise and async await difference
- Ans.
Promises are objects representing the eventual completion or failure of an asynchronous operation, while async/await is a syntactic sugar for working with promises.
Promises are used for handling asynchronous operations and provide a way to chain multiple asynchronous operations together.
Async/await is a newer syntax that makes working with promises easier by allowing you to write asynchronous code that looks synchronou...
- Q2. Array questions
String manipulation question asked
Skills evaluated in this interview
Rahul Wasatkar
(1 Question)
- Q1. Springboot Application run method internal working, all annotations, map internal working, enableAutoconfiguration
(2 Questions)
- Q1. What is closure
- Ans.
Closure is a function that has access to its own scope, as well as the scope in which it was defined.
Closure allows a function to access variables from its outer scope even after the outer function has finished executing.
It helps in maintaining state in functional programming.
Example: function outerFunction() { let outerVar = 'I am outer'; return function innerFunction() { console.log(outerVar); }; }
- Q2. What are life cycle hooks in angular
- Ans.
Life cycle hooks in Angular are functions that allow you to tap into the lifecycle of a component or directive.
Life cycle hooks are methods that are called at specific points in the life cycle of a component or directive.
They allow you to perform actions at key points, such as when the component is created, rendered, or destroyed.
Examples of life cycle hooks include ngOnInit, ngOnChanges, ngOnDestroy, etc.
Skills evaluated in this interview
Calsoft Interview FAQs
Tell us how to improve this page.
Calsoft Interviews By Designations
- Calsoft Golang Developer Interview Questions
- Calsoft Talent Acquisition Executive Interview Questions
- Calsoft Development Engineer Interview Questions
- Calsoft Software Development Engineer Interview Questions
- Calsoft Devops Engineer Interview Questions
- Calsoft Senior Development Engineer Interview Questions
- Calsoft Senior Software Developer Interview Questions
- Calsoft Software Developer Interview Questions
- Show more
Interview Questions for Popular Designations
Interview Questions from Similar Companies
|
Development Engineer
325
salaries
|  ₹3 L/yr - ₹11.2 L/yr |
|
Senior Development Engineer
228
salaries
| ₹5.5 L/yr - ₹17 L/yr |
|
Softwaretest Engineer
132
salaries
| ₹3 L/yr - ₹6.7 L/yr |
|
Senior Software Engineer
122
salaries
| ₹7 L/yr - ₹27.2 L/yr |
|
Principal Development Engineer
122
salaries
| ₹10 L/yr - ₹36 L/yr |
ITC Infotech
CMS IT Services
KocharTech
Xoriant
- Home >
- Interviews >
- Calsoft Interview Questions
