Discover
Questions library
Collections library
Find online teacher
login
Discover
questions library
Find online teacher
login
Popular searches:
if-else
class-diagram
flowchart
Polymorphism
Home
Questions
Questions
Study lists
Asmaamasry Questions
705 Questions
(4 * 4 16 tails problem) Listing 28.14, NineTail.java, presents a solution for the nine tails problem
Java programming
2022-07-01
Answers
30
Question
40
Followers
30
0
0
134
(Variation of the nine tails problem) In the nine tails problem, when you flip a coin, the horizontal and vertical neighboring cells are also flipped. Rewrite the program, assuming that all neighboring cells including the diagonal neighbors are also flipped
Java programming
2022-07-01
Answers
30
Question
40
Followers
30
0
0
203
(Revise Listing 28.14, NineTail.java) The program in Listing 28.14 lets the user enter an input for the nine tails problem from the console and displays the result on the console. W
Java programming
2022-07-01
Answers
30
Question
40
Followers
30
0
0
183
(Find a shortest path) Write a program that reads a connected graph from a file. The graph is stored in a file using the same format specified in Programming Exercise 28.1
Java programming
2022-07-01
Answers
30
Question
40
Followers
30
0
0
163
(Get bipartite sets) Add a new method in AbstractGraph with the following header to return two bipartite sets if the graph is bipartite:
Java programming
2022-07-01
Answers
30
Question
40
Followers
30
0
0
170
(Test bipartite) Recall that a graph is bipartite if its vertices can be divided into two disjoint sets such that no edges exist between vertices in the same set. Add a new method in AbstractGraph with the following header to detect whether the graph is bipartite:
Java programming
2022-07-01
Answers
30
Question
40
Followers
30
0
0
198
(Find a cycle) Add a new method in AbstractGraph to find a cycle in the graph with the following header:
Java programming
2022-07-01
Answers
30
Question
40
Followers
30
0
0
197
(Detect cycles) Add a new method in AbstractGraph to determine whether there is a cycle in the graph with the following header:
Java programming
2022-07-01
Answers
30
Question
40
Followers
30
0
0
294
(Find paths) Add a new method in AbstractGraph to find a path between two vertices with the following header:
Java programming
2022-07-01
Answers
30
Question
40
Followers
30
0
0
206
(Find connected components) Create a new class named MyGraph as a subclass of UnweightedGraph that contains a method for finding all connected components in a graph with the following header:
Java programming
2022-07-01
Answers
30
Question
40
Followers
30
0
1
189
Implement DFS using a stack) The depth-first search algorithm described in Listing 28.8 uses recursion. Design a new algorithm without using recursion. Describe it using pseudocode. Implement it by defining a new class named UnweightedGraphWithNonrecursiveDFS that extends UnweightedGraph and over
Java programming
2022-07-01
Answers
30
Question
40
Followers
30
0
0
301
(Create a file for a graph) Modify Listing 28.1, TestGraph.java, to create a file representing graph1
Java programming
2022-07-01
Answers
30
Question
40
Followers
30
0
1
203
(Test whether a graph is connected) Write a program that reads a graph from a file and determines whether the graph is connected
Java programming
2022-07-01
Answers
30
Question
40
Followers
30
0
1
214
Total:
705
Previous
31
32
33
34
35
Next
Go
