Refreshing Quote
Kein Weg ist zu weit, wenn man in seinem Traumauto sitzt.
A note from duthcode team.
Hey what's up? We are a free website solely relying on advertisement revenue! Please support us by disabling your adBlock for this site and good things will happen!
Language: C
Difficulty: Beginner
Christmas Tree
Design a Christmas tree using simple conditional iterative statements of the C programming language....
Language: C
Difficulty: Intermediate
Deficient Perfect Abundant Numbers (range)
A positive integer is called deficient, perfect or abundant if the adder of its separators except for the same number is respectively smalle...
Language: C
Difficulty: Beginner
Twin Primes 2.0
Two prime numbers are called twins if they differ by 2 (e.g., 3 and 5, 101 and 103). Write a C language program that will find and display all positiv...
Language: C
Difficulty: Intermediate
Maintenance Cost And Operational Cost
Enter values in 2 one-dimensional real positive N-place arrays (N = known). The 1st table contains values for the cost of operating a machine tool...
Language: C
Difficulty: Intermediate
Operational Time And Maintenance Time
The length of time and the duration of maintenance of a machine tool (in hours) are known for each of N time periods (N = known). Write a C languag...
Language: C
Difficulty: Advanced
Monthly Quantity N' Quality Check
Write a program to manage a table named product and product type as defined below: struct description { int category; int code; }; struct pr...
Language: C
Difficulty: Advanced
Machine Tool With Two Axes
A machine tool works with 2 rotating axes of circular cross section with known diameters of 1.2DD, respectively. Due to the operation of the axes, the...
Language: C
Difficulty: Intermediate
Eratosthenes Algorithm
First numbers are those who have as their true divisors themselves and the unit. THE the Eratosthenes algorithm finds all the first numbers that are ...