[Solved] ADS Project 2-Josephus problem with circular lists

30 $

SKU: [Solved] ADS Project 2-Josephus problem with circular lists Category: Tag:

Rate this product

You are going to implement a program that provides the solution of the Josephus problem (see the description on the class slides). You are going to implement:


• •

A circular list. It should have at least the following functionalities: insert a new element, print all elements, remove an element, list third element from given one. Data should be private, and accessible from the main program only through calling member functions.

You have freedom to the design of the program Discuss your design choices in the report you submit.

The main program will use the provided functionality to answer the following question: suppose we start the process from a given node i. Which is the last node to survive ?

What to turn in

You will turn in1. ashortwrittenreportcontaining:

• A description of the significant choices/issues in the design of your code.

• Listing of your experiments, showcasing the capabilities of the program.

2. Thesourcecodeofyourprogram.You may turn in the document via elearning.e-uvt.ro (Class moodle).


3 Coding standards


There are no reviews yet.

Only logged in customers who have purchased this product may leave a review.

Shopping Cart
[Solved] ADS Project 2-Josephus problem with circular lists
30 $