Upload Button Icon Add office photos

Filter interviews by

Air India Software Quality Analyst Interview Questions and Answers

Updated 7 Feb 2024

Air India Software Quality Analyst Interview Experiences

1 interview found

Interview experience
4
Good
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via campus placement at National Institute of Technology (NIT), Calicut and was interviewed in Aug 2023. There were 3 interview rounds.

Round 1 - Aptitude Test 

TOTAL WORK, PERCENTAGE, SERIES, TIME, SPEED AND DISTANCE, ETC...

Round 2 - Coding Test 

BASIC PROGRAMMING QUESTIONS IN CPP

Round 3 - Technical 

(1 Question)

  • Q1. WRITE A PROGRAM TO CALCULATE THE SUM OF GIVEN SERIES WRITE A PROGRAM TO MANIPULATE THE GIVEN STRING WRITE AN SQL QUERY TO MANIPULATE THE GIVEN EMPLOYEES' TABLE
  • Ans. 

    Program to calculate sum of series, manipulate string, and manipulate employees' table

    • For calculating sum of series, use a loop to iterate through the given series and add each element to a running total

    • For manipulating a string, use string manipulation functions like substring, replace, or concatenate to modify the given string

    • For manipulating an employees' table in SQL, use SQL queries like UPDATE, INSERT, or DELETE ...

  • Answered by AI

Skills evaluated in this interview

Interview questions from similar companies

Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
-
Result
-
Round 1 - Technical 

(2 Questions)

  • Q1. What is the internal implementation of Hashing and what is collision?
  • Ans. 

    Hashing is a technique used to map data to a fixed-size array, collision occurs when two different inputs produce the same hash value.

    • Hashing involves using a hash function to map data to a fixed-size array.

    • Collision happens when two different inputs produce the same hash value.

    • Common techniques to handle collisions include chaining and open addressing.

  • Answered by AI
  • Q2. Is time complexity of HashMap always O(1) ?
  • Ans. 

    No, time complexity of HashMap is not always O(1).

    • Time complexity of HashMap is O(1) on average, but can degrade to O(n) in worst case scenarios.

    • Worst case scenarios include hash collisions, which can lead to linear probing and degrade performance.

    • Load factor and capacity of the HashMap can also affect time complexity.

    • In scenarios where many keys hash to the same index, the time complexity can degrade.

  • Answered by AI
Round 2 - One-on-one 

(1 Question)

  • Q1. Yet to have the interview. Ambition box is forcefully making me enter these details

Skills evaluated in this interview

Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
-

I applied via Approached by Company and was interviewed in Oct 2024. There were 2 interview rounds.

Round 1 - Coding Test 

1 dsa question 1 sql and 18 mcq questions

Round 2 - One-on-one 

(2 Questions)

  • Q1. Lot of questions from resumes and projects
  • Q2. Easy DSA questions and oops questions

Interview Preparation Tips

Interview preparation tips for other job seekers - work on you communication skills
Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Coding Test 

Tree algorithm about some riddels

Interview Preparation Tips

Interview preparation tips for other job seekers - tree algorithm
Interview experience
4
Good
Difficulty level
Moderate
Process Duration
4-6 weeks
Result
Not Selected

I applied via Recruitment Consulltant and was interviewed in Feb 2024. There was 1 interview round.

Round 1 - Coding Test 

Write a simple algorithm for string manipulation

Interview experience
1
Bad
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Technical 

(2 Questions)

  • Q1. What is gcd? And explain it
  • Ans. 

    gcd stands for greatest common divisor, the largest positive integer that divides two or more numbers without leaving a remainder.

    • gcd is used to find the largest integer that can evenly divide two or more numbers.

    • It is commonly used in mathematics and computer science algorithms.

    • For example, the gcd of 12 and 18 is 6, as 6 is the largest number that can divide both 12 and 18 without leaving a remainder.

  • Answered by AI
  • Q2. What is arc and explain it
  • Ans. 

    ARC stands for Automatic Reference Counting, a memory management technique used in programming languages like Objective-C and Swift.

    • ARC automatically tracks and manages the memory used by objects in a program

    • It increases the retain count of an object when it is referenced and decreases it when it is no longer needed

    • ARC helps prevent memory leaks and retain cycles in iOS and macOS development

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - Read react native basics

Skills evaluated in this interview

Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Keep your resume crisp and to the point. A recruiter looks at your resume for an average of 6 seconds, make sure to leave the best impression.
View all tips
Round 2 - One-on-one 

(2 Questions)

  • Q1. There were questions of DSA, DBMS, OS etc
  • Q2. There were questions around project that were mentioned in resume.

Interview Preparation Tips

Interview preparation tips for other job seekers - Prepare around Data structures and algorithms, Database management system, Operating system, projects that you have already done.

I applied via LinkedIn and was interviewed in Nov 2021. There were 3 interview rounds.

Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Don’t add your photo or details such as gender, age, and address in your resume. These details do not add any value.
View all tips
Round 2 - Aptitude Test 

Be confident

Round 3 - HR 

(1 Question)

  • Q1. General communication

Interview Preparation Tips

Interview preparation tips for other job seekers - Be confident and be good in communication
Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Properly align and format text in your resume. A recruiter will have to spend more time reading poorly aligned text, leading to high chances of rejection.
View all tips
Round 2 - Technical 

(1 Question)

  • Q1. Common technical questions
Round 3 - Technical 

(1 Question)

  • Q1. Advance Technical Questions based on your skill set taken by architect
Round 4 - Coding Test 

Common coding problems difficulty laver moderate

Round 5 - Behavioral 

(1 Question)

  • Q1. Common managerial question ,scenario base questions

Interview Preparation Tips

Interview preparation tips for other job seekers - Practice common number and string interview questions.
Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Coding Test 

Simple string manipulation

Round 2 - Technical 

(1 Question)

  • Q1. Basic c# questions

Air India Interview FAQs

How many rounds are there in Air India Software Quality Analyst interview?
Air India interview process usually has 3 rounds. The most common rounds in the Air India interview process are Aptitude Test, Coding Test and Technical.

Tell us how to improve this page.

Air India Software Quality Analyst Interview Process

based on 1 interview

Interview experience

4
  
Good
View more

Interview Questions from Similar Companies

Spicejet Interview Questions
3.6
 • 91 Interviews
Boeing Interview Questions
3.9
 • 84 Interviews
Qatar Airways Interview Questions
4.0
 • 60 Interviews
Go First Interview Questions
3.7
 • 46 Interviews
AirAsia Interview Questions
3.6
 • 31 Interviews
British Airways Interview Questions
3.2
 • 28 Interviews
View all
Cabin Crew
355 salaries
unlock blur

₹3.4 L/yr - ₹12.8 L/yr

Customer Service Executive
209 salaries
unlock blur

₹1.4 L/yr - ₹5 L/yr

Assistant Manager
154 salaries
unlock blur

₹5.1 L/yr - ₹19.8 L/yr

Security Executive
132 salaries
unlock blur

₹2.1 L/yr - ₹5.2 L/yr

Cabin Attendant
126 salaries
unlock blur

₹2.8 L/yr - ₹12 L/yr

Explore more salaries
Compare Air India with

InterGlobe Aviation

3.6
Compare

Spicejet

3.6
Compare

Vistara

4.0
Compare

Go First

3.7
Compare
Did you find this page helpful?
Yes No
write
Share an Interview