Start Discovering Solved Questions and Your Course Assignments
TextBooks Included
Solved Assignments
Asked Questions
Answered Questions
1 give a linear algorithm to compute the chromatic number of graphs where each vertex has degree at most 2 must such
1 implement an algorithm that takes an input array and returns only the unique elements in it2 you have a computer with
implement an external sort which uses intermediate files to sort files bigger than main memory mergesort is a good
let m be an ntimesm integer matrix in which the entries of each row are sorted in increasing order from left to right
consider the numerical 20 questions game in this game player 1 thinks of a number in the range 1 to n player 2 has to
your job is to arrange n ill-behaved children in a straight line facing front you are given a list of m statements of
design a linear-time algorithm to eliminate each vertex v of degree 2 from a graph by replacing edges u v and vw by an
let v and w be two vertices in a directed graph g ve design a lineartime algorithm to find the number of different
an independent set of an undirected graph g ve is a set of vertices u such that no edge in e is incident on two
a vertex cover of a graph g ve is a subset of vertices v isin v such that every edge in e contains at least one vertex
suppose we are given the minimum spanning tree t of a given graph g with n vertices and m edges and a new edge e u v
1 does either prims and kruskals algorithm work if there are negative edge weights explain why or why not2 modify prims
typists often make transposition errors exchanging neighboring characters such as typing setve when you mean steve this
suppose you are given three strings of characters x y and z where x n y m and z n m z is said to be a shuffle of
the longest common subsequence lcs of two sequences t and p is the longest sequence l such that l is a subsequence of
design and implement an algorithm for solving the subgraph isomorphism problem given graphs g and h does there exist a
anagrams are rearrangements of the letters of a word or phrase into a different word or phrase sometimes the results
an edge cover of an undirected graph g ve is a set of edges such that each vertex in the graph is incident to at least
1 design and implement an algorithm for solving the set cover problem discussed in section 1812 write a function to
1 implement an efficient algorithm for listing all k-element subsets of n items2 an anagram is a rearrangement of the
a derangement is a permutation p of 1n such that no item is in its proper position ie pi ne i for all 1 le i le n write
consider the problem of storing n books on shelves in a library the order of the books is fixed by the cataloging
1 given a set of coin denominators find the minimum number of coins to make a certain amount of change2 you are given
prove that the following problem is np-complete problem feedback vertex set input a directed graph g va and positive
which of the standard algorithm design paradigms are most relevant to my problema is there a set of items that can be