Start Discovering Solved Questions and Your Course Assignments
TextBooks Included
Solved Assignments
Asked Questions
Answered Questions
write an assembly-language program to multiply two binary numbers using the simple cpu of section 310 how large are the
assume that the simple cpu of section 310 is modified to address an unlimited number of memory locations show that it
write an assembly-language program that repeatedly examines the input register until it is nonzero and then moves its
design a circuit that finds the most significant non-zero position in an n-bit binary number and logically shifts the
give a construction of a circuit for subtracting one n-bit positive binary integer from another using the
the assembly-language instructions of fig 318 operate on integers show that the operations and or and not can be
given a straight-line program for a boolean function describe the steps taken to compute it during fetch-and-execute
describe an fsm that compares two binary numbers supplied as concurrent streams of bits in descending order of
show that strassens matrix multiplication algorithm can be used to multiply square boolean matrices by replacing or by
a circulant is an n times n matrix in which the rth row is the rth cyclic shift of the first row 2 le r le n when n is
consider the design of a bus arbitration sequential circuit for a computer containing four cpus this circuit has four
sketch a data-parallel program that operates on a sorted list of keys and finds the largest number of times that a key
sketch a data-parallel program to find the last record in a linked list where initially each record contains the
the n times n mesh-of-trees network n 2r is formed from a n times n mesh by replacing each linear connection forming a
identify problems that arise in a crossbar network when more than one source wishes to connect to the same destination
show that every algorithm on a linear array to compute the product of an ntimesn matrix and an n-vector requires at
design an algorithm for a linear array of length on that convolves two sequences each of length n in on steps show that
show that if strings over an alphabet a with at least two letters are encoded over a one-letter alphabet a unary
consider the ram of section 841 assume the ram executes t steps describe a turing-machine simulation of this ram that
given a turing machine deterministic or not show that there exists another turing machine with a larger tape alphabet
the class of polynomial-time turing reductions are turing reductions in which the otm runs in time polynomial in the
describe a polynomial-time algorithm to determine whether an instance of circuit sat is a yes instance when the circuit
complete the proof of lemma 8142 by making specific assignments of data to memory locations also provide formulas for
give a definition of a log-space uniform family of prams for which lemma 8141 can be extended to show that the
given an instance of satisfiability namely a set of clauses over a set of literals and values for the variables show