Start Discovering Solved Questions and Your Course Assignments
TextBooks Included
Active Tutors
Asked Questions
Answered Questions
problemone way to construct a maze starts with an ntimesn grid such that each grid cell is bounded by four unit-length
problem1 implement the prim-jarniacutek algorithm assuming that the edge weights are integers2 perform an experimental
problem1 implement a generic bfs traversal using the template method pattern2 implement the topological sorting
problem1 let g be a graph with n vertices and m edges such that all the edge weights in g are integers in the range 1n
problem1 let grarr be a weighted digraph with n vertices design a variation of floyd-warshalls algorithm for computing
problemsuppose you are given a timetable which consists ofbull a set a of n airports and for each airport a in a a
problemnasa wants to link n stations spread over the country using communication channels each pair of stations has a
probleman independent set of an undirected graph g ve is a subset i of v such that no two vertices in i are adjacent
problema company named rtampt has a network of n switching stations connected by m high-speed communication links each
problemthe time delay of a long-distance call can be determined by multiplying a small fixed constant by the number of
problemtamarindo university and many other schools worldwide are doing a joint project on multimedia a computer network
problemsuppose we wish to represent an n-vertex graph g using the edge list structure assuming that we identify the
problem1 describe in pseudo-code an on m-time algorithm for computing all the connected components of an undirected
problemsay that a maze is constructed correctly if there is one path from the start to the finish the entire maze is
problemgiven a complete binary tree t with n nodes consider a directed graph grarr having the nodes of t as its
problem1 draw a simple undirected graph g that has 12 vertices 18 edges and 3 connected components why would it be
problemdraw a simple connected directed graph with 8 vertices and 16 edges such that the in-degree and out-degree of
problem1 show how to modify the pseudo-code for dijkstras algorithm for the case when the graph is directed and we
problem1 implement a compression and decompression scheme that is based on huffman coding2 create a class that
problem1 give an efficient algorithm for determining if a pattern p is a subsequence not substring of a text t what is
problemdesign a greedy algorithm for making change after someone buys some candy costing x cents and the customer gives
problemdefine the edit distance between two strings x and y of length n and m respectively to be the number of edits
problem1 let t be a text string of length n describe an on-time method for finding the longest prefix of t that is a
problem1 give an efficient algorithm for deleting a string from a compressed trie and analyze its running time2
problem1 given a string x of length n and a string y of length m describe an on m-time algorithm for finding the