Bird Group Interview Questions and Answers

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

So many coding words and also maths Question in percentage of clothes price about nature types

Q1. Math percentage question answer, about clothes and buying products.
Add your answer
Q2. Half about nature and some natural resources.
Add your answer
Q3. All about country's details type question and half about nature type
Add your answer
Q4. Some about maths percentage of buying clothes types question
Add your answer
Q5. And some rock type material type question
Add your answer

10 th pass Question Ans and are very easy to solve i like it very much i try to do my best.

Q1. Explain how did you handle the imbalance in data
Ans. 
I handled data imbalance by using techniques like oversampling, undersampling, SMOTE, or using ensemble methods.
• Used oversampling to increase minority class instances

• Used undersampling to decrease majority class instances

• Applied SMOTE (Synthetic Minority Over-sampling Technique) to generate synthetic samples for minority class

• Utilized ensemble methods like Random Forest or Gradient Boosting to handle imbalance
Answered by AI
Add your answer
Q2. Write a sql query for the given problem statement. Can be solved using advanced concepts like lead and lag
Add your answer

Advanced sql and basics of data science