Team Lead and Developer Interview Questions and Answers

C data structure is a way to organize and store data in memory. Reversing a single linked list involves changing the direction of pointers to traverse the list in reverse order.

• Define a struct Node with data and next pointer

• Initialize three pointers prev, current, and next to NULL, head, and head->next respectively

• Iterate through the list, updating pointers to reverse the list

• Update head to point to prev at the end of the iteration

Cursor stored procedure is used to iterate through a result set. Different types of joins include inner, outer, left, right, and cross. Complex queries involve multiple tables and conditions.

• Cursor stored procedure is used to fetch and process each row of a result set one at a time

• Inner join returns only the matching rows from both tables

• Outer join returns all the rows from one table and matching rows from the other table

• Left join returns all the rows from the left table and ...read more

A socket is a communication endpoint that allows two processes to communicate with each other.

• A socket is identified by an IP address and a port number.

• Different socket calls include socket(), bind(), listen(), accept(), connect(), send(), and recv().

• socket(): Creates a new socket.

• bind(): Binds a socket to a specific IP address and port number.

• listen(): Listens for incoming connections on a socket.

• accept(): Accepts an incoming connection on a socket.

• connect(): Initiates a con...read more

Fork is a system call in Unix-like operating systems that creates a new process by duplicating the existing process.

• Fork is used to create a new process that is a copy of the calling process.

• The new process created by fork has its own memory space and runs independently of the parent process.

• Fork returns different values in the parent and child processes to distinguish between them.

• Commonly used in creating multi-process applications or forking a process to run in the backgro...read more