Linked lists exercises in C Programming in C

• LEVEL 2 Traversing a linked list: Write a program that defines a list of integers, the prints its elements....
• LEVEL 2 Pointers Structures Push delete print elements in a linked list: Write a program that defines a list of integers, then write functions to print, push head and delete head function. Test your functions using a main function....
• LEVEL 2 Recursive function Recursion Insert before each element in a simply linked list: Write a recursive function that inserts an element X before each element Y in a simply linked list of integers. ...
• LEVEL 3 Queue Deque Implementation of a deque: A deque is a data structure that allows both deletion as well as insertion of elements to be done at both ends of a queue. Consider the following code: \(\texttt{typedef $\cdots$ element ;}\\\texttt{struct cell \{ element data; struct cell *next; \}}\\\texttt{typedef struct \{ struct cell *front, *rear; \} deque;}\)...
• LEVEL 3 Stack Intersection node of 2 linked lists: Given the following list structure:typedef ... element;typedef struct cell {    element data;    struct cell * next;} *list; Suppose we have two simply linked lists that can intersect at a given node to become a single linked list. The position o...
• LEVEL 3 Stack Implementation of 3 stacks within a single array: We can keep two stacks within a single linear array so that neither of both stacks overflow until all of memory is used and an entire stack is never shifted to a different location within the array.Thus, both stacks grow towards each other. **img**q2...
• LEVEL 3 Pointers Structures Graph Adjacency list representation of a graph: Represent a graph using an adjacency list....
• LEVEL 3 Recursive function Recursion Pointers Structures Graph Recursive DFS traversal of a graph using an adjacency list: Perform a recursive DFS traversal over a graph represented using an adjacency list....
• LEVEL 3 Pointers Structures Stack Graph Iterative DFS traversal of a graph using an adjacency list: Perform an iterative DFS traversal over a graph represented using an adjacency list....
• LEVEL 3 Pointers Structures Queue Graph Iterative BFS traversal of a graph using an adjacency list: Perform an iterative BFS traversal over a graph represented using an adjacency list....
• LEVEL 3 Pointers Structures Queue Graph Topological sort using BFS traversal of a graph using an adjacency list: Perform a topological sort using BFS traversal of a graph using an adjacency list....
• LEVEL 3 Pointers Structures Stack Graph Topological sort using DFS traversal of a graph using an adjacency list: Perform a topological sort using DFS traversal of a graph using an adjacency list...
• LEVEL 3 Hash tables Add into a table based on hash with separate chaining: Write a function that adds an element to a hash table in which collisions are resolved by separate chaining (insertion at the end of the list)....
• LEVEL 3 Hash tables Cycles: A linked list is said to contain a $$\texttt{cycle}$$ (named also $$\texttt{loop}$$) if some nodes are visited more than once while traversing the list. If the list does not contain any cycles, the last element points to $$\texttt{null}$$. Examples *...

Back to the list of exercises