Similar Books

    No books found

Title
Chapter: 27 / Q: 10
(Compare MyHashSet and MyArrayList) MyArrayList is defined in Listing 24.3. Write a program that generates 1000000 random double values between 0 and 999999 and stores them in a MyArrayList and in a MyHashSet
Chapter: 27 / Q: 11
(setToList) Write the following method that returns an ArrayList from a set
Chapter: 28 / Q: 1
(Test whether a graph is connected) Write a program that reads a graph from a file and determines whether the graph is connected
Chapter: 28 / Q: 2
(Create a file for a graph) Modify Listing 28.1, TestGraph.java, to create a file representing graph1
Chapter: 28 / Q: 3
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
Chapter: 28 / Q: 4
(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:
Chapter: 28 / Q: 5
(Find paths) Add a new method in AbstractGraph to find a path between two vertices with the following header:
Chapter: 28 / Q: 6
(Detect cycles) Add a new method in AbstractGraph to determine whether there is a cycle in the graph with the following header:
Chapter: 28 / Q: 7
(Find a cycle) Add a new method in AbstractGraph to find a cycle in the graph with the following header:
Chapter: 28 / Q: 8
(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:
total questions: 772

Questions

772

Views

A PHP Error was encountered

Severity: Warning

Message: Undefined property: stdClass::$TotalViews

Filename: books/book.php

Line Number: 411

Best Answers

299

Points

5