General Aeronautics Android Developer Interview Questions and Answers

Discussion on latest topics

Q1. Asked typical hr question
Add your answer
Q2. Avg no of cars in delhi
Ans. 
The average number of cars in Delhi is estimated to be around 3 million.
• Delhi has a high population density and traffic congestion, leading to a large number of cars on the roads.

• The number of cars in Delhi is constantly increasing due to urbanization and economic growth.

• Government initiatives like odd-even schemes and public transportation improvements aim to reduce the number of cars on the roads.
Answered by AI
Add your answer

Medium or easy level aptitude were ther

Q1. Asked about android development experience
Add your answer
Q2. 2 DSA question were to be solved
Add your answer

Why Iphone sales are increasing

15 qns 50 mins So WRITE FAST

Mangaer asked me to integrate an api

Q1. Salary negotions was done on the second round
Add your answer

50 questions in 12 minutes mostly test your arthimetic, logical knowledge.

3 coding questions in 90 mins, 1st one is from arrays an easy question, 2nd one is related to stacks and queues relatively harder and last one is hard which i am also unable to attempt. I cracked the first two questions and my solutions passed all the test cases.

Q1. Difference between sorting algorithms
Ans. 
Sorting algorithms are methods used to arrange elements in a specific order.
• Different sorting algorithms include bubble sort, selection sort, insertion sort, merge sort, quick sort, and heap sort.

• Some algorithms are more efficient than others depending on the size of the data set and the initial order of the elements.

• For example, quick sort is generally faster than bubble sort for large data sets.
Answered by AI
View 1 more answer
Q2. BFS and DFS in trees and imlementing them
Ans. 
BFS and DFS are traversal algorithms used in trees. BFS explores level by level, while DFS explores depth first.
• BFS (Breadth-First Search) visits nodes level by level, using a queue. Example: traversing a binary tree level by level.

• DFS (Depth-First Search) explores as far as possible along each branch before backtracking. Example: in-order traversal of a binary tree.
Answered by AI
Add your answer
Q3. Sql questions and database questions
Add your answer

Q1. Tell me about yourself
Add your answer
Q2. Explain the college life
Add your answer

Question from Array,DP

Q1. Resume based only
Add your answer
Q2. Data structure and algorithms
Add your answer
Q3. Object oriented programmings
Add your answer

Q1. Behavioural questions
Add your answer

Q1. Basic resume based questions
Add your answer
Q2. Explain your internship experience
Add your answer

Q1. Basic resume based questions
Add your answer

NEED TO QUALIFY IN THIS TEST

NEED TO QUALIFY THIS TEST ALSO

Q1. SOME DSA AND ROLE BASED QUATIONS.
Add your answer