Cadence Interview Experience | Software Developer C++ - GeeksforGeeks

04 Apr, 2019
Hi, I was recently interviewed for Software Developer position for Cadence Design Systems (Location: Bangalore) and got selected. I have 2.5-year experience in C++. Following were interview questions-
One telephonic round followed by 3 F2F interviews.
Round 1 (Telephonic Round):
Place even numbers at even indexes and odd numbers at odd indexes, given that the number of odd numbers may or may not be equal to the number of even numbers. Extra odd/even number should be placed at the end of the array.ExampleInput : arr[] = {3, 6, 12, 1, 5, 8}
Output : 6 3 12 1 8 5 

Input : arr[] = {10, 9, 7, 18, 12, 19, 4, 20, 6, 14}
Output : 10 9 18 7 20 19 4 12 14 6 
For an equal number of odd numbers and even numbers – even-numbers-even-index-odd-numbers-odd-indexFind the height of a treesum-minimum-maximum-elements-subarrays-size-kWhat all are the sorting algorithms do you know? Implement any sorting algorithm.
Place even numbers at even indexes and odd numbers at odd indexes, given that the number of odd numbers may or may not be equal to the number of even numbers. Extra odd/even number should be placed at the end of the array.ExampleInput : arr[] = {3, 6, 12, 1, 5, 8}
Output : 6 3 12 1 8 5 

Input : arr[] = {10, 9, 7, 18, 12, 19, 4, 20, 6, 14}
Output : 10 9 18 7 20 19 4 12 14 6 
For an equal number of odd numbers and even numbers – even-numbers-even-index-odd-numbers-odd-indexFind the height of a treesum-minimum-maximum-elements-subarrays-size-kWhat all are the sorting algorithms do you know? Implement any sorting algorithm.
Place even numbers at even indexes and odd numbers at odd indexes, given that the number of odd numbers may or may not be equal to the number of even numbers. Extra odd/even number should be placed at the end of the array.ExampleInput : arr[] = {3, 6, 12, 1, 5, 8}
Output : 6 3 12 1 8 5 

Input : arr[] = {10, 9, 7, 18, 12, 19, 4, 20, 6, 14}
Output : 10 9 18 7 20 19 4 12 14 6 
For an equal number of odd numbers and even numbers – even-numbers-even-index-odd-numbers-odd-indexFind the height of a treesum-minimum-maximum-elements-subarrays-size-kWhat all are the sorting algorithms do you know? Implement any sorting algorithm.
Place even numbers at even indexes and odd numbers at odd indexes, given that the number of odd numbers may or may not be equal to the number of even numbers. Extra odd/even number should be placed at the end of the array.ExampleInput : arr[] = {3, 6, 12, 1, 5, 8}
Output : 6 3 12 1 8 5 

Input : arr[] = {10, 9, 7, 18, 12, 19, 4, 20, 6, 14}
Output : 10 9 18 7 20 19 4 12 14 6 
For an equal number of odd numbers and even numbers – even-numbers-even-index-odd-numbers-odd-index
Input : arr[] = {3, 6, 12, 1, 5, 8}
Output : 6 3 12 1 8 5 

Input : arr[] = {10, 9, 7, 18, 12, 19, 4, 20, 6, 14}
Output : 10 9 18 7 20 19 4 12 14 6 

For an equal number of odd numbers and even numbers – even-numbers-even-index-odd-numbers-odd-index
Find the height of a tree
sum-minimum-maximum-elements-subarrays-size-k
What all are the sorting algorithms do you know? Implement any sorting algorithm.
Round 2 :
This round was completely based on C++ concepts.
How does the map [STL Library] work? What is the time complexity of its implementation? – Map in C++Above question leads to the red-black tree – it’s working and properties.What is a const member functions? –const-member-functions-cWhat is polymorphism? How it can be achieved in C++?Deep discussion on virtual function vtable and a virtual destructor with code. How memory allocation happens for parent object and child object. – virtual-function-c++Why virtual destructor is required? –  virtual-destructorFunctors-in-c++
How does the map [STL Library] work? What is the time complexity of its implementation? – Map in C++Above question leads to the red-black tree – it’s working and properties.What is a const member functions? –const-member-functions-cWhat is polymorphism? How it can be achieved in C++?Deep discussion on virtual function vtable and a virtual destructor with code. How memory allocation happens for parent object and child object. – virtual-function-c++Why virtual destructor is required? –  virtual-destructorFunctors-in-c++
How does the map [STL Library] work? What is the time complexity of its implementation? – Map in C++Above question leads to the red-black tree – it’s working and properties.What is a const member functions? –const-member-functions-cWhat is polymorphism? How it can be achieved in C++?Deep discussion on virtual function vtable and a virtual destructor with code. How memory allocation happens for parent object and child object. – virtual-function-c++Why virtual destructor is required? –  virtual-destructorFunctors-in-c++
How does the map [STL Library] work? What is the time complexity of its implementation? – Map in C++
Above question leads to the red-black tree – it’s working and properties.
What is a const member functions? –const-member-functions-c
What is polymorphism? How it can be achieved in C++?
Deep discussion on virtual function vtable and a virtual destructor with code. How memory allocation happens for parent object and child object. – virtual-function-c++
Why virtual destructor is required? –  virtual-destructor
Functors-in-c++
Round 3:
the kth largest element in an unsorted arrayDiscussion on the first question and leads to the implementation of the quicksort algorithm.How does heap sort work? Implement heap sort for the given array.
the kth largest element in an unsorted arrayDiscussion on the first question and leads to the implementation of the quicksort algorithm.How does heap sort work? Implement heap sort for the given array.
the kth largest element in an unsorted arrayDiscussion on the first question and leads to the implementation of the quicksort algorithm.How does heap sort work? Implement heap sort for the given array.
the kth largest element in an unsorted array
Discussion on the first question and leads to the implementation of the quicksort algorithm.
How does heap sort work? Implement heap sort for the given array.
Round 4:
merge-k-sorted-arrays-set-2-different-sized-arraysLong discussion on current work and project.
merge-k-sorted-arrays-set-2-different-sized-arraysLong discussion on current work and project.
merge-k-sorted-arrays-set-2-different-sized-arraysLong discussion on current work and project.
merge-k-sorted-arrays-set-2-different-sized-arrays
Long discussion on current work and project.
At last HR round was done next week. Received offer.
Cadence India
Marketing
Experienced
Interview Experiences
Cadence India
Writing code in comment?
Please use ide.geeksforgeeks.org,
generate link and share the link here.
Amazon Interview Experience for SDE1 (8 Months Experienced) 2022
Morgan Stanley Interview for Software Engineer Manager (Experienced 2021)
Goldman Sachs Interview for Java Developer in Hong Kong (10 Years Experienced)
Amazon Interview Experience for System Development Engineer (Exp - 6 months)
Microsoft Interview Experience | 4 Years Experienced
Commonly Asked Java Programming Interview Questions | Set 2
Amazon Interview Questions
Microsoft Interview Experience for Internship (Via Engage)
Amazon Interview Experience for SDE-1 (On-Campus)
Amazon Interview Experience for SDE-1