How would you find out if one of the pointers in a linked list is corrupted or not?
This is a really good interview question. The reason is that linked lists are used in a wide variety of scenarios and being able to detect and correct pointer corruptions might be a very valuable tool. For example, data blocks associated with files in a file system are usually stored as linked lists. Each data […]
Read the rest of this entry »Write a C program to insert nodes into a linked list in a sorted fashion
The solution is to iterate down the list looking for the correct place to insert the new node. That could be the end of the list, or a point just before a node which is larger than the new node.
Note that we assume the memory for the new node has already been allocated and a […]
Write a C program to remove duplicates from a sorted linked list
As the linked list is sorted, we can start from the beginning of the list and compare adjacent nodes. When adjacent nodes are the same, remove the second one. There’s a tricky case where the node after the next node needs to be noted before the deletion.
// Remove duplicates from a sorted list
void RemoveDuplicates(struct node* […]
How can I search for data in a linked list?
The only way to search a linked list is with a linear search, because the only way a linked list?s members can be accessed is sequentially. Sometimes it is quicker to take the data from a linked list and store it in a different data structure so that searches can be more efficient.
Read the rest of this entry »Given only a pointer to a node to be deleted in a singly linked list, how do you delete it?
This is a very good interview question
The solution to this is to copy the data from the next node into this node and delete the next node!. Ofcourse this wont work if the node to be deleted is the last node. Mark it as dummy in that case. If you have a Circular linked list, […]
How do you reverse a singly linked list? How do you reverse a doubly linked list? Write a C program to do the same.
This is THE most frequently asked interview question. The most!.
Singly linked lists
Here are a few C programs to reverse a singly linked list.
Method1 (Iterative)
#include
// Variables
typedef struct node
{
int value;
struct node *next;
}mynode;
// Globals (not required, though).
mynode *head, *tail, *temp;
// Functions
void add(int value);
void iterative_reverse();
void print_list();
// The main() function
int main()
{
[…]
-
Subscribe
-
Job In Companies
-
Latest Jobs- TCS Freshers Walkin Banking Jobs - TCS BPO
- Sutherland Freshers Walkin
- Syntel Freshers Walkin
- Citigroup Freshers Walkin Jan 6 - 7
- NVIDIA Corp Recruits Freshers Senior Hardware Engineer
- BA Continuum Sol Recruits Freshers Tech Associate
- Convergys Recruits Freshers Technician - Network Services
- Bose Recruits Freshers TECHNICIAN
- RR Donnelley Recruits Freshers Customer Service Executive
- Zensar Tech Recruits Freshers Customer Service Executives