IMPORTANT !!

For a smoother browsing of this website, please disable your ad blockers

- Click on the icon in yor browser toolbar.
- Click on the "Pause Adblock" option.
- Reload your browser or click the button below to continue.

- Click on the icon in yor browser toolbar.
- Click the blue button next to "Block Ads On:"
- Click the red "Refresh" button or click the button below to continue.

- Click on the icon in yor browser toolbar.
- Click on the toggle next to "Protection on this website".
- Reload your browser or click the button below to continue.

- Click on the icon in yor browser toolbar.
- Click on the big blue "power" icon.
- Reload your browser or click the button below to continue.

- Traversing a linked list: Write a program that defines a list of integers, the prints its elements....
- 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....
- 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;}\)...
- 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...
- Adjacency list representation of a graph: Represent a graph using an adjacency list....
- Recursive DFS traversal of a graph using an adjacency list: Perform a recursive DFS traversal over a graph represented using an adjacency list....
- Iterative DFS traversal of a graph using an adjacency list: Perform an iterative DFS traversal over a graph represented using an adjacency list....
- Iterative BFS traversal of a graph using an adjacency list: Perform an iterative BFS traversal over a graph represented using an adjacency list....
- 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....
- 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...
- 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)....
- 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

© Copyright 2006-2024 | All rights reserved