Start Discovering Solved Questions and Your Course Assignments
TextBooks Included
Active Tutors
Asked Questions
Answered Questions
in grade school you learned to multiply long numbers on a digit-by-digit basis so that 127 times 211 127 times 1 127
we have 1000 data items to store on 1000 nodes each node can store copies of exactly three different items propose a
you are given 10 bags of gold coins nine bags contain coins that each weigh 10 grams one bag contains all false coins
a common problem for compilers and text editors is determining whether the parentheses in a string are balanced and
1 write a program to reverse the direction of a given singly-linked list in other words after the reversal all pointers
suppose you are given an input set s of n numbers and a black box that if given any sequence of real numbers and an
1 the mode of a set of numbers is the number that occurs most frequently in the set the set 4 6 2 4 3 1 has a mode of 4
you have an unordered array x of n integers find the array m containing n elements where mi is the product of all
the grinch is given the job of partitioning 2n players into two teams of n players each each player has a numerical
1 determine whether a linked list contains a loop as quickly as possible without using any extra storage also identify
1 write a function to find the middle node of a singly-linked list2 write a program to convert a binary search tree
1 imagine you have a closet full of shirts what can you do to organize your shirts for easy retrieval2 write a function
given a set of s containing n real numbers and a real number x we seek an algorithm to determine whether two elements
present correct and efficient algorithms to convert an undirected graph g between the following graph data structures
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