Toshiba Software India Engineer Trainee Interview Questions and Answers

Q1. Let us assume we have an array of 0's and 1's,how would you find the first index for 1.
Ans. 
Iterate through the array and return the index of the first occurrence of 1.
• Iterate through the array using a loop.

• Check each element of the array, if it is 1 then return its index.

• If no 1 is found, return -1.
Answered by AI
Add your answer
Q2. SQL queries related to Order By and Group By
Add your answer

Basics aptitude ,programming mcq

Q1. Basic technical questions like datatypes,sum of two number ,palindrome
Add your answer

To ask to write a program for maximum repeating character in a string?

Q1. Normal HR discussion like family background ,self intro etc...
Add your answer

Basic questions on oops and sql queries

Q1. SQL Query on many to many table and aggregations
Add your answer
Q2. OOPS concepts and SpringBoot
Add your answer

Q1. First online assessment. Fundamental question from all computer science subjects.
Add your answer

Aptitude test includes 25 questions that tests your grammatical skills,verbal,numerical and quantative as well as puzzle etc.

Q1. Asked to write a java code to swap 2 nos with / without temp variable.
Add your answer
Q2. Self intro and Strengths/weaknesses
Add your answer

Q1. Self introduction
Add your answer

Q1. Oops concepts, Encapsulation, Abstraction in detail with example
Add your answer
Q2. Types of beans in Java
Ans. 
Java has two types of beans: stateful and stateless beans.
• Stateful beans maintain conversational state with the client, while stateless beans do not.

• Stateful beans are typically used for long-running conversations, while stateless beans are used for short-lived operations.

• Examples of stateful beans include session beans, while examples of stateless beans include message-driven beans.
Answered by AI
Add your answer

Q1. Code to sort an Array in ascending order
Ans. 
Use a sorting algorithm like bubble sort or quicksort to arrange elements in ascending order.
• Use a sorting algorithm like bubble sort, quicksort, or merge sort to rearrange elements in ascending order.

• For example, you can implement bubble sort to compare adjacent elements and swap them if they are in the wrong order.

• Another example is using quicksort to divide the array into smaller subarrays and recursively sort them.
Answered by AI
Add your answer
Q2. Find the second greatest number in an array
Ans. 
Iterate through the array to find the second greatest number.
• Iterate through the array and keep track of the greatest and second greatest numbers.

• Compare each element with the current greatest and second greatest numbers.

• Update the second greatest number if a new number is found that is greater than the current second greatest but less than the greatest.
Answered by AI
Add your answer

Basic aptitude test if you have concept knowledge you can clear that

Two codes basically one is easy and other is difficult based on the knowledge you have in programming you can clear that

Simple topic they will give and you have to speak with the audience and you have to active thought out GD

Q1. Questions will be on skills mentioned in your resume
Add your answer

Q1. Tell me about yourself ?
Add your answer
Q2. Why you choosing this career?
Add your answer
Q3. What are your salary expectations ?
Add your answer