Start Discovering Solved Questions and Your Course Assignments
TextBooks Included
Active Tutors
Asked Questions
Answered Questions
problem1 draw the tree and the resulting subdivision of the plane if we build a 2d tree for our sample points starting
problemdiscuss the idea of avoiding the search of empty grid squares by using linked lists each grid square could be
problem1 write a non-recursive version of the id range program given in the text2 write a program to print out all
problem1 empirically compare the graham scan and the package-wrapping method for large point sets with both x and y
problem1 does the graham scan find the convex hull of the points that make up the vertices of any simple polygon
problem1 is it strictly necessary for the graham scan to start with a point guaranteed to be on the hull explain why or
problem1 suppose you know in advance that the convex hull of a set of points is a triangle give an easy algorithm for
problem1 what is the maximum value achievable by count when inside is executed on a polygon with n vertices give an
problem1 suppose that we use an arbitrary point for the anchor in the method described in the text for computing a
problem1 true or false public-key cryptography makes it convenient to send the same message to several different users
problemsuppose that a vigenere cipher with a two-character key is used to encrypt a relatively long message write a
problem1 decrypt the following message which was encrypted with a vigenere cipher using the pattern cab repeated as
problem1 suppose that the frequencies of the occurrence of all the characters to be en-coded are different is the
problem1 the letter q given in the text can be processed as a sequence of five-bit characters discuss the pros and cons
problem1 implement compression and expansion procedures for the run-length encoding method for a fixed alphabet
problemwrite a compiler for simple arithmetic expressions described by the grammar in the text it should produce a list
problem1 give a context-free grammar to describe all strings with no more than two consecutive is2 how many procedure
problem1 how does the recursive-descent parser find an error in a regular expression such as abbc which is incomplete2
problem1 explain how you would modify the nondeterministic machine to handle dont-care characters2 how many different
problem1 give a regular expression for recognizing all occurrences of four or fewer consecutive ls in a binary string2
problemwrite programs to generate a random 1000-bit text string then find all occurrences of the last k bits elsewhere
problem1 construct an example for which the right-to-left pattern scan with only the mismatch heuristic performs badly2
problem1 draw a finite-state machine that can search for the pattern abracadabra2 how would you search a text file for
problem1 implement a brute-force pattern-matching algorithm that scans the pattern from right to left2 give the next
problem1 outline a method for deleting an item from an extendible hashing table2 why are top-down b-trees better than