Pointers exercises in C Programming in C

• LEVEL 2 Add two numbers using pointers: Write a program that declares 2 integers and then add them using pointers....
• LEVEL 2 Iterative function Swap two numbers using pointers: Write a program that declares 2 integers and swap it using pointers....
• LEVEL 2 Copy an array using pointers: Write a function that copies an array of integers using pointers. Write a main function to test your functions....
• LEVEL 2 Structures Defining a person type using structures and pointers: Write a program that defines a(n): person type (first name, last name, pointers to a father and a mother person) function that displays the information of a person Write a main function to test your functions....
• LEVEL 2 Structures Linked lists 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 3 One dimensional array Structures Sets Static implementation of a set - version 1: You are asked to give a static implementation of the ADT set having the following functions: void toempty(SET *S) int empty(SET S) int find(int x, SET S) void add(int x, SET *S) void removeS(int x, SET *S) void intersect(SET S1, SET S2, SET *R) void ...
• LEVEL 3 One dimensional array Structures Sets Static implementation of a set - version 2: You are asked to give a static implementation of the ADT set having the following functions: void toempty(SET *S) int empty(SET S) int find(int x, SET S) void add(int x, SET *S) void removeS(int x, SET *S) void intersect(SET S1, SET S2, SET *R) void ...
• LEVEL 3 Structures Sets Dynamic implementation of a set: You are asked to give a dynamic implementation of the ADT set having the following functions: void toempty(SET *S) int empty(SET S) int find(int x, SET S) void add(int x, SET *S) void removeS(int x, SET *S) void intersect(SET S1, SET S2, SET *R) void...
• LEVEL 3 One dimensional array Structures Sets Implementation of a set using an array of Boolean: You are asked to give an implementation of the ADT set using an array of Boolean and having the following functions: void toempty(SET *S) int empty(SET S) int find(int x, SET S) void add(int x, SET *S) void removeS(int x, SET *S) void intersect(SET ...
• LEVEL 3 One dimensional array Bit manipulation Sets Implementation of a set using a long integer as bits: You are asked to give an implementation of the ADT set using an array of bits and having the following functions: void toempty(SET *S) int empty(SET S) int find(int x, SET S) void add(int x, SET *S) void removeS(int x, SET *S) void intersect(SET S1,...
• LEVEL 3 One dimensional array Bit manipulation Sets Implementation of a set using an array of long integers as bits: You are asked to give an implementation of the ADT set using an array of bits and having the following functions: void toempty(SET *S) int empty(SET S) int find(int x, SET S) void add(int x, SET *S) void removeS(int x, SET *S) void intersect(SET S1,...
• LEVEL 3 One dimensional array Sets Disjoint sets - Well known union find algorithm: A disjoint-set data structure is a data structure that keeps track of a set of elements partitioned into a number of disjoint subsets. The union-find algorithm is an efficient and fast algorithm that performs many useful operations: findSet: Determin...
• LEVEL 3 Graph Adjacency matrix representation of a graph: Represent a graph using an adjacency matrix....
• LEVEL 3 Structures Linked lists Graph Adjacency list representation of a graph: Represent a graph using an adjacency list....
• LEVEL 3 Graph DFS traversal of a graph using an adjacency matrix: Perform a DFS traversal over a graph represented using an adjacency matrix....
• LEVEL 3 Recursive function Recursion Structures Linked lists 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 Structures Linked lists 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 Structures Linked lists 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 Structures Queue Graph Iterative BFS traversal of a graph using an adjacency matrix: Perform an iterative BFS traversal over a graph represented using an adjacency matrix....
• LEVEL 3 Recursive function Recursion Structures Queue Graph Path between two vertices: Write a program that checks whether a path exists between two vertices in a graph. Implement the graph using an adjacency list and use DFS....
• LEVEL 3 Recursive function Recursion Structures Queue Graph Connected graph: Write a program that checks whether a graph is connected. Implement the graph using an adjacency list and use DFS....
• LEVEL 3 Structures Queue Graph Topological sort using BFS traversal of a graph using an adjacency matrix: Perform a topological sort using BFS traversal of a graph using an adjacency matrix....
• LEVEL 3 Structures Linked lists 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 Structures Linked lists 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 Structures Queue Graph Shortest path from a source in an unweighted graph using an adjacency matrix: Give a ahortest path from a source in an unweighted graph using an adjacency matrix....
• LEVEL 3 Structures Queue Graph Shortest path from a source in an unweighted graph using an adjacency list: Give a ahortest path from a source in an unweighted graph using an adjacency list....

Back to the list of exercises