Skip to content

MikeVriesema/Polynomial-Manipulation-Program

Repository files navigation

C-Assignment-3

CE4703: Computer Software 3
Marked Exercise 2
Design
•Design a suitable struct data type for your polynomial - i.e. decide on how you plan to store polynomials.
•Feel free (not required) to typedef your struct to a more convenient name.
•For each operations, write down a specifications as discussed in the Seven Steps of Systematic Program Construction.
•Then decide how the user will see your operations and write down function
prototypes (function declarations) for all operations.
•For each operation, develop an algorithm in pseudo-code, test it (desktop testing) and repeat this until you are happy that your algorithm is working correctly.
•Implement each operation in the C programming language.
•Once your data type and all functions are implemented, design a test main-function (in a separate file) to verify that your implementation complies with your specification. Keep in mind, that testing is a destructive process, i.e. the tester does his best to break the program. If the tester cannot cause your program to crash on purpose, you can be confident, that a user will not crash your program by accident. Pay particular attention to border cases and illegal values for parameter.
• You must provide your own Makefile (this must be written by yourself - no IDE generated Makefile will be accepted).
Your Makefile must have the following features:
–Use separate targets for compilation and linking.
–Use at least one make file variable.
–Provide a “clean” target that removes temporary files, object files and executables created by this Makefile.
–Does not use any implicit rules
–Running make without a target should compile & link your application and also automatically execute your application.

About

Polynomial Manipulation Program in C using abstract data types

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Contributors 3

  •  
  •  
  •