MNC AUTOMATION Software Developer Interview Questions and Answers

Medium to hard dsa problem

Q1. Good URI design
Add your answer
Q2. Accessing id parameter in URL
Ans. 
Accessing id parameter in URL involves parsing the URL and extracting the id value.
• Use the window.location object to access the URL of the current page.

• Parse the URL using methods like split() or URLSearchParams to extract the id parameter.

• Example: If the URL is 'http://example.com/page?id=123', you can access the id value by parsing the URL.
Answered by AI
Add your answer

Q1. Salary expectations
Add your answer
Q2. Plan of growing up technically
Add your answer

30 min 30 ques and gaming ques

Q1. What is ML and AI in your project?
Ans. 
ML and AI are used in our project to analyze user behavior and provide personalized recommendations.
• ML algorithms are used to analyze user data and predict user preferences.

• AI is used to provide personalized recommendations based on the analysis of user behavior.

• Examples include recommendation systems for e-commerce websites and personalized content suggestions on streaming platforms.
Answered by AI
Add your answer
Q2. What is lagging concept and more?
Ans. 
Lagging concept refers to a concept or idea that is behind or not up to date compared to current standards or practices.
• Refers to outdated technology or methods in software development

• Can lead to inefficiencies, bugs, or security vulnerabilities

• Examples include using deprecated libraries or not following best practices for coding
Answered by AI
Add your answer

Q1. 1. Basic OOP Concepts 2. Difference between structure and class in terms of constructor 3. Can members of structure be defined as private 4. What's lambda function and it's real life use case 5. Difference...read more
Add your answer
Q2. 6. What's O(n) in time and space complexity
Ans. 
O(n) refers to linear time and space complexity.
• O(n) means that the time or space required by an algorithm grows linearly with the size of the input.

• It implies that the algorithm's performance is directly proportional to the input size.

• For example, if an algorithm takes 10 seconds to process 100 elements, it would take 20 seconds to process 200 elements.

• O(n) complexity is considered efficient and desirable in most case
Answered by AI
Add your answer

Normal questions , maths, English, reasoning

Do easy medium problem solving

Q1. Questions on dp, recursion, dbms
Add your answer

Q1. Salary discussions, relocation, other
Add your answer

Basic coding, duration 1hr

General experience discussion