Centre for Development of Advanced Computing Interview Questions, Process, and Tips

Hi, test is easy but less time 25 questions 20 mintues 1/4 negative marking also, i did well and shortlisted for technical round interview , questions are easy and logic based questions mostly in test

Q1. In technical round asked about java and c programming questions few are spring boot html css and os relevant questions and sql database questions also that easy to moderate question
Add your answer

Q1. Hr round asked about tell me your self, why you choosing this job , salary and bond relevant thing . one of best round this, because its just asked about me and checked communication skills and knowing ab...read more
Add your answer

Q1. Lots of nlp questions
Add your answer
Q2. Lots of python questions
Add your answer

Round duration - 50 Minutes
Round difficulty - Medium

Round done by video call. Duration was 50 minutes. Total were 2 persons taking interview. They mostly asked questions related to Data Structure like OOPS and Stack. Later they start asking SQL queries and Machine Learning Questions.

Q1. Technical Questions
Retrieve the student details who have less then 50 marks in English subject from a student table.
Which Machine Learning model is best for classification?
Describe full working of Logestic...read more
Ans. 
Tip 1 : First give them the technique you will use to solve the question.
Tip 2 : make the final answer and say directly.
Answered by CodingNinjas
Add your answer
Q2. Add Two Numbers As Linked Lists
You are given two linked lists representing two non-negative numbers. The digits in the linked list are stored in reverse order, i.e. starting from least significant digit (...read more
Ans. Recursion
• A simple approach could be to recursively add the nodes of the linked list while keeping track of the carry generated.
• The idea behind this approach is the same as finding the sum of two numbers manually on a paper, where we start by adding the LSD and move on till the MSD. Also, keeping track of the carry generated in every iteration.
• As the linked lists represent the numbers in reverse order, the LSD occurs at...read more
Answered by CodingNinjas
View 2 more answers

Round duration - 30 Minutes
Round difficulty - Easy

Tech + HR round

Q1. Basic HR Questions
Why do you want this job?
What is your biggest achievement?
If you won 10 crore would you still work?
Add your answer
Q2. Remove Duplicates From String
You are given a string (STR) of length N, consisting of only the lower case English alphabet.
Your task is to remove all the duplicate occurrences of characters in the strin...read more
Ans. Brute Force Approach
Iterate for each character of the string. For each index, we run another loop starting from the beginning of the string upto that index, and check whether that character has occurred before. If so, we do not include this character in the final string.
Space Complexity: O(1)Explanation:
O(1)
 
Since we using constant extra space.
Time Complexity: O(n^2)Explanation:
O(N ^ 2), where N is the length of...read more
Answered by CodingNinjas
View 2 more answers

Q1. Details about Project Management
Add your answer
Q2. Asked more on Past completed projects
Add your answer

Technical and non technical questions

Q1. 1.java8 features 2.oops concept 3.collections 4.exception handling
Add your answer