Yamaha Motors Solutions Software Engineer Interview Questions and Answers

Mcq regarding c++ and java and coding question regarding count no of words

Q1. As about the dbms , inheritance concept , abstraction vs interface
Add your answer

Approx 45 min.
the aptitude section had quantitative and verbal reasoning questions.

Q1. Approx 1.5 h. the technical section had questions for c++, java, opps, dbms, cn, ds etc.
Add your answer
Q2. Introduction Family Background Hobbies SDLC Count Frequency Foreign Key
Add your answer
Q3. Tell me About your Projects
Ans. 
I have worked on various projects including a mobile app for tracking fitness goals and a web application for managing inventory.
• Developed a mobile app using React Native to track fitness goals and provide personalized workout plans.

• Built a web application using Django to manage inventory, track stock levels, and generate reports.

• Collaborated with a team to develop a chatbot using natural language processing for custom
Answered by AI
Add your answer
Q4. Write a program of Insertion sort
Ans. 
Insertion sort is a simple sorting algorithm that builds the final sorted array one item at a time.
• Start with the second element and compare it with the first element, swap if necessary

• Move to the third element and compare it with the second and first element, swap if necessary

• Repeat until all elements are sorted
Answered by AI
Add your answer
Q5. Do you know about Quick Sort
Ans. 
Quick Sort is a sorting algorithm that uses divide and conquer approach to sort elements in an array.
• It is a recursive algorithm

• It selects a pivot element and partitions the array around the pivot

• It has an average time complexity of O(nlogn)

• It is widely used in practice due to its efficiency
Answered by AI
Add your answer
Q6. Do you know about binary search
Ans. 
Binary search is a search algorithm that finds the position of a target value within a sorted array.
• It works by repeatedly dividing in half the portion of the array that could contain the target value.

• It has a time complexity of O(log n).

• It is more efficient than linear search for large arrays.

• Example: Searching for the number 7 in the sorted array [1, 3, 4, 5, 7, 9, 10] would return index 4.
Answered by AI
Add your answer

General aptitude test including coding questions

Q1. General HR questions
Add your answer

Q1. Complete questions from each technology mentioned in resume
Add your answer

Q1. Background question and why do you want to join the company
Add your answer