COMP1511 - Implement a Mini Pokédex in C - Computer Science Assignment Help

Assignment Task

For this assignment, we are asking you to implement a mini Pokédex in C. The task is split into 5 sections; each section is not weighted the same.

There are three structs provided for you in this assignment

• Pokedex is a struct that contains your entire pokedex as a linked list. It is defined in pokedex.c, and you will need to edit what it contains during the course of the assignment
• struct dexnode  is a struct that forms the linked list inside a Pokedex. It is defined in pokedex.c, and you may need to edit what it contains during the course of the assignment. Unlike the other structs, there is no typedef provided, so you can't refer to it as a Dexnode unless you set this up yourself.
• Pokemon is a struct that contains a particular pokemon's details. It is defined in pokemon.c, and you will not be able to edit it at all, or access it's fields directly (use the functions provided instead).

This Computer Science Assignment has been solved by our Computer Science experts at My Uni Paper. Our Assignment Writing Experts are efficient to provide a fresh solution to this question. We are serving more than 10000+ Students in Australia, UK & US by helping them to score HD in their academics. Our Experts are well trained to follow all marking rubrics & referencing style.
Be it a used or new solution, the quality of the work submitted by our assignment experts remains unhampered. You may continue to expect the same or even better quality with the used and new assignment solution files respectively. There’s one thing to be noticed that you could choose one between the two and acquire an HD either way. You could choose a new assignment solution file to get yourself an exclusive, plagiarism (with free Turnitin file), expert quality assignment or order an old solution file that was considered worthy of the highest distinctio.