Asa Bhanu Technical Services Software Engineer Interview Questions and Answers

Questions based or percentage, profit loss, ratio

Q1. Explain about stacks
Ans. 
Stacks are a data structure that follows the Last In First Out (LIFO) principle.
• Elements are added and removed from the top of the stack

• Common operations include push (add element) and pop (remove element)

• Stacks can be implemented using arrays or linked lists

• Examples of stack usage include function call stack and undo/redo functionality in text editors
Answered by AI
Add your answer
Q2. To find middle number in the linked list
Ans. 
To find the middle number in a linked list.
• Traverse the linked list using two pointers, one moving twice as fast as the other.

• When the fast pointer reaches the end, the slow pointer will be at the middle node.

• If the linked list has even number of nodes, there will be two middle nodes. Return either one.
Answered by AI
Add your answer

Q1. Introduction , hobbies, goals
Add your answer
Q2. Strength, weakness, short term and long term goals
Add your answer

It was online test having coding questions for logical part and UI part

Q1. Again logical and technical round with questions that you need to code while sharing your screen.
Add your answer
Q2. Todo list problem
Ans. 
Implement a todo list with add, delete, and mark as completed functionalities.
• Create an array to store the tasks

• Implement functions to add, delete, and mark tasks as completed

• Display the tasks with their completion status
Answered by AI
View 1 more answer

Q1. Basic js concepts
Add your answer

Easy level questions on string, linked list and array

Q1. Difference between TCP and UDP
Ans. 
TCP is a connection-oriented protocol while UDP is connectionless.
• TCP provides reliable, ordered, and error-checked delivery of data while UDP does not guarantee any of these.

• TCP is slower but more reliable while UDP is faster but less reliable.

• TCP is used for applications that require high reliability and accuracy such as email, file transfer, and web browsing while UDP is used for applications that require speed and ...read more
Answered by AI
Add your answer
Q2. Nibble swap program in C
Ans. 
A nibble swap program in C
• Nibble swap means swapping the 4-bit halves of a byte

• Use bitwise operators to perform the swap

• Example: unsigned char x = 0xAB; x = ((x & 0x0F) << 4) | ((x & 0xF0) >> 4);
Answered by AI
Add your answer

Q1. Reverse Linked List in C
Ans. 
Reverse a linked list in C language.
• Create three pointers: current, previous, and next.

• Traverse the linked list and change the direction of the pointers.

• Return the new head of the reversed linked list.
Answered by AI
Add your answer
Q2. Write an API call in C
Ans. 
API call in C
• Include the necessary header files

• Create a URL string with the required parameters

• Use the curl library to make the API call

• Handle the response data appropriately
Answered by AI
Add your answer

Q1. Middleware , dependency injection
Add your answer

Q1. Subject and subject behaviour
Add your answer

Duration:30 min
Question from percentage,ratios ,HCF/LCM etc.,
Logical reasoning, English

Q1. Reverse a string by making groups of given 'm' characters
Ans. 
Reverse a string by grouping 'm' characters together
• Iterate through the string in groups of 'm' characters

• Reverse each group of 'm' characters

• Concatenate the reversed groups to get the final reversed string
Answered by AI
View 1 more answer

Q1. General HR questions
Add your answer
Q2. What is your family background?
Add your answer
Q3. Why should we hire you?
Add your answer

Q1. Tell me something about Data Sturcture
Ans. 
Data structure is a way of organizing and storing data in a computer so that it can be accessed and used efficiently.
• Data structures can be linear (arrays, linked lists) or non-linear (trees, graphs)

• Common operations on data structures include insertion, deletion, and searching

• Examples of data structures include stacks, queues, hash tables, and binary trees
Answered by AI
Add your answer