The Full Wiki

Leonard Adleman: Quiz


Question 1: Born in ________, Adleman grew up in San Francisco, and attended the University of California, Berkeley, where he received his BA degree in mathematics in 1968 and his Ph.D. degree in EECS in 1976.
Los AngelesSacramento, CaliforniaCaliforniaSan Jose, California

Question 2: In it, he solved a seven-node instance of the Hamiltonian Graph problem, an ________ problem similar to the traveling salesman problem.
NP (complexity)Computational complexity theoryP versus NP problemNP-complete

Question 3: Adleman is also an amateur boxer and has sparred with ________.
Roy Jones, Jr.Evander HolyfieldJames ToneyBoxing

Question 4: In 1994, his paper Molecular Computation of Solutions To Combinatorial Problems described the experimental use of ________ as a computational system.

Question 5: He is known for being a co-inventor of the RSA (Rivest-Shamir-Adleman) cryptosystem in 1977, and of ________.
DNA nanotechnologyPeptide computingMdm2DNA computing

Question 6: RSA is in widespread use in security applications, including ________.
Internet Relay ChatURI schemeHTTP SecureHypertext Transfer Protocol

Question 7: While the solution to a seven-node instance is trivial, this paper is the first known instance of the successful use of DNA to compute an ________.
Algorithm characterizationsLogicAlan TuringAlgorithm

Question 8: Leonard Max Adleman (born December 31, 1945) is a theoretical computer scientist and professor of computer science and molecular biology at the ________.
University of California, Los AngelesUniversity of Southern CaliforniaStanford UniversityCalifornia Institute of Technology

Got something to say? Make a comment.
Your name
Your email address