Structures exercises in C Programming in C
-
Complex numbers: Write a program that defines a:
$\texttt{complex}$ type
function that calculates the module of a complex number
function that calculates the conjugate of a complex number
function that prints a complex number
function that calculates the sum of 2 com... - Date manipulation: Write a program that defines a:
date type
function that prints a date
function that creates and returns the date after one year
Write a main function to test your functions....
- Raise for employee: Write a program that defines a(n):
employee type (number, age, year of recrutement, salary)
function that raises the salary of an employee by a certain percentage
Write a main function to test your functions....
- 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....
- 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....
- 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 ...
- 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 ...
- 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...
- 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 ...
- 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....
- Iterative BFS traversal of a graph using an adjacency matrix: Perform an iterative BFS traversal over a graph represented using an adjacency matrix....
- 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....
- Connected graph: Write a program that checks whether a graph is connected.
Implement the graph using an adjacency list and use DFS....
- 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....
- 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...
- 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....
- 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