0
/ 10
A complete graph is one which each pair of vertices:
Search Results
Searching for: Java
Individual Exercises
0
/ 10
A DAG is:
0
/ 10
The sequence of vertices v1...vn with edges connecting all the vertices is called:
0
/ 10
Trees and lists are special cases of graphs.
0
/ 10
Based on the adjacency matrix shown below, which of the following statements is true:
0
/ 10
The adjacency matrix shown below is an accurate representation of the graph shown below.
0
/ 10
On a breadth first search traversal of the graph shown below, and starting at node a, the first three nodes visited are:
0
/ 10
On a depth first search traversal of the graph shown below, and starting at node a, the first three nodes visited are:
0
/ 50
Below is a class that represents the numbers picked on a lottery ticket.
public class LotteryTicket { private int[] numbers; // your...
0
/ 50
This is a test
0
/ 40
Complete the following binary search method. Find the number search in the array numbers. Return -1 if the number is not found. You may...
0
/ 10
Recursive procedure that returns the number of H in a string of heads (H) or tails (T) outcomes. This must be a recursive routine. You...
0
/ 50
The method skeleton below takes in an integer variable top.
Using a while loop, write a method that will return the sum of all numbers...
0
/ 50
The method skeleton below takes in an integer variable top.
Using a for loop, write a method that will return the sum of all numbers from...
0
/ 40
Complete the following linear search method. Find the number search in the array numbers. If the number is found, return the index for...
0
/ 40
Complete the following contains method so it returns true if the value being searched is found in the array, or false otherwise. You must...
0
/ 40
Complete the following linear search method. Find the number search in the array numbers. If the number is found, return the index for...
0
/ 40
Complete the following linear search method. Find the string search in the array words. If the string is found, return the index for the...
0
/ 10
At the heart of test-driven development is writing ___.
0
/ 10
Consider a linear search as shown below.
int linearSearch(int w, int[] num) { // linear search code here } Assume you call this method...
0
/ 10
Binary search is a more efficient search than linear search. Which one of these is true?
0
/ 10
What is wrong with this code?
String x; if (x.length() > 0) System.out.println("Hello "+x); 0
/ 10
What does this code do?
int nums[] = {}; System.out.println(nums.length); 0
/ 10
Write a method replaceSpaceUnderscore that replaces all spaces with _ (underscores) in the String sentence.
0
/ 10
Complete the method countTimesContains that returns the number of times the array words contains the word stored in searchW. Remember to...