Attached will be the rubric my task I have chosen is:

I am writing a python program to access my schools linux server using python. logging on as myself then executing  ypcat passwrd | awk -F “:” ‘print $1’ > users_on.txt  . Everything must be in in one py file.
My train of though it using python to access Putty, log in as my self run the command above to get the users then use a password breaker that I will provide (that I think I made effectively ) to try all 8 (maybe 9) digit numerical passwords if successful increase a counter by 1 and save that username and password to a file.

This homework is a series of functions related to data structures.

Here are all the function headers and docstrings for the ten assigned functions: P7: Data StructuresPreview the document.

The rubric for this homework is a bit different than usual–it is binary. You will get either full credit or zero for each function. You will get full credit if and only if your function has the exact docstring as in p7_data_structures_docstrings.py, follows any explicit instructions in the comment, the print function is not called, and the doctests for that function work without errors (see Worksheet 13: Doctests for a description of how to run doctests–it is NOT sufficient to just run these tests informally yourself).

This homework is a series of functions related to data structures.

Here are all the function headers and docstrings for the ten assigned functions: P7: Data StructuresPreview the document.

The rubric for this homework is a bit different than usual–it is binary. You will get either full credit or zero for each function. You will get full credit if and only if your function has the exact docstring as in p7_data_structures_docstrings.py, follows any explicit instructions in the comment, the print function is not called, and the doctests for that function work without errors (see Worksheet 13: Doctests for a description of how to run doctests–it is NOT sufficient to just run these tests informally yourself).

This homework is a series of functions related to data structures.

Here are all the function headers and docstrings for the ten assigned functions: P7: Data StructuresPreview the document.

The rubric for this homework is a bit different than usual–it is binary. You will get either full credit or zero for each function. You will get full credit if and only if your function has the exact docstring as in p7_data_structures_docstrings.py, follows any explicit instructions in the comment, the print function is not called, and the doctests for that function work without errors (see Worksheet 13: Doctests for a description of how to run doctests–it is NOT sufficient to just run these tests informally yourself).

This homework is a series of functions related to data structures.

Here are all the function headers and docstrings for the ten assigned functions: P7: Data StructuresPreview the document.

The rubric for this homework is a bit different than usual–it is binary. You will get either full credit or zero for each function. You will get full credit if and only if your function has the exact docstring as in p7_data_structures_docstrings.py, follows any explicit instructions in the comment, the print function is not called, and the doctests for that function work without errors (see Worksheet 13: Doctests for a description of how to run doctests–it is NOT sufficient to just run these tests informally yourself).

This homework is a series of functions related to data structures.

Here are all the function headers and docstrings for the ten assigned functions: P7: Data StructuresPreview the document.

The rubric for this homework is a bit different than usual–it is binary. You will get either full credit or zero for each function. You will get full credit if and only if your function has the exact docstring as in p7_data_structures_docstrings.py, follows any explicit instructions in the comment, the print function is not called, and the doctests for that function work without errors (see Worksheet 13: Doctests for a description of how to run doctests–it is NOT sufficient to just run these tests informally yourself).

This homework is a series of functions related to data structures.

Here are all the function headers and docstrings for the ten assigned functions: P7: Data StructuresPreview the document.

The rubric for this homework is a bit different than usual–it is binary. You will get either full credit or zero for each function. You will get full credit if and only if your function has the exact docstring as in p7_data_structures_docstrings.py, follows any explicit instructions in the comment, the print function is not called, and the doctests for that function work without errors (see Worksheet 13: Doctests for a description of how to run doctests–it is NOT sufficient to just run these tests informally yourself).

I have attached the .zip file that contains all the info you should need to complete the project (declaration, functions needed, instructions, etc.). You must create a maze using C++, then use recursion to solve the maze and print the output. Just be sure to use the functions included in maze.h!

Poker #1
For this program, refer to programming exercise 14.3, on page 586 in your textbook. Instead of 3 cards, you should deal a full poker hand of 5. Note: your program should not allow a given card to be dealt twice in the same hand. The image files you need to use should have been downloaded alongside this word file.

For this program, simply submit the java, UML, and readme files in a compressed folder.