Java代写 | CS146 Data Structures and Algorithms Project


CS146 Data Structures and Algorithms
Fall 2019, Instructor: K. Potika SJSU CS Department
Programming Project 1 (A & B)
Important: Do individually (each student alone is NOT a group assignment), each student has to turn in a java program. For this project we will have Code review with the grader or the Instructor. Copying from other students or other resources is plagiarism.
A. Data Shuffling
You are assigned to implement an data shuffling project that gives a dataset and produces a new one shuffled (permutation of the original dataset). Each row is considered an element.
Use the Fisher–Yates shuffle algorithm that works in O(n) running time, that relies on creating pseudo-random numbers (see end for help) in O(1) running time.
Data masking or obfuscation for security purposes. Machine learning to avoid patterns and bias before the training phase. Deck of cards etc. Can you think of other applications?
The basic idea is to start from the last element, swap it with a randomly selected element from the whole dataset (including last). In the next step you will consider the rows from 0 to n-2 (size reduced by 1), and repeat the process until you reach the first element.
Follow the next pseudocode to shuffle:
for i=n-1 downto 1 //index starts from 0 j = random integer with 1 <= j <= i exchange a[j] and a[i]
Write a program that uses the provided ErdosCA.txt as input and outputs the shuffled array in a file called LastNameFirstNameShuffled.txt.
Count the time to read from file, to shuffle the elements and to create the output file. Note: To count the time use system.currentTimeMillis().
Create appropriate JUnits to test your program. Help with JUnits: Instructions for developing JUnit:
• To compare two text files in Junit, you can try the following code. Use BufferedReader to read the input files.
Use the provided Erdos Collaboration Networks (see more about the mathematician Paul Erdős and the Erdős number). The file is the ErdosCA.txt, the first line contains the distinct numbers in each column (2 values) and the total number of rows.

BufferedReader Out=new BufferedReader (new FileReader (<Path of output file>)); BufferedReader In=new BufferedReader (new FileReader (<Path of input file>)); while ((expectedLine = In.readLine ()) != null) {
String actualLine = Out.readLine ();
assertEquals (expectedLine, actualLine);
• Set seed value as 20.
Random r=new Random();
Compare the output file with attached see next:
if you use nextDouble() use Target1.txt to compare
double d = random.nextDouble();
int j = (int)(d*arr.length);
else if you use nextInt() use Target2.txt
B. Circular linked list game
In an ancient land, a King had many prisoners. He decided on the following procedure to determine which prisoner to grand freedom. First, all of the prisoners would be lined up one after the other and assigned numbers. The first prisoner would be number 1, the second number 2, and so on up to the last prisoner, number n . Starting at the prisoner in the first position, he would then count k prisoners down the line, and the kth prisoner would be eliminated from winning her/his freedom removed from the line. The King would then continue, counting k more prisoners, and eliminate every kth prisoner. When he reached the end of the line, he would continue counting from the beginning.
For example, if there were six prisoners, the elimination process would proceed as follows (with step k=2):
1->2->3->4->5->6 Initial list of prisoners; start counting from 1. 1->2->4->5->6 Prisoner 3 eliminated; continue counting from 4. 1->2->4->5 Prisoner 6 eliminated; continue counting from 1. 1->2->5 Prisoner 4 eliminated; continue counting from 5.
1->5 Prisoner 2 eliminated; continue counting from 5. 1 Prisoner 5 eliminated; 1 is the lucky winner.
Pseudocode and Output
Write a program that creates a circular linked list of nodes to determine which position you should stand in to win your freedom if there are n prisoners. Your program should simulate the elimination process by deleting the node that corresponds to the prisoner that is eliminated for each step in the process.
Count the time to create list, to delete one single node and time to find the winner. Note: To count the time use system.currentTimeMillis().
Create appropriate JUnits to test your program.

Help with JUnits:
Instructions for developing JUnit:
1. Uponcreationoflinkedlist,
1. CheckiflinkedlistisemptyusingassertTrue.
2. Checkiflengthis0usingassertEquals.
3. Similarly,afteraddingelements,linkedlistshouldnotbeemptyandsizenotequalto0.
Sample code: @Test
public void test() {
linkedList prisoners=new linkedList();
assertTrue(prisoners.isEmpty()); //before inserting, list is empty assertEquals(0, prisoners.size); // Size is 0
assertFalse(prisoners.isEmpty()); // after inserting element, list is not empty
assertEquals(1,prisoners.size); //size is 1 Test cases:
1. Forn={1,2,3,..,6},k=2,Output:1 2. Forn={1},k=9,Output=1
3. n={1,2,…,7},k=7,Output=4
4. n={1,2,…,12},k=8,Output=2 5. n={1,2,…,5},k=1,Output=3
For both programs:
Programming Standards:
• See project rubric on canvas for details. Deliverables:
ü For JUnit tests check canvas.
ü Use cs146F19.<lastname>.project1 as your package, and Test classes should be your main
java file, along with your JUnit java tests.
ü What to submit to canvas (Steps):
o Export your project on eclipse with your entire project (source code). Otherwise include a Readme file.
o Create a zip file named that includes the exported zip file + pdf report
o upload the last zip file to canvas.
ü All projects need to compile. If your program does not compile you will receive 0 points on this
ü Do not use any fancy libraries. We should be able to compile it under standard installs. Include
a readme file on how to you compile the project.


本网站支持淘宝 支付宝 微信支付  paypal等等交易。如果不放心可以用淘宝交易!

E-mail: [email protected]  微信:itcsdx