1. ## asign _1.data,struct

Assignment No. 01
SEMESTER Spring 2011
CS301- Data Structures
Total Marks: 20

Due Date: 19/04/2011
Instructions
It should be clear that your assignment will not get any credit (zero marks) if:
o The assignment is submitted after due date.
o The submitted code does NOT compile.
o The submitted assignment does NOT open or file corrupt.
o The assignment is copied (from other student or ditto copy from handouts or internet).

1. A working Make File (Dev-C++ project File).
2. All the Source Code (.h and .cpp files) necessary to compile and run your program.
3. Place all the files in a folder then Zip this folder and Upload it on VU-LMS

Note: Use Dev-C++ IDE.
Objective
The objective of this assignment is

o To give you some practice exercise of linked list Data Structure.

For any query about the assignment, contact at cs301@vu.edu.pk
GOOD LUCK
Marks: 20

The Josephus problem is the following mass suicide "game": n people, numbered 1 to n, are sitting in a circle. Starting at person 1, a handgun is passed. After m passes, the person holding the gun commits suicide, the body is removed, the circle closes ranks, and the game continues with the person who was sitting after the corpse picking up the gun. The last survivor is tried for n - 1 counts of manslaughter. Thus, if m = 0 and n = 5, players are killed in order and player 5 stands trial. If m = 1 and n = 5, the order of death is 2, 4, 1, 5.

Write a C++ program to solve the Josephus problem for general values of m and n using circular linked list data structure.

Input:
 Number of People: n
 Number of Passes: m
Output:
 Order in which people are removed
 The survivor

Sample Run:
Enter total number of People playing the game: 10
Enter number of Passes: 3
----------------------------------------------------
Game Started!
----------------------------------------------------
 Person removed: 4
 Person removed: 8
 Person removed: 2
 Person removed: 7
 Person removed: 3
 Person removed: 10
 Person removed: 9
 Person removed: 1
 Person removed: 6
----------------------------------------------------
 The survivor is : 5
----------------------------------------------------

Lectures Covered: This assignment covers Lecture # 1-5

2. help plesjhhhhhhhhhhhhhhh

There are currently 1 users browsing this thread. (0 members and 1 guests)