CDW Interview Questions and Answers

Q1. What are hooks, sql related basic questions, waits in selenium. Limitations of selenium
Add your answer
Q2. Behavioural test questions
Add your answer

It had normal quants questions. Those questions were reasonably tough and not too irrelevant. It also contained Java technical MCQs, Linux commands.

There were 3 coding questions conducted on a purchased platform. 1 question was related to strings. Another one related to Linked list (DS). Other one was a complex problem.

Q1. Related to HTML, CSS
Add your answer
Q2. A problem to solve using recursion
Add your answer
Q3. Linked list reversal - problem solving
Add your answer
Q4. Garbage collector in java
Ans. 
Garbage collector in Java is responsible for automatically managing memory by reclaiming unused objects.
• Garbage collector runs in the background to reclaim memory from objects that are no longer in use.

• It helps prevent memory leaks and optimize memory usage.

• Examples of garbage collectors in Java include Serial, Parallel, CMS, and G1.
Answered by AI
Add your answer
Q5. Final keyword, finally block, finalize method
Add your answer
Q6. SQL query - problem solving
Add your answer

Q1. A panel of 5 members questioned me regarding OOPS designing, my project related questions, puzzles
Add your answer
Q2. Questions regarding normalization
Add your answer
Q3. An extempore on a given topic
Add your answer
Q4. General personal HR questions
Add your answer

Q1. Basics of Rest API
Add your answer

The aptitude round consists of quantitative, technical questions mainly from java ,oops, ds concepts , some from os . Negative marking was there with 0.25 mark deduction.

It consists of three coding questions and that was pretty much easy . 1st qn is easy and so is the 2nd question . Third question is kind of medium level (but not so tough ) . It was a question related to doubly linked list . 1st and 2nd were array and string questions. We had this in pen and paper format , not in ids .

Q1. This is a technical hr one on one interview. It only depends based on your resume and in depth technical questions related to that. Hr would be well versed in those fields. There would be 3-4 Hrs and any o...read more
Add your answer

Q1. It is a in depth technical hr round . There will be panel of 4 technical hr . They will ask questions based on your resume and according to their knowledge in that field. Each will have a storng knowledge ...read more
Add your answer

Q1. About how my day to day looks like.
Add your answer

Q1. About my job roles and the work around.
Add your answer

Q1. Date of joining
Add your answer

More of technical and aptitude mcqs

Written test easy coding questions

Q1. More on DAS and basic fundamentals on CNS and DBMS
Add your answer

Q1. I was not selected for this round
Add your answer

Numerical Reasoning: Numerical reasoning tests assess your ability to interpret and analyze numerical data. They often involve questions related to arithmetic, percentages, ratios, and data interpretation. Candidates may be required to perform calculations, analyze graphs or tables, and draw conclusions based on numerical information.

Verbal Reasoning: Verbal reasoning tests evaluate your ability to understand and analyze written information. They typically include questions on reading comprehension, vocabulary, grammar, and logical reasoning based on written passages or statements. Candidates may need to identify key information, draw inferences, and evaluate arguments presented in the text.

Logical Reasoning: Logical reasoning tests measure your ability to analyze patterns, relationships, and logical sequences. These tests may include questions on deductive reasoning, syllogisms, analogies, and pattern recognition. Candidates are often asked to identify the next item in a sequence, complete a series, or determine the validity of logical arguments.

Topics: Coding tests typically cover a range of programming topics, including:

Data Structures: Arrays, linked lists, stacks, queues, trees, graphs, hash tables, etc.
Algorithms: Sorting algorithms, searching algorithms, dynamic programming, recursion, graph algorithms, etc.
Problem-Solving: Candidates may be asked to solve algorithmic problems, implement specific algorithms, or write code to solve real-world problems.