Wings Infonet Interview Questions and Answers

Q1. Find the ratio of the radius of the inscribed and circumscribed circles of a square of side length a.
Ans. 
Ratio of radius of inscribed and circumscribed circles of a square of side length a.
• The radius of the inscribed circle is half the length of the side of the square.

• The radius of the circumscribed circle is half the diagonal of the square.

• Ratio of radius of inscribed and circumscribed circles is 1:2.
Answered by AI
Add your answer
Q2. Find the coordinates of a point p1 with the distance of it from point p2 and the coordinates p2 and p3, given that all three points are collinear.
Ans. 
To find the coordinates of point p1, use the distance formula and the collinearity of the three points.
• Use the distance formula to find the distance between p1 and p2.

• Use the slope formula to find the slope of the line passing through p2 and p3.

• Use the slope and distance to find the equation of the line passing through p2 and p3.

• Use the equation of the line and the coordinates of p2 to find the coordinates of p1.
Answered by AI
Add your answer
Q3. With the coordinates of the four points p1, p2, p3, and p4, where p1, p2, and p3 lie on a circle, find whether p4 lies inside or outside of the circle.
Ans. 
To determine if p4 lies inside or outside the circle with p1, p2, and p3 coordinates.
• Calculate the equation of the circle using p1, p2, and p3 coordinates.

• Check the distance between p4 and the center of the circle.

• If the distance is less than the radius of the circle, p4 lies inside the circle, otherwise outside.
Answered by AI
View 1 more answer

Q1. Find a point is inside a circle or not?
Ans. 
To determine if a point is inside a circle, calculate the distance between the point and the center of the circle and compare it to the radius.
• Calculate the distance between the point and the center of the circle using the distance formula: sqrt((x2-x1)^2 + (y2-y1)^2)

• Compare the calculated distance to the radius of the circle. If the distance is less than the radius, the point is inside the circle.

• For example, if the c...read more
Answered by AI
Add your answer

Q1. It was quite easy for me asked me about my roles and responsibilities basics question on testing and gave some scenarios how to deal with it.
Add your answer
Q2. - stubbing - HSIT - unit testing
Add your answer

Q1. - Salary discussion, why you want to join, strength and weekness
Add your answer

Arithmetic, verbal, and verbal skills.

Please write a code for generating the Fibonacci sequence.

Q1. What are the key features and concepts of the C programming language?
Ans. 
C is a powerful and efficient programming language known for its low-level features and flexibility.
• Key features include: low-level memory access, efficient manipulation of pointers, strong support for procedural programming, and a rich library of built-in functions.

• Concepts include: data types, control structures (such as loops and conditionals), functions, arrays, and pointers.

• Example: In C, you can directly access a...read more
Answered by AI
Add your answer
Q2. What is an array
Ans. 
An array is a data structure that stores a collection of elements of the same type in a contiguous memory location.
• Arrays have a fixed size determined at the time of declaration.

• Elements in an array are accessed using an index starting from 0.

• Example: string[] names = {"Alice", "Bob", "Charlie"};
Answered by AI
Add your answer

Q1. When would you be able to join?
Ans. 
I can start within 2 weeks of receiving an offer.
• I can start within 2 weeks of receiving an offer.

• I need to give notice to my current employer.

• I may need time to relocate if necessary.
Answered by AI
Add your answer

Q1. Storage types, structures, padding
Add your answer
Q2. Bit operations in C language
Ans. 
Bit operations in C language involve manipulating individual bits within a data structure.
• Bitwise AND (&) - sets a bit to 1 only if both input bits are 1

• Bitwise OR (|) - sets a bit to 1 if either input bit is 1

• Bitwise XOR (^) - sets a bit to 1 if the input bits are different

• Bitwise NOT (~) - inverts all bits in a number

• Left shift (<<) - shifts bits to the left by a specified number of positions

• Right shift (>>) - shifts
Answered by AI
Add your answer

Round duration - 120 minutes
Round difficulty - Hard

This round was very difficult. I never do these much difficulty level of coding questions. But i give my best, and just do every questions by using step by step process.

Q1. 
Hourglass Pattern Problem Statement
Given an integer 'N', print an hourglass pattern based on the value of 'N'.
Input:
The first and only line of input contains an integer, denoting the value of N.
Out...read more
Ans. 
Print an hourglass pattern based on the given integer 'N'.
• Read the integer 'N' as input

• Print the top half of the hourglass pattern with decreasing numbers

• Print the bottom half of the hourglass pattern with increasing numbers

• Handle the constraints for 'N' values between 1 and 50
Answered by AI
Add your answer
Q2. 
BFS Traversal in a Graph
Given an undirected and disconnected graph G(V, E) where V vertices are numbered from 0 to V-1, and E represents edges, your task is to output the BFS traversal starting from the ...read more
Ans. 
BFS traversal in a disconnected graph starting from vertex 0.
• Use BFS algorithm to traverse the graph starting from vertex 0.

• Explore neighbor nodes first before moving to the next level neighbors.

• Consider bidirectional edges in an undirected graph.

• Output the BFS traversal sequence for each test case in a separate line.

• Ensure the BFS path starts from vertex 0 and print connected nodes in numerical sort order.
Answered by AI
Add your answer
Q3. 
Sort a Stack Problem Statement
You are given a stack. Your task is to sort the elements within the stack in ascending order using only push and pop operations. You are allowed to use one additional stack ...read more
Ans. 
Sort a given stack in ascending order using only push and pop operations with the help of an additional stack.
• Use one additional stack to assist in sorting the elements.

• Pop elements from the input stack and push them onto the auxiliary stack in sorted order.

• Keep track of the current minimum element to maintain ascending order.

• Pop elements from the auxiliary stack back to the input stack to get the sorted order.
Answered by AI
Add your answer

Round duration - 90 minutes
Round difficulty - Easy

This round is also coding round in this round we have a small video call interaction too, in which hr ask few questions to only those whose coding question is correct.

Q1. 
Next Smaller Palindrome Problem Statement
You are given a palindrome number represented as a string S. Your task is to find the largest palindrome number that is strictly less than S.
Example:
Input:
T...read more
Ans. 
Find the largest palindrome number strictly less than a given palindrome number.
• Iterate from the middle towards the start of the number and decrement the digits to create the largest palindrome less than the given number.

• Handle cases where the number is all '9's by changing the middle digit to '9' and decrementing the rest of the digits.

• If the number has an odd length, simply mirror the first half to create the largest
Answered by AI
Add your answer
Q2. 
Rotting Oranges Problem Statement
You are given a grid containing oranges where each cell of the grid can contain one of the three integer values:
• 0 - representing an empty cell
• 1 - representing a fre...read more
Ans. 
Find minimum time to rot all fresh oranges adjacent to rotten oranges in a grid.
• Use Breadth First Search (BFS) to simulate the rotting process.

• Track the time taken to rot all fresh oranges.

• Return -1 if all fresh oranges cannot be rotten.

• Handle edge cases like empty grid or no fresh oranges.
Answered by AI
Add your answer

Q1. Everything in your resume.
Add your answer

Q1. What are your strengths and weaknesses?
Add your answer
Q2. Tell me about yourself.
Add your answer