CS301 Data Structure Assignments No.2 Solution and Discussion Fall 2014

[vuassignments]

CS301 Data Structure Assignments No.2 Solution and Discussion Fall 2014 Due Date: May 27, 2014


Uploading instructions
For clarity and simplicity, You are required to Upload/Submit only one .CPP file.
Don’t wait for grace day. Grace Day is given only if there is problem with LMS on due date. Submit your solution within due date.
Note that no assignment will be accepted through email if there is any problem on grace day.
Note: Use only Dev C++ IDE.
Objective
The objective of this assignment is to make you familiar with array, link list, stack and queue data structures and programming techniques related to them.
1) Before developing this assignment understand and practice following topics (array, link list, stack implementation using link list and queue implementation using circular array).
2) Use stack data structure to save information of players. Each player will represent a node which will contain player name and scores.
3) Use queue data structure to save dice numbers and get random number from dice. Use circular array to implement queue.
4) Your solution should use these classes
Player (Node) Class : To save information of each player
Stack Class: To save different players
Queue Class: To save dice numbers 1-6 and get random number from dice.
5) Before calling rand() method use this line ( srand(static_cast<int>(time(0))); ) to get different random numbers.

[punjab-university]

For this assignment the following programs are a must
Linked List
Stack
queue
circular array
random num gen for Dice rolling
in the end all of the above will be assembled,
I wonder How
I found some codes for random numbers



  12.jpg (Size: 86.21 KB / Downloads: 760)
If you enter 60 as input, that means you have rolled the dice 60 times, the answer that you will get will be less than 6 , it can be 2 2 4 4 5 6 or 1 1 1 2 4 5 so it is a part of consignment pick up tools and start assembling, time is too short