Start Discovering Solved Questions and Your Course Assignments
TextBooks Included
Active Tutors
Asked Questions
Answered Questions
question the function fx 4 sin x - ex has a zero on the interval 0 05 find this zero correct to four significant
question using the bisection algorithm locate the smallest positive zero of the polynomial px 2x3 - 3x - 4 correct to
question try to find the root x 13333 of the equation x - 133333 0 to five places of accuracy using the modified
question because of the use of the product fafm in the subroutine bisect overflow or underflow may occur during the
question suppose you are to find that root of the equation tan x - x which is closest to 50 using the secant method and
question binary search the problem of table lookup consists in finding for given x an integer i such that x lies
question carry out a backward error analysis for the calculation of the scalar product s a1b1 a2b2 anbn redo the
question write a fortran subroutine which accepts a number to the base betin with the nin digits contained in the
question explain what the area of graph mining an important area of data mining is and describe some of the basic
question what is the subgraph isomorphism problem and what are some of its important applications including those to
question describe some of the algorithms available for determining whether two graphs are isomorphic and the
question what are some of the capabilities that a software tool for inputting displaying and manipulating graphs should
question explain how graph theory can help uncover networks of criminals or terrorists by studying relevant social and
question describe algorithms for drawing a graph on paper or on a display given the vertices and edges of the graph
question explain what community structure is in a graph representing a network such as a social network a computer
question in modeling very large scale integration vlsi graphs are sometimes embedded in a book with the vertices on the
question describe the role computers played in the proof of the four color theorem how can we be sure that a proof that
question describe and compare several different algorithms for coloring a graph in terms of whether they produce a
question given the list of edges and weights of these edges of a weighted connected simple graph and two vertices in
question find the shortest path a traveling salesperson can take to visit each of the capitals of the 50 states in the
question estimate the probability that a randomly generated simple graph with n vertices is connected for each positive
question given the ordered pairs of vertices associated to the edges of a directed multigraph construct an euler path
question given the vertex pairs associated to the edges of a multigraph determine whether it has an euler circuit and
question given the list of edges of a simple graph determine whether it is connected and find the number of connected
question given an adjacency matrix of a graph and a positive integer n find the number of paths of length n between two