Toshiba Associate Software Engineer Interview Questions and Answers

On campus drive - 1 st round was aptitude and coding with technical and quantitative aptitude questions, and 2 easy level programming questions .

Group discussion on latest general topics ( rarely few groups got technical topics).

Q1. Questions based on area of Interest and the projects done.
Add your answer
Q2. 1. Teach me Object oriented programming. (Consider I have no programming knowledge and don't understand classes and objects as such. - Explain using realtime examples.)
Add your answer
Q3. What is the difference between aggregation and composition? Abstract class vs interface.
Ans. 
Aggregation is a 'has-a' relationship where one object contains another object, while composition is a stronger form of aggregation where the contained object has no independent existence.
• Aggregation is a weaker relationship where one object 'has-a' another object, but the contained object can exist independently.

• Composition is a stronger relationship where one object is composed of another object, and the contained ob...read more
Answered by AI
Add your answer
Q4. Why do we need DBMS? What are views, procedures and triggers?
Ans. 
DBMS is needed to efficiently store, retrieve, and manage data. Views, procedures, and triggers are database objects used for data manipulation and automation.
• DBMS is needed to ensure data integrity, security, and consistency.

• Views are virtual tables that display data from one or more tables based on a query.

• Procedures are reusable sets of SQL statements stored in the database for execution.

• Triggers are special stored ...read more
Answered by AI
Add your answer

Q1. Behaviour oriented questions. Where do you see yourself five years from now? (Questions to check the approch and intent of the candidate).
Add your answer

What is ll dsing a ll and all stuff

Q1. Time complexity in hashmap
Ans. 
Time complexity of hashmap operations is O(1) on average, but can be O(n) in worst case scenarios.
• HashMap operations like get, put, and remove have constant time complexity O(1) on average due to hashing.

• In worst case scenarios, when there are many collisions, time complexity can degrade to O(n) where n is the number of elements in the hashmap.

• Hashing function quality and load factor affect the time complexity of hashm
Answered by AI
Add your answer
Q2. Why this company what are your ambitions
Add your answer

Related to logical,verbal

Q1. Related to coding,basic programming questions
Add your answer