Start Discovering Solved Questions and Your Course Assignments
TextBooks Included
Active Tutors
Asked Questions
Answered Questions
Suppose we have a directed acyclic graph G = (V,E) with real-valued edge weights and two distinguished vertices s and t. Describe a dynamic programming approach for finding a longest weighted simple
Design a flowchart for a program that accepts a candy name (for example, "chocolate-covered blueberries"), price per pound, and number of pounds sold in the average month.
Design an efficient backtracking algorithm that inputs an integer N, and outputs all of the ways that a group of ascending positive numbers can be summed to N.
Any skip list L can be transformed into a binary search tree T(L)as follows: The root of T(L) is the leftmost node on the highest non-empty level of L the left and right sub-trees are constructed
Design an EER schema for a database application that you are interested in. Specify all constraints that should hold on the database. Make sure that the schema has at least five entity types
Write level order traversal that does each level of binary tree before moving on to the next level. stating with root add the childeren nodes to list, add the current data to string and then process t
Give an algorithm similar to that in the text for threading a binary tree, but to facilitate preorder traversal.
Write an algorithm or code segment for locating the nth successor of an item in a circular linked list (the nth item that follows the given item in the list).
Pseudo-code for listing all identifiers in a hashtable in lexicographic order, using open hashing, the hash function h(x) = first character of x. What is the running time?
Everyone has seen the Sieve at some point in their education. Fewer have actually tried to use it to find prime numbers. Here's your chance to do so. This is a simple problem that can become fairly co
A program that prints every number from 1 through 10 along with its square and cube.
Write a bubble sort algorithm that is appropriate for a linked list.
Design an algorithm to read an arbitrary number of data records, each containing a name, age, and code. A Code of 1 will indicate female, a code of 2 will indicate male; and a code of 0 will indicate
Implementation in any programming language the Nested - Loop Join algorithm.
Assess the reliability of the data mining algorithms. Decide if they can be trusted and predict the errors they are likely to produce?
Use a WHILE structure to design the pseudocode to prepare a monthly report for a legal clinic. Input consists of a series of records that contain the name of the client, name of the attorney, and hour
Write an algorithm (Programming in C) to compute the volume of water in cubic feet, flowing through a pipe of diameter d in feet, with a velocity of v feet per second
Assume studentNames and studentIDs are two parallel arrays of size N that hold student data. Write a pseudocode algorithm that sorts studentIDs array in ascending ID number order such that the two arr
Explain the distinction between an ambiguity in a proposed algorithm and an ambiguity in the representation of an algorithm.
Your review of each article should end with your discussion and conclusions. For example, you can present a list of issues or questions to initiate discussion (this can be accomplished by proposing an
Suppose we want to solve the single-source longest path problem. Can we modify Dijkstra's algorithm to solve this problem by changing minimum to maximum? If so, then prove your algorithm cor
In this project you will be provided a set of specifications to create an entity-relationship diagram and design accompanying table layout using sound relational modeling concepts and practices. The r
Suppose you need to manually sort a hand of cards. What techniques, other than a bubble sort, would you implement? Describe one or more algorithms at a high level.
Most students consider Decision Support Systems courses to be one of the most difficult in their curriculum. Report why most students consider this to be a difficult course and what you learned from t