Description
SATA drives make use of ____________________ -conductor cable. A. 4 B. 5 C. 6 D 7
User generated content is uploaded by users for the purposes of learning and should be used following Studypool's honor code & terms of service.
Explanation & Answer
Review
Review
Anonymous
Really useful study material!
Studypool
4.7
Trustpilot
4.5
Sitejabber
4.4
24/7 Homework Help
Stuck on a homework question? Our verified tutors can answer all questions, from basic math to advanced rocket science!
Most Popular Content
5 pages
Time Series
Over time, time-series has continued to evolve, and different scholars have continued to utilize its presence in providing ...
Time Series
Over time, time-series has continued to evolve, and different scholars have continued to utilize its presence in providing possible solutions and ...
1.6 - Assignment: Identifying Research Problems and Hypotheses
Use the Hunt Library (Links to an external site.)Links to an external site. EAGLEsearch function to identify another "Scho ...
1.6 - Assignment: Identifying Research Problems and Hypotheses
Use the Hunt Library (Links to an external site.)Links to an external site. EAGLEsearch function to identify another "Scholarly-Peer Reviewed" article in your area of interest. Be sure that this article is a true research article, as outlined previously. This article must be different than the one used in the Module 1.5 discussion. Give a brief summary of the article - a paragraph or two will suffice.Separately, identify the research problem and hypothesis (or hypotheses) in the study. Be sure to quote the research problem and hypothesis in proper APA format.Next, answer the following questions:Did the study shed light on how to better understand or correct the research problem? Why or why not? How did the study answer or address the hypothesis? If so, was the hypothesis correct? Why or why not? Include the appropriate APA formatted reference as it would appear in the reference section of an article.Use standard file type (.doc or .docx). Save your assignment using a naming convention that includes your first and last name and the activity number (or description). Do not add punctuation or special characters.
Java object-oriented GUI programming features, computer science homework help
605.201 Mini-Project 3:
Please do the following to complete this assignment.
Purpose:
The purpose of this project is to ...
Java object-oriented GUI programming features, computer science homework help
605.201 Mini-Project 3:
Please do the following to complete this assignment.
Purpose:
The purpose of this project is to provide non-trivial practice in the use of Java object-oriented GUI
programming features to implement an object-oriented GUI design and have a bit of fun doing it.
Resources Needed:
You will need a computer system with Java 7 or greater SE edition run-time and Java Development Kit
(JDK). You may optionally use a Java IDE for example NetBeans, Eclipse, etc. However application
builders are not allowed.
Submitted Files:
Design and Analysis:
This is an informal essay-style single-spaced word-processed document. The file formats accepted are
.odt, .doc, and .docx. The length of the document should be between 1 and 1.5 pages. The following
subjects should be discussed in this order:
1. General program design. How is the program organized? What major data structures were
used? How did you divide the functionality among your classes? How are commands
processed? Etc.
2. What alternative approaches were considered and why were they rejected?
3. What did you learn from doing this project and what would you do differently?
Source files:
Each public class must be contained in a separate Java source file. Only one source file will have a
main() method and this source will be named SongDatabase.java. Other source/class names are up to
you following the guidelines specified so far in the course.
The format of the Java source must meet the general Java coding style guidelines discussed so far
during the course. Pay special attention to naming guidelines, use of appropriate variable names and
types, variable scope (public, private, protected, etc.), indentation, and comments. Classes and
methods should be commented with JavaDoc-style comments (see below). Please use course office
hours or contact the instructor directly if there are any coding style questions.
JavaDocs:
Sources should be commented using JavaDoc-style comments for classes and methods. Each class
should have a short comment on what it represents and use the @author annotation. Methods should
have a short (usually 1 short sentence) description of what the results are of calling it. Parameters and
returns should be documented with the @param and @return annotations respectively with a short
comment on each.
JavaDocs must be generated against every project Java source file. They should be generated with a
-private option (to document all protection-level classes) and a –d [dir] option to place the resulting
files in a javadocs directory/folder at the same level as your source files. See the JavaDocs
demonstration for more details.
Submit file:
The submit file is to be a Zip file containing your design and analysis document, your Java sources, and
your javadocs directory/folder. Any appropriate file name for this Zip file is acceptable.
If you know how to create a standard Java JAR file, this is also acceptable for your source code.
However, make sure you include the source code in your JAR file.
Collaboration:
It is encouraged to discuss technical or small design parts of this project with your fellow students.
However the resulting design and implementation must be your own. For example, it is acceptable to
discuss different ways of maintaining the system state but not detailed design or implementation
information on processing the purchase command. When in doubt, ask during office hours or contact
your instructor.
Program Specification:
This project involves implementing a Java program that builds and manages a database of songs using
a GUI-based user interface.
The application will consist of a single frame that allows a user to add, edit, or delete songs from the
database. Here’s a rough prototype for what the frame might look like. Yours doesn’t have to look
exactly like this…the prototype is provided just to help you envision the ultimate application.
The application shall work as follows:
1. Upon start-up, the application will read the database file. The path of the database file will be
supplied by a run-time parameter. If the database file does not exist, the user will be told the
database does not exist and prompted (non-GUI text prompt) asking if they want to create a new
one. If the user answers positive, the application will continue with an initially empty song
database. If the user answers negatively, the application will exit. An example of an appropriate
start-up command is as follows:
java SongDB mySongDB.data
2. The original state of the frame shall display the combo box with the first song in the database
selected. The Item Code, Description, Artist, Album, and Price fields for this item shall be
displayed with the fields disabled (non-editable). The Add, Edit, Delete, and Exit buttons shall be
enabled, and the Accept and Cancel buttons shall be disabled.
3. To add a song, the user clicks on the Add button. This will cause the application to clear and enable
the Item Code, Description, Artist, Album, and Price fields so the user can enter information for the
new song. The Edit and Delete buttons are also disabled, and the Accept and Cancel buttons are
enabled. When the user presses the Accept button, the new song will be added to the database and
combo box. If the user presses the Cancel button, the entry transaction is canceled and the frame
reverts to its original state.
4. To edit an existing song, the user shall select the song from the combo box. The information for the
selected song shall then be displayed in the disabled fields. The user then presses the Edit button,
which enables the Description, Artist, and Price fields. The user may not change the Item Code.
Select Song: Yellow Submarine
Item Code: BT012
Description: Yellow Submarine
Artist: The Beatles
Album: Beatles Greatest Hits 1
Price: 1.99
Add Edit Delete Accept Cancel
Exit
The Add, Edit, and Delete buttons are disabled, and the Accept and Cancel buttons are enabled. If
the user presses the Accept button, the changes are saved and the combo box is updated. If the user
presses the Cancel button, the edit transaction is canceled and the frame reverts to its original state.
5. To delete an existing song, the user shall select the song from the combo box. The information for
the song shall then be displayed in the disabled fields. If the user presses the Delete button, the song
is deleted from the database and the combo box.
6. When the user presses the Exit button the application shall terminate. The current state of the
database shall be saved in a file using the pathname supplied at program start-up (see above).
7. Data fields shall be validated to ensure they are not blank with appropriate error messages
displayed. If the song is a single, the text “None” will be used for the album name. The price field
shall be validated to ensure only numeric data is entered.
Other Activates:
1. Create a compressed zipped folder containing your Design and Analysis document, your Java
source code files, and your javadocs folder.
2. Submit your compressed zipped folder as directed by your instructor.
Assignment Rubric:
Part 70% 80% 90% 100% % of
Grade
Design and
Analysis
Document
All but one subject
addressed with
relevant,
information. Few
minor
typographical
issues. Document
is close to assigned
length
All assigned
subjects address
with mostly
relevant
information.
Nicely formatted
document.
Document is
close to assigned
length
All assigned subjects
address with
accurate and
relevant. Nicely
formatted document.
Document is within
assigned length
All assigned
subjects address
with accurate,
relevant, and
insightful
information.
Very nicely
formatted.
Document is
within assigned
length
15%
Functionality Majority of
required function
parts work as
indicted in the
assignment text.
One major or 3
minor defects. All
major functionality
at least partially
working (example
change provided
but not correct).
Most required
function parts
work as indicted
in the
assignment text
above and
submitted
documentation.
One major or 3
minor defects.
All major
functionality at
Nearly all required
function parts work
as indicted in the
assignment text
above and submitted
documentation. One
to two minor
defects.
All required
function parts
work as indicted
in the assignment
text above and
submitted
documentation.
50%
Design document
does not fully
reflect
functionality.
least partially
working
((example
change provided
but not correct).
Code Majority of the
code conforms to
coding standards as
explained and
demonstrated so far
in the course (ex.
method design,
naming,
formatting, etc.).
Five to six minor
coding standard
violations. Some
useful comments.
Some JavaDocs
commenting.
Code compiles
with multiple
warnings or fails to
compile with
difficult to
diagnose error.
Most of the code
conforms to
coding standards
as explained and
demonstrated so
far in the course
(ex. method
design, naming,
formatting, etc.).
Three to four
minor coding
standard
violations.
Mostly useful
comments.
Public class
JavaDocs
complete. Code
compiles with
one to two
warnings.
Almost all code
conforms to coding
standards as
explained and
demonstrated so far
in the course (ex.
method design,
naming, formatting,
etc.). One to two
minor coding
standard violations.
Appropriate level of
useful comments.
Public class
JavaDocs complete.
Code compiles.
Code compiles with
no errors or
warnings.
All code
conforms to
coding standards
as explained and
demonstrated so
far in the course
(ex. method
design, naming,
formatting, etc.).
Appropriate level
of useful
comments.
Complete
JavaDocs as
specified. Code
compiles with no
errors or
warnings.
25%
Submit
package
More than one file
submitted in
incorrect format.
Files not enclosed
in the specified
compressed file.
All but one file
submitted in
correct format.
Files not
enclosed in the
specified
compressed file.
All file submitted in
correct format but
not in the specified
compressed file.
All file submitted
in correct file
formats and
compressed as
specified.
10%
University of Central Florida Algorithms & Data Structures for Road Routes Project
I'm working on a algorithms & data structures project and need a reference to help me learn.The language used for this pro ...
University of Central Florida Algorithms & Data Structures for Road Routes Project
I'm working on a algorithms & data structures project and need a reference to help me learn.The language used for this project is C++Also
I thank anyone attempting this, this is the reality of inexperienced
professors that put us students through so much. Please help me if you
can. Thank you so much, very much appreciated.you
will develop algorithms that find road routes through the bridges to
travel between islands.The input is a text file containing data about
the given map. Each file begins with the number of rows and columns in
the map considered as maximum latitudes and maximum longitudes
respectively on the map. The character "X" in the file represents the
water that means if a cell contains "X" then the traveler is not allowed
to occupy that cell as this car is not drivable on water. The character
"0" in the file represents the road connected island. That means if a
cell contains "0" then the traveler is allowed to occupy that cell as
this car can drive on roads. The traveler starts at the island
located at latitude = 0 and longitude = 0 (i.e., (0,0)) in the upper
left corner, and the goal is to drive to the island located at
(MaxLattitude-1, MaxLongitudes-1) in the lower right corner. A legal
move from an island is to move left, right, up, or down to an
immediately adjacent cell that has road connectivity which means a cell
that contains "0". Moving off any edge of the map is not allowed.Print paths as explicitly specified for all the functions in Part A, Part B, and extra credit on the console. Input: The map filesOutput: Print paths as explicitly specified for all the functions in Part A, Part B, and extra credit on the console. Part AConsider the following class map,class map{public:map(ifstream &fin);void print(int,int,int,int);bool isLegal(int i, int j);void setMap(int i, int j, int n);int getMap(int i, int j) const;int getReverseMapI(int n) const;int getReverseMapJ(int n) const;void mapToGraph(graph &g);bool findPathRecursive(graph &g, stack<int> &moves);bool findPathNonRecursive1(graph &g, stack<int> &moves);bool findPathNonRecursive2(graph &g, queue<int> &moves);bool findShortestPath1(graph &g, stack<int> &bestMoves);bool findShortestPath2(graph &, vector<int> &bestMoves);void map::printPath(stack<int> &s);int numRows(){return rows;};int numCols(){return cols;};private:int rows; // number of latitudes/rows in the mapint cols; // number of longitudes/columns in the mapmatrix<bool> value;matrix<int> mapping; // Mapping from latitude and longitude co-ordinates (i,j) values to node index valuesvector<int> reverseMapI; // Mapping from node index values to map latitude i valuevector<int> reverseMapJ; // Mapping from node index values to map longitude j value};1.
Using the above class map, write function void map::mapToGraph(graph
&g){...} to createe a graph g that represents the legal moves in the
map m. Each vertex should represent a cell, and each edge should
represent a legal move between adjacent cells.2. Writee a
recursive function findPathRecursive(graph &g, stack<int>
&moves) that looks for a path from the start island to the
destination island. If a path from the start to the destination exists,
your function should call the map::printPath() function that should
print a sequence of correct moves (Go left, Go right, Go down, Go up,
etc.). If no path from the start to the destination exists, the program
should print, "No path exists". If a solution exists the solver should
also simulate the solution to each map by calling the map::print()
function. Hint: consider recursive-DFS.3. Writee a function
findPathNonRecursive1(graph &g, stack<int> &moves) that
does the same thing as in 2, but by using stack and without using
recursion. If a path from the start to the destination exists, your
function should call the map::printPath() function that should print a
sequence of correct moves (Go left, Go right, Go down, Go up, etc.). If
no path from the start to the destination exists, the program should
print, "No path exists". If a solution exists the solver should also
simulate the solution to each map by calling the map::print() function.
Hint: consider stack-based DFS.4. Writee a function
findPathNonRecursive2(graph &g, queue<int> &moves) that
does the same thing as in 2, but by using queue and without using
recursion. If a path from the start to the destination exists, your
function should call the map::printPath() function that should print a
sequence of correct moves (Go left, Go right, Go down, Go up, etc.). If
no path from the start to the destination exists, the program should
print, "No path exists". If a solution exists the solver should also
simulate the solution to each map by calling the map::print() function.
Hint: consider queue-based BFS.Part BThe shortest path on a
map is a path from the start to the destination with the smallest
number of intermediate islands, that is the path with the least number
of intermediate "0".1. Write two functions
findShortestPath1(graph &g, stack<int> &bestMoves) and
findShortestPath2(graph &g, stack<int> &bestMoves) that
each finds the shortest path on a map if a path from the start to the
destination exists. The first algorithm should use Dijkstra algorithm
and the second algorithm should use Bellman-Ford algorithm to find the
shortest paths. In each case, if a solution exists the solver should
call the map::printPath() function that should print a sequence of
correct moves (Go left, Go right, Go down, Go up, etc.). If no path from
the start to the destination exists, the program should print, "No path
exists". If a solution exists the solver should also simulate the
solution to each map by calling the map::print() function. Each function
should return true if any paths are found, and false otherwise..pdf file | C++-
Unit 2-3 Risk Analysis of the Network Discussion Board
Primary Task Response: Within the Discussion Board area, write 600–800 words that respond to the following questions wit ...
Unit 2-3 Risk Analysis of the Network Discussion Board
Primary Task Response: Within the Discussion Board area, write 600–800 words that respond to the following questions with your thoughts, ideas, and comments. Please see attached for instructions to complete the discussion board posts.
11 pages
Ethical Hacking
Hacking is defined as an intrusion into a protected and secure framework. Hacking has increased across the years, leading ...
Ethical Hacking
Hacking is defined as an intrusion into a protected and secure framework. Hacking has increased across the years, leading to an increasing number of ...
Similar Content
Lab: Life Cycle of a Digital Medium Project
Hello writer, this lab is simple and you can make pat one shorter than the samples I will upload three files to you:1-Lab ...
Iphone Emulator
Find a mobile phone emulatorReview appearance of the Marymount web site in the emulatorWhat can you do? What tests does it...
Virginia International University User Experience Design Worksheet
ASST# 2 – User Task & User Flow Diagramming
ASSIGNMENT TYPE
This is an individual project.
In this project, you will br...
Webmonkey (SLP 3), assignment help
For Module 3, you are to continue to work with the tutorial at Webmonkey.com. Please read through Lesson 3 [2] and ...
Ethical Issues in Information Systems
s, please view the "Submit a Clickable Rubric Assignment" in the Student Center.
Instructors, training on how to grade is...
Can you do my assignment because I have assignment due in 2 days
Can you do my assignment because I have assignment due in 2 days I have only cash but I will pay you ASAP in couple days ...
Workplace Security Program In It
Information technology and cloud computing are reshaping our places of work Working in the field of IT is a tremendous exp...
Schema
STU_NUM -> STU_LNAME, STU_MAJOR, STU_GPA, STU_HOURS, STU_CLASS Partial dependency exist because non key attributes are not...
Wireshack
The sample file that is used in this analysis is called Cisco Wireless LAN Context Control Protocol (WLCCP) version 0x0. I...
Related Tags
Book Guides
Fahrenheit 451
by Ray Bradbury
Good Kids Bad City
by Kyle Swenson
Oliver Twist
by Charles Dickens
The Old Man and the Sea
by Ernest Hemmingway
Herzog
by Saul Bellow
To the Lighthouse
by Virginia Woolf
The Woman in the Window
by A. J. Finn
The Splendid and The Vile
by Erik Larson
The Chosen
by Chaim Potok
Get 24/7
Homework help
Our tutors provide high quality explanations & answers.
Post question
Most Popular Content
5 pages
Time Series
Over time, time-series has continued to evolve, and different scholars have continued to utilize its presence in providing ...
Time Series
Over time, time-series has continued to evolve, and different scholars have continued to utilize its presence in providing possible solutions and ...
1.6 - Assignment: Identifying Research Problems and Hypotheses
Use the Hunt Library (Links to an external site.)Links to an external site. EAGLEsearch function to identify another "Scho ...
1.6 - Assignment: Identifying Research Problems and Hypotheses
Use the Hunt Library (Links to an external site.)Links to an external site. EAGLEsearch function to identify another "Scholarly-Peer Reviewed" article in your area of interest. Be sure that this article is a true research article, as outlined previously. This article must be different than the one used in the Module 1.5 discussion. Give a brief summary of the article - a paragraph or two will suffice.Separately, identify the research problem and hypothesis (or hypotheses) in the study. Be sure to quote the research problem and hypothesis in proper APA format.Next, answer the following questions:Did the study shed light on how to better understand or correct the research problem? Why or why not? How did the study answer or address the hypothesis? If so, was the hypothesis correct? Why or why not? Include the appropriate APA formatted reference as it would appear in the reference section of an article.Use standard file type (.doc or .docx). Save your assignment using a naming convention that includes your first and last name and the activity number (or description). Do not add punctuation or special characters.
Java object-oriented GUI programming features, computer science homework help
605.201 Mini-Project 3:
Please do the following to complete this assignment.
Purpose:
The purpose of this project is to ...
Java object-oriented GUI programming features, computer science homework help
605.201 Mini-Project 3:
Please do the following to complete this assignment.
Purpose:
The purpose of this project is to provide non-trivial practice in the use of Java object-oriented GUI
programming features to implement an object-oriented GUI design and have a bit of fun doing it.
Resources Needed:
You will need a computer system with Java 7 or greater SE edition run-time and Java Development Kit
(JDK). You may optionally use a Java IDE for example NetBeans, Eclipse, etc. However application
builders are not allowed.
Submitted Files:
Design and Analysis:
This is an informal essay-style single-spaced word-processed document. The file formats accepted are
.odt, .doc, and .docx. The length of the document should be between 1 and 1.5 pages. The following
subjects should be discussed in this order:
1. General program design. How is the program organized? What major data structures were
used? How did you divide the functionality among your classes? How are commands
processed? Etc.
2. What alternative approaches were considered and why were they rejected?
3. What did you learn from doing this project and what would you do differently?
Source files:
Each public class must be contained in a separate Java source file. Only one source file will have a
main() method and this source will be named SongDatabase.java. Other source/class names are up to
you following the guidelines specified so far in the course.
The format of the Java source must meet the general Java coding style guidelines discussed so far
during the course. Pay special attention to naming guidelines, use of appropriate variable names and
types, variable scope (public, private, protected, etc.), indentation, and comments. Classes and
methods should be commented with JavaDoc-style comments (see below). Please use course office
hours or contact the instructor directly if there are any coding style questions.
JavaDocs:
Sources should be commented using JavaDoc-style comments for classes and methods. Each class
should have a short comment on what it represents and use the @author annotation. Methods should
have a short (usually 1 short sentence) description of what the results are of calling it. Parameters and
returns should be documented with the @param and @return annotations respectively with a short
comment on each.
JavaDocs must be generated against every project Java source file. They should be generated with a
-private option (to document all protection-level classes) and a –d [dir] option to place the resulting
files in a javadocs directory/folder at the same level as your source files. See the JavaDocs
demonstration for more details.
Submit file:
The submit file is to be a Zip file containing your design and analysis document, your Java sources, and
your javadocs directory/folder. Any appropriate file name for this Zip file is acceptable.
If you know how to create a standard Java JAR file, this is also acceptable for your source code.
However, make sure you include the source code in your JAR file.
Collaboration:
It is encouraged to discuss technical or small design parts of this project with your fellow students.
However the resulting design and implementation must be your own. For example, it is acceptable to
discuss different ways of maintaining the system state but not detailed design or implementation
information on processing the purchase command. When in doubt, ask during office hours or contact
your instructor.
Program Specification:
This project involves implementing a Java program that builds and manages a database of songs using
a GUI-based user interface.
The application will consist of a single frame that allows a user to add, edit, or delete songs from the
database. Here’s a rough prototype for what the frame might look like. Yours doesn’t have to look
exactly like this…the prototype is provided just to help you envision the ultimate application.
The application shall work as follows:
1. Upon start-up, the application will read the database file. The path of the database file will be
supplied by a run-time parameter. If the database file does not exist, the user will be told the
database does not exist and prompted (non-GUI text prompt) asking if they want to create a new
one. If the user answers positive, the application will continue with an initially empty song
database. If the user answers negatively, the application will exit. An example of an appropriate
start-up command is as follows:
java SongDB mySongDB.data
2. The original state of the frame shall display the combo box with the first song in the database
selected. The Item Code, Description, Artist, Album, and Price fields for this item shall be
displayed with the fields disabled (non-editable). The Add, Edit, Delete, and Exit buttons shall be
enabled, and the Accept and Cancel buttons shall be disabled.
3. To add a song, the user clicks on the Add button. This will cause the application to clear and enable
the Item Code, Description, Artist, Album, and Price fields so the user can enter information for the
new song. The Edit and Delete buttons are also disabled, and the Accept and Cancel buttons are
enabled. When the user presses the Accept button, the new song will be added to the database and
combo box. If the user presses the Cancel button, the entry transaction is canceled and the frame
reverts to its original state.
4. To edit an existing song, the user shall select the song from the combo box. The information for the
selected song shall then be displayed in the disabled fields. The user then presses the Edit button,
which enables the Description, Artist, and Price fields. The user may not change the Item Code.
Select Song: Yellow Submarine
Item Code: BT012
Description: Yellow Submarine
Artist: The Beatles
Album: Beatles Greatest Hits 1
Price: 1.99
Add Edit Delete Accept Cancel
Exit
The Add, Edit, and Delete buttons are disabled, and the Accept and Cancel buttons are enabled. If
the user presses the Accept button, the changes are saved and the combo box is updated. If the user
presses the Cancel button, the edit transaction is canceled and the frame reverts to its original state.
5. To delete an existing song, the user shall select the song from the combo box. The information for
the song shall then be displayed in the disabled fields. If the user presses the Delete button, the song
is deleted from the database and the combo box.
6. When the user presses the Exit button the application shall terminate. The current state of the
database shall be saved in a file using the pathname supplied at program start-up (see above).
7. Data fields shall be validated to ensure they are not blank with appropriate error messages
displayed. If the song is a single, the text “None” will be used for the album name. The price field
shall be validated to ensure only numeric data is entered.
Other Activates:
1. Create a compressed zipped folder containing your Design and Analysis document, your Java
source code files, and your javadocs folder.
2. Submit your compressed zipped folder as directed by your instructor.
Assignment Rubric:
Part 70% 80% 90% 100% % of
Grade
Design and
Analysis
Document
All but one subject
addressed with
relevant,
information. Few
minor
typographical
issues. Document
is close to assigned
length
All assigned
subjects address
with mostly
relevant
information.
Nicely formatted
document.
Document is
close to assigned
length
All assigned subjects
address with
accurate and
relevant. Nicely
formatted document.
Document is within
assigned length
All assigned
subjects address
with accurate,
relevant, and
insightful
information.
Very nicely
formatted.
Document is
within assigned
length
15%
Functionality Majority of
required function
parts work as
indicted in the
assignment text.
One major or 3
minor defects. All
major functionality
at least partially
working (example
change provided
but not correct).
Most required
function parts
work as indicted
in the
assignment text
above and
submitted
documentation.
One major or 3
minor defects.
All major
functionality at
Nearly all required
function parts work
as indicted in the
assignment text
above and submitted
documentation. One
to two minor
defects.
All required
function parts
work as indicted
in the assignment
text above and
submitted
documentation.
50%
Design document
does not fully
reflect
functionality.
least partially
working
((example
change provided
but not correct).
Code Majority of the
code conforms to
coding standards as
explained and
demonstrated so far
in the course (ex.
method design,
naming,
formatting, etc.).
Five to six minor
coding standard
violations. Some
useful comments.
Some JavaDocs
commenting.
Code compiles
with multiple
warnings or fails to
compile with
difficult to
diagnose error.
Most of the code
conforms to
coding standards
as explained and
demonstrated so
far in the course
(ex. method
design, naming,
formatting, etc.).
Three to four
minor coding
standard
violations.
Mostly useful
comments.
Public class
JavaDocs
complete. Code
compiles with
one to two
warnings.
Almost all code
conforms to coding
standards as
explained and
demonstrated so far
in the course (ex.
method design,
naming, formatting,
etc.). One to two
minor coding
standard violations.
Appropriate level of
useful comments.
Public class
JavaDocs complete.
Code compiles.
Code compiles with
no errors or
warnings.
All code
conforms to
coding standards
as explained and
demonstrated so
far in the course
(ex. method
design, naming,
formatting, etc.).
Appropriate level
of useful
comments.
Complete
JavaDocs as
specified. Code
compiles with no
errors or
warnings.
25%
Submit
package
More than one file
submitted in
incorrect format.
Files not enclosed
in the specified
compressed file.
All but one file
submitted in
correct format.
Files not
enclosed in the
specified
compressed file.
All file submitted in
correct format but
not in the specified
compressed file.
All file submitted
in correct file
formats and
compressed as
specified.
10%
University of Central Florida Algorithms & Data Structures for Road Routes Project
I'm working on a algorithms & data structures project and need a reference to help me learn.The language used for this pro ...
University of Central Florida Algorithms & Data Structures for Road Routes Project
I'm working on a algorithms & data structures project and need a reference to help me learn.The language used for this project is C++Also
I thank anyone attempting this, this is the reality of inexperienced
professors that put us students through so much. Please help me if you
can. Thank you so much, very much appreciated.you
will develop algorithms that find road routes through the bridges to
travel between islands.The input is a text file containing data about
the given map. Each file begins with the number of rows and columns in
the map considered as maximum latitudes and maximum longitudes
respectively on the map. The character "X" in the file represents the
water that means if a cell contains "X" then the traveler is not allowed
to occupy that cell as this car is not drivable on water. The character
"0" in the file represents the road connected island. That means if a
cell contains "0" then the traveler is allowed to occupy that cell as
this car can drive on roads. The traveler starts at the island
located at latitude = 0 and longitude = 0 (i.e., (0,0)) in the upper
left corner, and the goal is to drive to the island located at
(MaxLattitude-1, MaxLongitudes-1) in the lower right corner. A legal
move from an island is to move left, right, up, or down to an
immediately adjacent cell that has road connectivity which means a cell
that contains "0". Moving off any edge of the map is not allowed.Print paths as explicitly specified for all the functions in Part A, Part B, and extra credit on the console. Input: The map filesOutput: Print paths as explicitly specified for all the functions in Part A, Part B, and extra credit on the console. Part AConsider the following class map,class map{public:map(ifstream &fin);void print(int,int,int,int);bool isLegal(int i, int j);void setMap(int i, int j, int n);int getMap(int i, int j) const;int getReverseMapI(int n) const;int getReverseMapJ(int n) const;void mapToGraph(graph &g);bool findPathRecursive(graph &g, stack<int> &moves);bool findPathNonRecursive1(graph &g, stack<int> &moves);bool findPathNonRecursive2(graph &g, queue<int> &moves);bool findShortestPath1(graph &g, stack<int> &bestMoves);bool findShortestPath2(graph &, vector<int> &bestMoves);void map::printPath(stack<int> &s);int numRows(){return rows;};int numCols(){return cols;};private:int rows; // number of latitudes/rows in the mapint cols; // number of longitudes/columns in the mapmatrix<bool> value;matrix<int> mapping; // Mapping from latitude and longitude co-ordinates (i,j) values to node index valuesvector<int> reverseMapI; // Mapping from node index values to map latitude i valuevector<int> reverseMapJ; // Mapping from node index values to map longitude j value};1.
Using the above class map, write function void map::mapToGraph(graph
&g){...} to createe a graph g that represents the legal moves in the
map m. Each vertex should represent a cell, and each edge should
represent a legal move between adjacent cells.2. Writee a
recursive function findPathRecursive(graph &g, stack<int>
&moves) that looks for a path from the start island to the
destination island. If a path from the start to the destination exists,
your function should call the map::printPath() function that should
print a sequence of correct moves (Go left, Go right, Go down, Go up,
etc.). If no path from the start to the destination exists, the program
should print, "No path exists". If a solution exists the solver should
also simulate the solution to each map by calling the map::print()
function. Hint: consider recursive-DFS.3. Writee a function
findPathNonRecursive1(graph &g, stack<int> &moves) that
does the same thing as in 2, but by using stack and without using
recursion. If a path from the start to the destination exists, your
function should call the map::printPath() function that should print a
sequence of correct moves (Go left, Go right, Go down, Go up, etc.). If
no path from the start to the destination exists, the program should
print, "No path exists". If a solution exists the solver should also
simulate the solution to each map by calling the map::print() function.
Hint: consider stack-based DFS.4. Writee a function
findPathNonRecursive2(graph &g, queue<int> &moves) that
does the same thing as in 2, but by using queue and without using
recursion. If a path from the start to the destination exists, your
function should call the map::printPath() function that should print a
sequence of correct moves (Go left, Go right, Go down, Go up, etc.). If
no path from the start to the destination exists, the program should
print, "No path exists". If a solution exists the solver should also
simulate the solution to each map by calling the map::print() function.
Hint: consider queue-based BFS.Part BThe shortest path on a
map is a path from the start to the destination with the smallest
number of intermediate islands, that is the path with the least number
of intermediate "0".1. Write two functions
findShortestPath1(graph &g, stack<int> &bestMoves) and
findShortestPath2(graph &g, stack<int> &bestMoves) that
each finds the shortest path on a map if a path from the start to the
destination exists. The first algorithm should use Dijkstra algorithm
and the second algorithm should use Bellman-Ford algorithm to find the
shortest paths. In each case, if a solution exists the solver should
call the map::printPath() function that should print a sequence of
correct moves (Go left, Go right, Go down, Go up, etc.). If no path from
the start to the destination exists, the program should print, "No path
exists". If a solution exists the solver should also simulate the
solution to each map by calling the map::print() function. Each function
should return true if any paths are found, and false otherwise..pdf file | C++-
Unit 2-3 Risk Analysis of the Network Discussion Board
Primary Task Response: Within the Discussion Board area, write 600–800 words that respond to the following questions wit ...
Unit 2-3 Risk Analysis of the Network Discussion Board
Primary Task Response: Within the Discussion Board area, write 600–800 words that respond to the following questions with your thoughts, ideas, and comments. Please see attached for instructions to complete the discussion board posts.
11 pages
Ethical Hacking
Hacking is defined as an intrusion into a protected and secure framework. Hacking has increased across the years, leading ...
Ethical Hacking
Hacking is defined as an intrusion into a protected and secure framework. Hacking has increased across the years, leading to an increasing number of ...
Earn money selling
your Study Documents