Programming Question

Assignment #2 Instructions: BMP Image Processing

Through this programming assignment, the students will learn to do the following:

  1. Learn to read and write binary files.
  2. Gain more experience with using pointers.
  3. Gain more experience with dynamic memory allocation and deallocation.

In this assignment, you are asked to manipulate an image from a 24-bit uncompressed bmp file. (The format of bmp files is given in http://en.wikipedia.org/wiki/BMP_file_format). To help with reading and writing the image file, you are given library functions and an example that deal with the bmp file (in a zip file). In the example, the image is flipped horizontally. You are asked to implement some additional functions including the verticalflip(), enlarge() and rotate() functions: the first flips the image vertically, the second is used to enlarge the image by an integer scale factor of 2 or 3; the last one is used to rotate the image either clockwise by 90 degrees or counter-clockwise by 90 degrees.

The program should take the follow command-line options:

% bmptool [-f | -r | -l | -s scale| -v ] [-o output_file] [input_file]

Where -s means to scale the image by a scale factor of 2 or 3 as indicated on the command line with a 2 or a 3, -r means to rotate the image by 90 degrees clockwise, -l means to rotate the image by 90 degrees counter-clockwise, -v means to flip the image vertically and -f means to flip the image horizontally. You can assume for each type (-s, -r, – l, -f, or -v), the command line has at most one option, but that should not affect your code. Only implement each one one time no matter how many times it is included. However, the user may present a combination, say, ‘bmptool -r -s -l -f -v’. If multiple option types are present, the order for processing the image is that you do scale first, then any rotate options, and then flip vertically and finally flip horizontally.

You are required to use getopt() to process the command-line. If ‘-o output_file’ is missing, use standard output. If ‘input_file’ is missing, use standard input. The options to use standard input or standard output will only be used when chaining commands. Make sure the program returns 0 on success. In that case, one can ‘chain’ the commands using pipes, like:

% bmptool -s 2 1.bmp | bmptool -r | bmptool -f -o 2.bmp

Your program needs to provide necessary sanity-check for command line arguments and handle various error conditions and prompt the user with helpful information. You need to use getopt() to process the command line arguments. Test your program with various combinations to make sure it works as expected. You must use dynamic memory to store the content of the new image before writing out to file. You need to reclaim memory afterwards to prevent memory leaks. Please submit your work through Canvas as one zip file called FirstnameLastnameA2.zip. Follow the instructions below carefully (to avoid unnecessary loss of grade). Include your source code, your Makefile, the bmplib files that I have provided, and the example.bmp file in the zip file. I should be able to create the executable by typing ‘make’. The Makefile should also contain a ‘clean’ target for cleaning up the directory (removing all object files). Make sure you don’t include intermediate files: *.o, executables, *~, etc., in your submission. (There’ll be a penalty for including unnecessary intermediate files).

If the program does not compile and do something useful on ocelot when it runs it will not earn any credit.


Order the answer to view it

Assignment Solutions


Assignment Solutions

ORDER THIS OR A SIMILAR PAPER AND GET 20% DICOUNT. USE CODE: GET2O

Posted in Uncategorized

Programming Question

I’m working on a mathlab question and need an explanation to help me learn.

This is a MATLAB assignment; First We have 3 files:

File1.mat, File2.mat, distortion.mat

0. We have samples (X_i, Y_i, Z_i).The X_i is unknown but Y_i, Z_i are known.We want an estimator Xhat_i based on Y_i and Z_i.

1. If you prefer to use another language, you will need to somehow extract the data from the .mat files.

2. If you run distortion.m it loads the data from File1.mat

3. The data in File1.mat contains:

Numsamples(this is 100)

Xtrain

Ytrain

Ztrain

Y

Z

All vectors are size 100.

I have generated (X_i, Y_i, Z_i) as i.i.d. vectors with a joint distribution that is unknown to you. The training data (Xtrain, Ytrain, Ztrain) includes 100 samples of “ground truth” data from which you can train your estimator (it includes the X information).The data Y, Z is independently generated the same way, but the true X is hidden from you.You need to design an estimator Xhat(i) with the goal of minimizing distortion:

distortion=(1/100) ^2

You do not yet know the X(i) values.In the distortion .m file I give a pretend value that is always 0 so you can see how distortion is calculated.

4. The file File2.mat has the same format, but the i.i.d. vectors (X_i, Y_i, Z_i) were generated using a different distribution.

5. You should write a program to generate a 100 x 1 estimate vector Xhat1 (for File1 data) and another 100 x 1 vector Xhat2 (for File2 data).Your estimate vector will be compared to the true X1 and X2 vectors (currently unknown to you) so that distortion can be calculated. You can do anything you want to estimate (linear, nonlinear, some type of machine learning)but try to design an estimator that you think is good.

6. The assignment: You will write up a brief description of the method or methods you used to estimate the X data for File1 and File2, including your computer code.You will eventually be given the true data, along with the matlab program to show how the data was generated, from which you can calculatedistortion.Then write up a retrospective note on lessons learned and/or modifications that could have been done.

I have placed the true vectors for X in scenario 1 and 2 : FileTrue1.mat and FileTrue2.mat, along with the software I used to generate them (Generate1.m, Generate2.m).

you should calculate your distortion relative to the true data in FileTrue1.mat and FileTrue2.mat, and explore some aspect of the system, for example if we change Generate1.m and Generate2.m to use NumSamples=10000 instead of NumSamples=100, how does performance change?


Order the answer to view it

Assignment Solutions


Assignment Solutions

ORDER THIS OR A SIMILAR PAPER AND GET 20% DICOUNT. USE CODE: GET2O

Posted in Uncategorized

Programming Question

I will be attaching zip file for usuage.mat (data) and the midterm in pdf file. this will help you code the project and the final is the modification to the midterm.

after reviewing and coding midterm, then apply the new changes (final) the instructions below.

Guidelines and Deliverables

As usual, create a script, include a comment at the top explaining the purpose of the script, your name, and the date it was created. The goal of this project is to estimate the daily energy production over a week of a typical residential solar panel, compare it to the energy usage of a home and determine how many solar panels are required to fulfill the energy needs of the residence.

1. For the midterm project, your computeEnergy function took in as input the number of panels and computed the amount of energy produced in a typical day. The amount of energy produced by a panel depends on the time of day and can be modeled by the mathematical formula below, where t is an array of values from 1 to 24 hours.

Update computeEnergy( ) to perform this task symbolically. Use the built in integral function, int( ) to find the kilo-Watt-hours produced in a day. Plot your integral function from 0 to 24 hours.

2. From the midterm project, you wrote code to calculate how many panels would be required to fulfill the energy needs for a home. Suppose an inverter device is needed for each panel in the array and is connected in parallel to one power source. The video below shows how to use linear algebra in MATLAB to solve for the current in each branch containing an inverter. Write a function called findCurrents( ) that takes in as input the number of panels you computed in the midterm project and returns a vector of currents in each branch. Let the source voltage, Vs, be 100V and the value of each resistance be 1500 ohms.

Video: How to solve a system of linear equations corresponding to circuit currents in MATLAB

Pease comment the codes thoroughly (every single line of the code must be well commented, like what each line do) make sure the main code and the functions are work fine. This work must be original with zero plagiarism.


Order the answer to view it

Assignment Solutions


Assignment Solutions

ORDER THIS OR A SIMILAR PAPER AND GET 20% DICOUNT. USE CODE: GET2O

Posted in Uncategorized

Programming Question

Q.1) The key technique in dynamic-programming [algorithm] to store the solution to each subproblem in case it should reappear.

Group of answer choices

True

False

Q.2) True or false:

Dynamic programming is a kind of greedy algorithm?

Group of answer choices

True

False

Q.3) True or false:

Dynamic programming works best when solutions to subproblems can be memorized.

.

Group of answer choices

True

False

Q.4) Traveling Salesman Problem is a problem whose objective is to find the longest possible route that visits each city exactly once and returns to the starting city.

Group of answer choices

True

False

Q.5) Weight – A number assigned to an edge of a graph as a way of representing a cost, time, distance, etc. associated with traveling that edge.

.

Group of answer choices

True

False

Q.6) What is the output [result] of the algorithm below:

1 def fib_rec(n):
2 if n == 1:
3 return [0]
4 elif n == 2:
5 return [0,1]
6 else:
7 x = fib_rec(n-1)
8 # the new element the sum of the last two elements
9 x.append(sum(x[:-3:-1]))
10 return x
11 x=fib_rec(5)
12 print(x)

0, 1, 1, 2, 3,

1, 1, 2, 3, 4

0, 0, 1, 1, 2, 2, 3, 3

Q.7) Divide-and-conquer algorithms – The algorithms partition the problem into separate subproblems, solve the subproblems recursively, and then combine their solutions to solve the original problem.

Group of answer choices

True

False

Q.8) True or false:

Dynamic programming works best when solutions to subproblems can be memoized.

Group of answer choices

True

False

Q.9) Sort the list below using LSD Radix sort.

1347, 1610, 162, 1300, 733, 62, 4, 1688, 2254, 1347, 860, 1647, 1600, 1444

Show all work – Details please.

Q.10) Sort the list below using MSD Radix sort.

1347, 1610, 162, 1300, 733, 62, 4, 1688, 2254, 1347, 860, 1647, 1600, 1444

Show all work – Details please.

Q.11) Your given the compressed files and the table below. What is the message in the file?

01001001101011010110010111010011110111101000000101111010011100111010000101101100010001011001110111000001001001100111111011101111101100101101111010001011011110100010110000101111011101111101001110011101000101101111011000001100110001110011000111

Q,12) The height of a tree is the length of the longest root-to-leaf path in it. The maximum and minimum number of nodes in a binary tree of height 6 are ….

Group of answer choices

128 and 8, respectively

128 and 7, respectively

127 and 6, respectively

127 and 7, respectively

Q.13) Which of the following sequences represents the post order traversal sequence of the given tree below?

a
/ \
b e
/ \ /
c d f
/
g

Group of answer choices

g c b d a f e

g c d b f e a

f e d g c b a

f e g c d b a

Q.14) Which of the following statement is true about Binary Trees

A Every binary tree is either complete or full.
B Every complete binary tree is also a full binary tree.
C Every full binary tree is also a complete binary tree.
D No binary tree is both complete and full.
E None of these answers are true.

Group of answer choices

E

A

B

D

C

Q.15) What is a full binary tree?

Group of answer choices

All nodes have exactly two children

Each node has exactly zero or two children

All the leaves are at the same level

A tree In which all nodes have degree 3

Q.16) TRUE/FALSE

In a binary search tree, a new element is always added as a leaf.

Group of answer choices

True

False

Q.17) The number of edges from the root to the node is called ______________ of the tree.

Group of answer choices

Circumference C= 2πR

Depth

Width

Length

Height

Q.18) In a full binary tree if there are L leaves, then total number of nodes N is derived by the formula _________________________.

Group of answer choices

N = 2*L – 1

N = 2*L

N= n log n

N = L – 1

Q.19) FILL IN THE BLANK

A ___________ is a complete binary tree in which each element is greater than or equal to both of its children.

Q.20) FILL IN THE BLANK

A binary search tree that is highly unbalanced is called a ___________ tree.

Q.21) Match the following definitions of a binary tree….

Group of answer choices

Directed Edge

Root Node

Leaf Node

Depth

Level

Height

Q.22) Research Question:

  • What is Counting Sort? (4)
  • Write the pseudocode for counting sort. (8)
  • What is the worst case for counting sort? (4)
  • Use counting sort, sort the following items. (24)

2, 3, 1, 4, 1, 7, 8, 1, 2, 2, 3, 9, 1, 7, 1

Show all work – full diagrams.


Order the answer to view it

Assignment Solutions


Assignment Solutions

ORDER THIS OR A SIMILAR PAPER AND GET 20% DICOUNT. USE CODE: GET2O

Posted in Uncategorized

Programming Question

you need to implement the Snakes and Ladders game on the NEXYS 4 DDR FPGA board. The Boards include eight 7-segments, 16 Switches, 16 LEDs, and (5+2) push buttons as below. (CPU RESET and PROG are also push buttons)

Game Rules:

Figure 1 shows the play board. As seen the X and Y positions range between 0 to 9 for each player. If the player lands up at the head of the snake, the player moves down to the tail of the snake. If the player lands at the bottom of the ladder, the player moves to the top of the ladder. For example, if a player reaches to location (1, 3) that is related to position 39 in Figure 1, he/she should move to location (2,0) shown by 3 through the snake. However, if a player reaches to location (1,0) that is position 2, he/she should move to the location (2,2) that is position 23 through the ladder.

Please consider the following notes. The notes are based on the FPGA board schematic shown in Figure 2. 2 Figure 2: NEXYS 4 DDR FPGA board

  • The game is started on the push of switch 7 from off to on (i.e., down to up). Ifthe switch 7 is off the game should be reset to initial state.• The game is played between two players. Both players start at position (0,0).•
  • The player one starts first by rolling of the dice.• The dice value is a random number between one and six. To throw the dice,player one uses switch 15 and player 2 uses switch 0 (as shown in Figure 2). Youcan implement the dice by generating a random number via a counter countingbetween 1 and 6 running under the system clock frequency (CLK100MHZ).When switch 15 or switch 0 changes from off to on (i.e., down to up), the countervalue is captured as the dice value. Note that for the next dice throwing, youshould move the switch from on to off first and then off to on.•
  • After the dice is thrown by each player, he/she moves on the board by using pushbuttons to move up, down, left or right (See push buttons in Figure 2). Note thatthe dice value for each player should be shown on the related 7-SEG discussedbelow.Example: Suppose the player 1 is at position 8 on the board and the dice roll upis 6. The player needs to move to position 14. For doing so, player 1 will pressthe right push button twice, followed by pressing the up push button once,followed up by pressing the left button triple times.•
  • After each player is done with the movements, by using the push buttons, he/sheshould press the center push button to indicate that the turn is over.• If the player moved correctly via the push buttons, his/her location (X and Ypositions) is updated on the seven segments (discussed later). However, if themoves are considered as wrong (after the push of center push button), the gameis over and the player loses it.•
  • Any player reaches first to the location (0,9), wins the game.•
  • In case, the player one wins the game, the LED 15 blinks, and if the player twowins the game, the LED 0 blinks.3Note on dice throwing:• When you move the switch from off to on you may have a transient change(glitch) in the signal related to the switch. So, you should use a filter for yourswitches as well as all push buttons. You already have the filter.v fromassignment 3.Seven SegmentsFigure 3: Eight Seven-segments included in the FPGAThe eight seven-segments included in the board are numbered from zero to sevenstarting from right. They show values as below:•
  • The 7SEG 7 and 7SEG 6 show the location of the first player at each time (Xcoordinate and Y coordinate, respectively), each between 0 and 9.• The 7-SEG 5 shows the dice number for player 1 (between 1 and 6).•
  • The 7SEG 4 and 7SEG 0 are not used.• The 7SEG 3 and 7SEG 2 show the location of the second player (X coordinateand Y coordinate, respectively), each between 0 and 9.•
  • The 7-SEG 1 shows the dice number for player 2 (between 1 and 6).Snake and Ladder Locations:Use the module (memory.v) given to you for uploading the locations of the snakes andladder. You should instantiate that module in your top module.To instantiate that module, you can include the following line in your top module:memory inst (.Address(mem_addr), .Data(mem_out));Here, mem_addr is a 4-bit address and mem_out is a 16-bit data.The lines 9 to 24 in memory.v indicate the start and stop coordinates for snakes andladders. In each line, the first and second 4 bits show the X and Y position of the starting4point of a snake or a ladder, respectively. In addition, the third and forth 4 bits representthe X, and Y locations of the stopping point of the same snake/ladder.For example, if we have 00010011001000001, it shows a snake going from (1,3) to(2,0). This entry is snake (as the destination is lower then source), but you don’t needto know if it is a ladder or snake. Your algorithm behaves the same for ladders andsnakes.Note that you should be able to use any map for ladder/snake positions in your code. Itmeans that if the values uploaded as the ladder/snake locations through memory.v file(that you were given) is changed, your implementation should operate properly basedon the new map. However, for the sake of simplicity, we assume that at most, thenumber of snakes and ladder, together, is 16. So, the code that you write should begeneric in a sense that it should work for any positions of snakes and ladders (totally upto 16).Deliverables•
  • Complete implemented project.•
  • A report explaining your design. The report should include a complete diagramof the design and a brief explanation of each part of design (not explaining thequestion).10-point Bonus (Due Tuesday Oct. 26)You get 10 extra point if you implement the dice throwing parts and showing the valueson the related seven segments for both players

  • Order the answer to view it

    Assignment Solutions


    Assignment Solutions

    ORDER THIS OR A SIMILAR PAPER AND GET 20% DICOUNT. USE CODE: GET2O

    Posted in Uncategorized

    Programming Question

    Due: Friday, Tuesday 9, 8:30 am(EST)

    Use JavaFX in Intelijj

    Overview
    --------

    In this assignment, you will further demonstrate your ability to develop
    applications that use the Model-View-Controller pattern. You will
    develop a simple graph editor with multiple views, where the user can
    interactively add to and manipulate objects from the graph.

    **NOTE**: This assignment will best be accomplished by drawing on the canvas rather than using the Shape classes.

    Part 1: A Basic JavaFX Graph Editor
    -----------------------------------

    Build a simple GUI in only JavaFX that allows the user to create and
    manipulate a graph.

    ### Interface requirements

    - A main panel with size 500x500; this is the area where the user will
    interact with the graph (see below)

    - The main panel shows all graph vertices, labels, and edges

    ### Interaction requirements

    - Clicking on the background of the main panel creates a new vertex, drawn as a blue circle with an integer label

    - Clicking down on an existing vertex selects that vertex (shown by drawing the vertex in orange); dragging then moves the vertex. Releasing the mouse returns the vertex to blue.

    - If the user Shift-Clicks a vertex, the vertex gets a thicker black border, and then when the user drags, an edge is drawn to the mouse location. If the user releases the mouse on another vertex, the edge is added to the graph (if the user releases on the background, the edge is discarded).

    | ![](media/Picture1.png) | ![](media/Picture2.png) |![](media/Picture3.png) |
    |:---:|:---:|:---:|
    | Main graph view | User clicks on vertex 1 | User shift-clicks on vertex 0 then drags |

    ### Software requirements*: - You must implement the system using Model-View-Controller, with correct separation between these components - Create separate classes for the Model, the View, and the Controller, following the examples given in class and available on the examples repo - Build the system using the following classes: - **Main:** JavaFX application class - **GraphModel**: Class to store the model - **Vertex**: Represents a vertex (circle) in the graph - **Edge:** Represents an edge in the graph - **GraphView:** A custom view for drawing the graph - **GraphViewController:** Controller for the GraphView ### Resources for part 1: - MVCSquareDrawing - in Examples Repo - GetNotifiedOfChangeInSimpleList in examples repo Part 2: Adding Interface State ------------------------------- In the second part of the assignment you will extend your system from part 1 to add the ability to make vertices of different colors and to delete vertices. ## Additional interface and interaction requirements - You will create a ToolBar in FXML, that contains two groups of ToogleButtons. One for colors to use when creating the Vertices, and one for actions to take (either to create Vertices and Edges, or to delete vertices). - There is a separator between both groups of buttons. - Buttons are colored corresponding to the resulting Vertex color. - When in create mode the interface behaves as in Part 1, but additionally creates vertices of different colors. - When in delete mode, the only action that can take place is that a vertex can be deleted. - When a vertex is deleted, other vertices are relabeled (see the images below). - All edges connected to the deleted vertex are also deleted (see the images below). - To make sure that delete mode is visible while in delete mode, the cursor should change to a crosshair while over any vertex, but appear normal otherwise. ### Additional software requirements - You must continue to implement the system using Model-View-Controller, with correct separation between these components, as best as possible. - You can add a Color instance variable to your Vertex class, if you don't already have one. - You should add the following classes/fxml documents: - **toolbar.fxml:** provides the toolbar view - **ToolBarController:** the controller for the toolbar. - **InteractionModel:** Stores the state of the interface that can queried by other classes. - You should update your existing classes to make use of the new classes appropriately - The GraphView and Toolbar can be added to the scene in a BorderPane | ![](media/Picture4.png) | ![](media/Picture5.png) | |:---:|:---:| ### Resources for Part 2 - How to change the cursor: <https://blog.idrsolutions.com/2014/05/tutorial-change-default-cursor-javafx/> - ToggleButton Tutorial: <https://docs.oracle.com/javafx/2/ui_controls/toggle-button.htm> - How to do ToggleButtons/Groups in FXML: - <https://stackoverflow.com/questions/34010509/adding-radiomenuitem-to-togglegroup-in-fxml> - <https://docs.oracle.com/javafx/2/ui_controls/toggle-button.htm> - <https://docs.oracle.com/javafx/2/api/javafx/scene/Cursor.html#TEXT> Evaluation ----------- Marks will be given for producing a system that meets the requirements above, and compiles and runs without errors.

    Order the answer to view it

    Assignment Solutions


    Assignment Solutions

    ORDER THIS OR A SIMILAR PAPER AND GET 20% DICOUNT. USE CODE: GET2O

    Posted in Uncategorized

    Programming Question

    For this Assignment, create an alternative version of your “catalog” ordering page. Replace the table that lists all of the available items with a text box where the user can type in an item’s name. Use Ajax to display complete item names as the user types.

    First, create a copy of your catalog page. Replace the table with a text box that will accept an item name. Include an attribute that will call a handler function like this (assuming that you named the handler function handleInput):

    onkeyup=“handleInput(this.value)”

    This will pass the content of the text box to the handler function every time the user finishes typing a character. Also add an empty paragraph that you will fill in with the item description. Include an id=”description” attribute so that your JavaScript can locate the paragraph. Keep the rest of the page content unchanged.

    Next, create the handler function. Unless the parameter contains an empty string, create an XMLHttpRequest object named xhr, Include cross-browser support in your code. Include code to register and specify a receiver function. For now, simply store the xhr.responsetext in the innerHTML attribute of the description paragraph.

    Decide a name for your PHP response document and add open and send calls. Remember to include the item string as a parameter in the URL. Create the response document so that it recognizes item names and returns their descriptions.

    Notice that the code shows a description only when the user completes the item name. Use this fact to give the order button a visibility style of hidden unless the user has entered a valid product name. Modify your validation code correspondingly. Explain how you could modify the response document so that it will match partial item names.

    Here is my page:

    <!DOCTYPE html>
    <!–– Catalog_Page.html
    Catalogue of Motorcycle Equipment
    ––>
    <html lang = “en”>

    <head>
    <title> Motorcycle Equipment </title>
    <meta charset = “utf-8” />
    <link rel=”stylesheet” href=”style.css” class =”description”>
    </head>

    <head>

    <p>
    <th> <h3>If you love to ride a Ducati then enter your information. <h3><th>
    <p>

    <p>
    <label for=”fname”>First name:</label><br>
    <input type=”text” id=”fname” name=”fname”><br>
    <label for=”lname”>Last name:</label><br>
    <input type=”text” id=”lname” name=”lname”>
    <p>

    <p>
    <input type = “submit” value = “Submit Order” />
    <input type = “reset” value = “Clear Order Form” />
    </p>

    </head>
    <body>
    <Form>
    <table border=”7″>
    <caption> <h3>Motorcycle Equipment<h3> </caption>

    <tr>
    <th> Select </th>
    <th> Item </th>
    <th> Picture </th>
    <th class = “description”> Description </th>
    <th> Price </th>
    </tr>

    <tr>
    <td>
    <input type=”radio” name=”info” value=”65.00″ checked>Buy<br>
    </td>
    <td> Ducati Gloves </td>
    <td> <img src = “Ducati_Gloves.jpg” width=”100″ height=”80″ </td>
    <td> Super cool Ducati gloves protect your hands </td>
    <td> $65.00 </td>
    </tr>

    <tr>
    <td>
    <input type=”radio” name=”info” value=”150.00″ checked>Buy<br>
    </td>
    <td> Ducati Shoes </td>
    <td> <img src = “Ducati_Shoes.jpg” width=”100″ height=”80″ </td>
    <td> Super cool Ducati shoes that stick to the peg </td>
    <td> $150.00 </td>
    </tr>

    <tr>
    <td>
    <input type=”radio” name=”info” value=”800.00″ checked>Buy<br>
    </td>
    <td> Ducati Helmet </td>
    <td> <img src = “Ducati_Helmet.jpg” width=”100″ height=”80″ </td>
    <td> Super cool Ducati Helmet to keep your bean safe </td>
    <td> $800.00 </td>
    </tr>

    <tr>
    <td>
    <input type=”radio” name=”info” value=”350.00″ checked>Buy<br>
    </td>
    <td> Ducati Jacket </td>
    <td> <img src = “Ducati_Jacket.jpg” width=”100″ height=”80″ </td>
    <td> Super cool Ducati jacket to keep you warm </td>
    <td> $350.00 </td>
    </tr>

    </table>
    <Form>

    <p>
    Ducati Home Page <br />
    <a href = “Home_Page.html”> Ducati Home Page </a>
    <p>

    </body>
    </html>


    Order the answer to view it

    Assignment Solutions


    Assignment Solutions

    ORDER THIS OR A SIMILAR PAPER AND GET 20% DICOUNT. USE CODE: GET2O

    Posted in Uncategorized