SDG Software Senior Server Engineer Interview Questions and Answers

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

Programming on basics of C

Programming on basics of C

Q1. Salary details and location preference
Add your answer

It represents the eligibility of person and thinking process ,view of thoughts

Q1. We cannot judge people to atonce chance
Add your answer

Skills ,fast typing , experienced ,new ideas

Q1. All the knowledge of technical work and word
Add your answer

Deeply study case and make a point to make attractive

General topics like mathe, English, social etc

Round duration - 70 Minutes
Round difficulty - Hard

Q1. 
Candies Distribution Problem Statement
Prateek is a kindergarten teacher with a mission to distribute candies to students based on their performance. Each student must get at least one candy, and if two s...read more
Ans. 
The task is to distribute candies to students based on their performance while minimizing the total candies distributed.
• Create an array to store the minimum candies required for each student.

• Iterate through the students' ratings array to determine the minimum candies needed based on the adjacent ratings.

• Consider both left-to-right and right-to-left passes to ensure fair distribution.

• Keep track of the total candies dist
Answered by AI
Add your answer
Q2. 
Merge Sort Problem Statement
You are given a sequence of numbers, ARR. Your task is to return a sorted sequence of ARR in non-descending order using the Merge Sort algorithm.
Explanation:
The Merge Sort...read more
Ans. 
Implement Merge Sort algorithm to sort a sequence of numbers in non-descending order.
• Use Divide and Conquer approach to recursively divide the input array into two halves.

• Merge the sorted halves to produce a completely sorted array.

• Ensure the implementation handles the constraints specified in the problem statement.

• Example: For input [3, 1, 4, 1, 5], the output should be [1, 1, 3, 4, 5].
Answered by AI
Add your answer