Web development and programming
191828 questions • Page 123 / 3837
/* • The following code consists of 5 parts. • Find the errors for each part and
/* • The following code consists of 5 parts. • Find the errors for each part and fix them. • Explain the errors using comments on top of each part. */ #include <stdio.h&g…
/*! \\file: msort_linked.h */ #include #ifndef LIST_H #define LIST_H
/*! ile: msort_linked.h */ #include <iostream> #ifndef LIST_H #define LIST_H struct Node{ int x; Node* next; }; void print_list(Node* list); class List { friend …
/** * (name header) */ import java.util.Scanner; public class InsertInOrder { pu
/** * (name header) */ import java.util.Scanner; public class InsertInOrder { public static void main (String [] args) { Scanner input = new Scanner (System.in); int [] a = new…
/** * * Disjoint Partition of a set providing an union-find data structure where
/** * * Disjoint Partition of a set providing an union-find data structure where * clusters are implemented as linked lists of elements of type T Each cluster * is represented by …
/** * * The program has a two dimensional array of numbers. What I need * is to
/** * * The program has a two dimensional array of numbers. What I need * is to "search" the array and find all elements that are MAX. * This is to be accomplished with at least 2…
/** * ===================================== * HELP TO COMPLETE THIS CODE Please
/** * ===================================== * HELP TO COMPLETE THIS CODE Please complete the remaining operations: 1. set an element to a given index (reset as necessary) 2. reset…
/** * ===================================== *I need help to complete this code.
/** * ===================================== *I need help to complete this code. ANY HELP. Please complete the remaining operations: 1. set an element to a given index (reset as ne…
/** * @(#)TestArray.java * * * @author * @version 1.00 2016/12/11 */ import java
/** * @(#)TestArray.java * * * @author * @version 1.00 2016/12/11 */ import java.util.*; class IntArray{ int [][]A; int rows; int colms; int min; int max; //**********************…
/** * @(#)TestArray.java * * * @author * @version 1.00 2016/12/11 */ import java
/** * @(#)TestArray.java * * * @author * @version 1.00 2016/12/11 */ import java.util.*; class IntArray{ int [][]A; int rows; int colms; int min; int max; //**********************…
/** * @Rundong Huang huang784@purdue.edu *@description: Program to calculate the
/** * @Rundong Huang huang784@purdue.edu *@description: Program to calculate the square of a given number */import java.util.scanner; public class SquareCalculator {public int squ…
/** * @param args the command linearguments */ public static void main(String[]
/** * @param args the command linearguments */ public static void main(String[] args) { int a = 4, b = 5; System.out.println("max= "+ min(a, …
/** * @param args the command linearguments */ public static void main(String[]
/** * @param args the command linearguments */ public static void main(String[] args) { System.out.println("max = "+ min(new Product(1, "de"), newPro…
/** * A Money object models money as dollars and cents **/ public class Money{ /
/** * A Money object models money as dollars and cents **/ public class Money{ /* instance attributes */ private int dollars = -1; private byte cents = -1; // Once created we must…
/** * A class that implements the ADT list by using a chain of linked nodes that
/** * A class that implements the ADT list by using a chain of linked nodes that * has a head reference. * * @author */ public class LListWithTail<T extends Comparable<? sup…
/** * A class that implements the ADT queue by using an expandable circular arra
/** * A class that implements the ADT queue by using an expandable circular array * with one unused location. * */ public class ArrayQueue<T> implements QueueInterface<T&…
/** * A stack provides last-in-first-out behavior. All access * operations on a
/** * A stack provides last-in-first-out behavior. All access * operations on a stack are done at its<code>top</code>. */ public interface Stack<E> { /** * De…
/** * An app for a mobile device * * Modifications: * CT: Added validation to se
/** * An app for a mobile device * * Modifications: * CT: Added validation to setPrice * * * @author * @version 2018.04.30 * public class App { private String name; private String…
/** * BSTCounter implements the DataCounter interface using a binary search tree
/** * BSTCounter implements the DataCounter interface using a binary search tree to * store the data items and counts. * * @param <E> The type of the data elements. Note tha…
/** * BSTCounter implements the DataCounter interface using a binary search tree
/** * BSTCounter implements the DataCounter interface using a binary search tree to * store the data items and counts. * * @param <E> The type of the data elements. Note tha…
/** * BSTCounter implements the DataCounter interface using a binary search tree
/** * BSTCounter implements the DataCounter interface using a binary search tree to * store the data items and counts. * * @param <E> The type of the data elements. Note tha…
/** * BinarySearch.cpp - Implementation and test driver for the binary search *
/** * BinarySearch.cpp - Implementation and test driver for the binary search * algorithm. * * TODO: Include your name and course number here. */ #include <iostream> #inclu…
/** * Calculates and returns the sum of the products of all the corresponding *
/** * Calculates and returns the sum of the products of all the corresponding * pairs of values in the weights and inputs arrays. * * Example: If the weights array contains the va…
/** * Calculates: e ^ (-(value ^ 2) / (2 * variance)), which is a mean-centered
/** * Calculates: e ^ (-(value ^ 2) / (2 * variance)), which is a mean-centered * Gaussian function. * * @param value The value to which the Gaussian function is applied. * @param…
/** * Chapter 7 * Programming Challenge 2: Payroll Class * The Payroll class sto
/** * Chapter 7 * Programming Challenge 2: Payroll Class * The Payroll class stores information * about employee's payroll data using * parallel arrays. */ public class Payroll { …
/** * Class that represents a sound. This class is used by the students * to ext
/** * Class that represents a sound. This class is used by the students * to extend the capabilities of SimpleSound. * * Copyright Georgia Institute of Technology 2004 * @author B…
/** * Combiner whose combine method, given an Integer n and a strin
/** * Combiner whose <code>combine</code> method, given an Integer n and a string, * returns n if the string is a blank line or a line containing * a single curly brac…
/** * Compares this object with the specified StateData object. Returns * a nega
/** * Compares this object with the specified StateData object. Returns * a negative integer if this object's population per electoral vote * is less than the specified object's p…
/** * Construct the disjoint sets object. * numElements is the initial number of
/** * Construct the disjoint sets object. * numElements is the initial number of disjoint sets. */ DisjSets::DisjSets( unsigned numElements ) : s( numElements, -1 ) { } /** * Unio…
/** * Contains a method void display() that all the main
/** * Contains a method <code>void display()</code> that all the <code>main</code> methods * call to display the information. Fill the box with your person…
/** * Counts the number of times that one string occurs as a substring in * anot
/** * Counts the number of times that one string occurs as a substring in * another, optionally allowing the occurrences to overlap. For * example: * <ul> * <li><co…
/** * Create a main function that: * 1) Reads a character from stdin and outputs
/** * Create a main function that: * 1) Reads a character from stdin and outputs that character, however: * 2) Each line should be prefixed with its line number, starting at 1. Ea…
/** * Created by Joon S. Lee on 8/23/15. * * The Monty Hall Problem * Here\'s a
/** * Created by Joon S. Lee on 8/23/15. * * The Monty Hall Problem * Here's a fun and perhaps surprising statistical riddle. * In a gameshow, contestants try to guess which of 3 …
/** * Determines the depth of the node with the specified key, * returning -1 if
/** * Determines the depth of the node with the specified key, * returning -1 if there is no such node. */ public int depth(int key) { return -1; } this iterative method should ta…
/** * Determines the number of iterations of Newton\'s method * required to appr
/** * Determines the number of iterations of Newton's method * required to approximate the square root of x within * the given bound. Newton's method starts out by * setting the i…
/** * Fix your code so that it uses this circular chain of linked nodes with a r
/** * Fix your code so that it uses this circular chain of linked nodes with a reference to the last node so * that it correctly implements ListInterface. * A class that implement…
/** * Get a decibel level (as a double) from the command line and using the belo
/** * Get a decibel level (as a double) from the command line and using the below * list of dB levels print a description of what that dB represents, i.e. * dB < 10 is "Thresho…
/** * Get an integer from the command line (use atoi(3) to convert the parameter
/** * Get an integer from the command line (use atoi(3) to convert the parameter * to a int) or print a usage message ("Usage: h3 number") if none is provided. * If the number is …
/** * Given a 2D array of characters, return true if any row, column or diagonal
/** * Given a 2D array of characters, return true if any row, column or diagonal of * the table has only lower-case letters. You can assume the bingo table is a * square.…
/** * HELP TO COMPLETE THIS CODE===================================== * Please c
/** * HELP TO COMPLETE THIS CODE===================================== * Please complete the remaining operations: 1. set an element to a given index (reset as necessary) 2. reset …
/** * HELP TO COMPLETE THIS CODE===================================== * Please c
/** * HELP TO COMPLETE THIS CODE===================================== * Please complete the remaining operations: 1. set an element to a given index (reset as necessary) 2. reset …
/** * HW2 Version 1.0 * * The LinkedListST class maintains an (unordered) symbol
/** * HW2 Version 1.0 * * The LinkedListST class maintains an (unordered) symbol table of * generic key-value pairs. It supports put, get, and delete methods. * * Note you will …
/** * In this method, you will place a (very limited) Chipotle order based on th
/** * In this method, you will place a (very limited) Chipotle order based on the * input. The return String should be "Bowl with ____ rice and ____ fajita * veggies and _____ sal…
/** * Lab 5: Recursion Lab Assignment * * (1) Find the comment below in the gcd
/** * Lab 5: Recursion Lab Assignment * * (1) Find the comment below in the gcd method. Implement gcd recursively as * specified. * * (2) Create a JUnit test class. In that test c…
/** * Make a class called Student which has: * * INSTANCE VARIABLES: * name, a S
/** * Make a class called Student which has: * * INSTANCE VARIABLES: * name, a String * gpa, a double * * A CONSTRUCTOR with parameters String, double corresponding to the name an…
/** * Merges two strings together, using alternating characters from each, * exc
/** * Merges two strings together, using alternating characters from each, * except that runs of the same character are kept together. For example, * <ul> * <li><co…
/** * Note: In this problem set level you will use inner classes by defining cus
/** * Note: In this problem set level you will use inner classes by defining custom classes * inside the ProblemSet_jng45_0020 class. This is only done so you can submit multip…
/** * PROBLEM 1: Translate the following summing function from iterative to * re
/** * PROBLEM 1: Translate the following summing function from iterative to * recursive. * * You should write a helper method. You may not use any "fields" to solve * this problem…
/** * Print an ASCII table: * 1) Print three columns of numbers followed by the
/** * Print an ASCII table: * 1) Print three columns of numbers followed by the ASCII character for that * number. The first column is in the range 32 to 63 in steps of 1. The …
/** * Question 3: * * Complete the \"isEmpty()\" method below. * This method wil
/** * Question 3: * * Complete the "isEmpty()" method below. * This method will return true if the list is empty, otherwise it * will return false. * * In other words, this method…
/** * Question: * * Finish the implementation of the indexOf() method. * This me
/** * Question: * * Finish the implementation of the indexOf() method. * This method will return the first index of a certain value within the list, * or -1 if the value is not in…
Subject
Web development and programming
Use Browse or pick another subject.