Linked Lists Programming Practice

Singly Linked List Problems

1. Write a C function to create a new node for a linked list.
2. Write an algorithm or C function to insert a node at the beginning of a singly linked list.
3. Write an algorithm or C function to insert a node at the end of a singly linked list.
4. Write an algorithm or C function to delete a node from the front of a singly linked list.
5. Write an algorithm or C function to delete a node from the end of a singly linked list.
6. Write a C function to display (traverse) all the elements of a singly linked list.
7. Explain the procedure to reverse a singly linked list.
8. Write a C function to concatenate two separate singly linked lists into one.

Doubly Linked List Problems

1. Draw the structure of a node in a doubly linked list and explain its three components.
2. Write an algorithm or C function to insert a node at the beginning of a doubly linked list.
3. Write an algorithm or C function to insert a node at the end of a doubly linked list.
4. Write an algorithm or C function to insert a node at a specified position in a doubly linked list.
5. Write an algorithm or C function to delete a node from the beginning of a doubly linked list.
6. Write an algorithm or C function to delete a node from the end of a doubly linked list.
7. Write a C function to search for a given element in a doubly linked list.

Circular Linked List Problems

1. What are the two main types of circular linked lists? Explain each briefly.
2. Write an algorithm to insert a node at the beginning of a circular singly linked list.
3. Write an algorithm to insert a node at the end of a circular singly linked list.
4. How do you delete the first node in a circular singly linked list? Provide the steps.
5. How do you delete the last node in a circular singly linked list?
6. Explain the key differences in the node structure and pointer connections of a circular doubly linked list compared to a standard doubly linked list.
7. Write a C function to insert a node at the beginning of a circular doubly linked list.
8. Write a C function to delete the last node from a circular doubly linked list.

Application-Based Problems

1. Explain how a stack can be implemented using a linked list. Which end is used for push and pop operations?
2. Write C functions for the push and pop operations for a stack implemented with a linked list.
3. Explain how a queue can be implemented using a linked list. Where do insertion (enqueue) and deletion (dequeue) occur?
4. Write C functions for the insert (enqueue) and delete (dequeue) operations for a queue implemented with a linked list.
5. How can a mathematical polynomial be represented using a linked list? What information would each node store?
6. Write an algorithm or C function to add two polynomials that are represented by linked lists.
7. Describe a real-world scenario where a circular linked list is particularly useful,(e.g., OS task scheduling).