# express代做 | report | 代做Data structure | Algorithm作业 | java | Python代做 – CSC263 Problem Set 3

### CSC263 Problem Set 3

express代做 | report | 代做Data structure | Algorithm作业 | java | Python代做 – 这是一个关于Algorithm的题目, 主要考察了关于Algorithm的内容,是一个比较经典的题目, 涉及了express/report/Data structure/Algorithm/java/Python等代写方面

#### Question 1: Alice Mazes

Alice Mazes (http://www.logicmazes.com/alice.html) are puzzles created by Robert Ab- bott. They are based on Lewis CarrollsAlice In Wonderlandwhere Alice grows and shrinks during the story. Read the puzzle instructions from Abbotts site. Unfortunately, Abbott passed away a few years ago and the applet for executing the mazes has not been maintained. This means that you cant run the mazes and you will need to read the text below the first maze to learn how they work. Sadly the only example maze visible on Abbotts site does not have red or yellow arrows. In that example maze, there is no way to change the step size. Below is another example of a simple maze where the solution requires a varying step size. Notice that in this one it is possible to increase the step size and then step right off the maze. That is effectively a dead end.

``````(a) Your first task is to design an efficient  Algorithm and associated data structures to solve
an arbitrary Alice maze. Your algorithm must be guaranteed to find a shortest solution
if one exists. You may assume that every maze is a square, has a single start location,
and has a single goal location. You may also assume that for a given maze cell, all
the arrows are the same colour. For example, in the maze pictured above, the top left
square can not have a red arrow going to the right and black arrows going in the other
directions. You may also assume that the arrows in the start cell are black. Beyond
this, you shouldnt make assumptions about the design.^1 In particular, you should not
assume that there is a solution to the maze. If one does not exist, your program should
stop running and  report this.
Submit a written description of your algorithm. It should be based on a graph algorithm
we learned in class and you should be explaininghow that algorithm is adapted
and applied to this problem. Specifically, describe the data structures you are
using to support your algorithm. The audience is someone who already understands
the algorithms we learned and the specific terminology we used in lectures so you can
refer to those terms.
``````
``````(b) Design your own concise text (i.e. human readable) representation of a maze. Write
clear specifications for this representation. Make sure that your design can represent any
maze that meets the assumptions specified above. As an example in your explanation,
``````

(^1) In all of Abbotts mazes, the outer cells never have arrows pointing off the maze, but you dont need to add this constraint or make this assumption.

``````include the representation for the small maze above and then also submit the input file
for this maze to MarkUs using the filenameexamplemaze.txt.
``````
``````(c) Implementyour algorithmin Python. You must have a single fileAlice.pyand it
must not import any  Python modules other than sys (which you need for command-line
argument processing.) The output of your program should be a shortest path through
the maze as well as the length of this shortest path. The exact format of this output
is up to you and may depend on your maze representation. Your program must run
on teach.cs with the following commandpython3 Alice.py inputfilename. You can
assume that the inputfilename passed to your program in the command-line argument
corresponds to avalidmaze file according to your representation in part b. It is fine
to fail spectacularly if this assumption is violated. Dont spend time on error checking
the input but do use excellent coding style including variable names and comments
that will help the marker see immediately how your code connects to the algorithm you
described in part a.
sample code for reading the command-line argument and opening and reading from a
file.
``````

(^2) You might need to compress the images to keep Q1.pdf within the Markus submission size limits

Expectations for Question 1

There are multiple learning goals for this question. One is for you to solidify your knowledge of graph algorithms by doing some actual implementation and designing test cases. The second is for you to practice concisely communicating to a technical audience. While it is important that your program works correctly, the majority of the marks will not come from part (c). Do not leave the testing or the written explanations as after thoughts or assign either of these tasks to a single person. Both partners should be involved in the designing, coding, testing and writing.

#### Question 2: Detecting a Sun

An undirection graph on 2nvertices is asunif it consists of a single cycle of lengthn, each node in the cycle is connected to exactly one node of degree one, and there are no other cycles in the graph. For example, the following graph is a sun on 12 vertices.

``````(a) Suppose that you are given the adjacency list representation of an undirected graph
with 2nnodes. Describe an algorithm that determines whether the graph is a sun.
Your algorithm must run inO(n) time.
(b) Explain why your algorithm is correct.
``````
``````(c) Justify that it runs in the required time.
``````

#### Question 3: Amortized Analysis

The Vector class in java is essentially implemented as a dynamic array. When you instantiate a Vector, you can specify aninitial capacity(of the array) and acapacity increment(a fixed amount by which to grow the array each time it expands). Note that the capacity increment is additive, not multiplicative (i.e., new capacity = old capacity + increment). In this question, we will redo the dynamic array analysis we did in lecture using a capacity increment instead of a multiplicative expansion factor. We will still assume (as we did in lecture) that the only operation that can be performed on the Data structure isInsert.

``````(a) Suppose the initial capacity and the capacity increment are both equal to 10, and we
use the accounting method with the same charge and cost as we used in lectures (i.e.,
eachInsertis charged \$5 and costs \$1 per array access.) Determine how manyInsert
operations it will take before the data structure runs out of money, or prove that it never
runs out.
(b) Letbbe the initial capacity as well as the capacity increment, as above, wherebis a
positive integer constant. Starting with \$3 perInsert, suppose we increase the charge
``````
``````perInsertby \$2 each time the array grows. So afterbcalls toInsert, the charge
becomes \$5, and after 2bInserts, the charge becomes 7, etc. Determine how many
Insertoperations it will take before the data structure runs out of money, or prove
that it never runs out.
``````
``````(c) Using the aggregate approach, compute the amortized complexity ofInserton this
data structure, using some positive integer b for the initial capacity as well as the
capacity increment, for a sequence ofmInsertoperations performed on an initially
``````

#### Question 4: Disjoint Set Representations

LetT1,T2, andT3 be three tree implementations of the disjoint set ADT.T1 uses union- by-weight without path compression,T2 uses union-by-weight with path compression,T 3 uses union-by-rank with path compression all as discussed in lectures this term.

Consider a sequence of MAKE-SET, FIND-SET, and UNION operationsP=P 1 , P 2 , …, Pn, and suppose we performPon each ofT1,T2, andT3 (in each case starting with an empty ADT.) For a UNION(x, y) operation, when there is a choice, assume that the representative of the set that containsxbecomes the new representative.

Two collections of trees are consideredequivalent if they store the same items and can be drawn to look the same.

``````(a) What is the smallest numbernsuch thatT1 andT2 are not equivalent after executing
``````(b) What is the smallest numbernsuch thatT2 andT3 are not equivalent after executing