Flydubai Interview Questions and Answers

Group discussion (GD) involves addressing a specific problem or situation collaboratively through discussion and problem-solving.

Group discussion (GD) entails tackling a specific issue or topic collaboratively.

My attitude is typical.

My CV is attached for your review.

Q1. What round are you referring to?
Add your answer
Q2. How many interview rounds are there?
Add your answer
Q3. Where it is running from
Ans. 
The question is asking about the origin or starting point of something.
• The question could be referring to the origin of a flight or transportation service.

• It could also be asking about the source or starting point of a process or system.

• Examples: 'Where is the flight running from?' or 'Where is the project running from?'
Answered by AI
Add your answer

Q1. Who can serve as an HR representative?
Ans. 
An HR representative can be someone from the HR department or a designated employee trained in HR responsibilities.
• HR department staff

• Designated employee with HR training

• External HR consultant

• Manager with HR responsibilities
Answered by AI
Add your answer
Q2. How is the human resources department structured for the group?
Ans. 
The human resources department is structured with specialized teams handling recruitment, training, employee relations, and benefits.
• The human resources department is typically divided into teams such as recruitment, training and development, employee relations, and benefits administration.

• Each team is responsible for specific functions within the HR department, such as sourcing and hiring new employees, providing trai...read more
Answered by AI
Add your answer

Q1. I'm from Leh Ladakh
Add your answer
Q2. 32 YEARS experience security side
Add your answer
Q3. I'm Ex retired Capt Army
Add your answer
Q4. Qualifications 12th pass
Add your answer
Q5. Skill is Transport Supervisor, Men Management, good leadership, Security Officer,
Add your answer

Q1. Basic questions for .Net and stored procedure
Add your answer
Q2. Questions like functions and sp difference, solid principles etc.
Add your answer

Q1. Two programs based on hacker earth test.
Add your answer

Q1. Use less questions based on 25 horses running a race ...
Add your answer
Q2. Question based on reverse a string
Add your answer
Q3. Question on git commands(who asks these)
Add your answer
Q4. Questions based on stack and heap memory
Add your answer
Q5. Questions on explaining useless unworthy questions having no relevance to any experience of work.
Add your answer

Q1. Node js working in detail
Ans. 
Node.js is a runtime environment that allows you to run JavaScript on the server side.
• Node.js is built on Chrome's V8 JavaScript engine.

• It uses an event-driven, non-blocking I/O model that makes it lightweight and efficient.

• Node.js is commonly used for building server-side applications, APIs, and real-time applications.

• It has a large ecosystem of libraries and frameworks, such as Express.js and Socket.io.
Answered by AI
Add your answer
Q2. Timer working in node
Ans. 
In Node.js, timers can be implemented using functions like setTimeout() and setInterval().
• Use setTimeout() to execute a function once after a specified delay

• Use setInterval() to execute a function repeatedly at a specified interval

• Clear a timer using clearTimeout() or clearInterval()

• Example: setTimeout(() => { console.log('Timer executed!'); }, 2000);
Answered by AI
Add your answer

Q1. HLD questions on db and backend
Add your answer
Q2. Relational non relational db
Add your answer

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
Add your answer
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
Add your answer

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