Back to marketplace

Midterm 2

No description yet. This curated deck is ready for daily study.

Total cards: 24•Content version: v4•Public deck•Updated: 8/1/2026

Card preview (24)

#1
Front (Question)

who found that you could redefine what is meant by computation manipulating DNA to solve mathematical problems? What was his main finding in the paper?

Back (Answer)

Leonard M. Adleman A UTM can be built with DNA molecules

#2
Front (Question)

What is the hamiltonian path problem?

Back (Answer)

Given a network of nodes and directed connections between them, is there a path through the network that begins with the start node and concludes with the end node visiting each node only once. Binary (yes or no)

#3
Front (Question)

Generation and test method for hamiltonian problem with computer

Back (Answer)

Step 1: Generate random paths on the network. Step 2: Keep only those paths that begin with the start city and conclude with the end city. Step 3: If there are N cities, keep only those paths of length N. Step 4: Keep only those that enter all cities at least once. Step 5. Any remaining paths are solutions (I.e., Hamiltonian paths).

#4
Front (Question)

what is the issue with the generation and test method for a computer?

Back (Answer)

leads to combinatorial explosion. brute-force serial search takes a very long, virtually forever (unintelligent computation)

#5
Front (Question)

What is the key to solving the hamiltonian problem using DNA

Back (Answer)

performing the 5 steps in generation and test method in parallel search instead of serial

#6
Front (Question)

Who discovered the double helix and launched molecular biology?

Back (Answer)

Watson & Crick

#7
Front (Question)

anealing

Back (Answer)

complementary single-stranded DNA or RNA sequences spontaneously bind together by hydrogen bonds to form a double-stranded molecule

#8
Front (Question)

polymerases

Back (Answer)

copy information from one molecule into another

#9
Front (Question)

ligases

Back (Answer)

bind molecules together used to repair breaks in DNA

#10
Front (Question)

DNA synthesis experiment

Back (Answer)

the “bio” nanomachines -slides along -reads each base -writes its complement onto new strand

#11
Front (Question)

How did they encode the problem into DNA?

Back (Answer)

• In a test tube, mix the prepared DNA pieces together (which will randomly link with each other, forming all different paths). • Perform PCR with ‘start’ and ‘end’ DNA pieces as primers (which creates millions’ copies of DNA strands with the right start and end). • Perform gel electrophoresis to identify only those pieces of right length (e.g., N=4). • Use DNA ‘probe’ molecules to check whether their paths pass through all intermediate cities. • All DNA pieces that are left in the tube should be precisely those representing Hamiltonian paths. • If the tube contains any DNA at all, then conclude that a Hamiltonian path exists, and otherwise not. When it does, the DNA sequence represents the specific path of the solution.

#12
Front (Question)

Why does DNA work to solve the problem

Back (Answer)

its enormous parallelism

#13
Front (Question)

How many possible paths in the travelling salesman problem?

Back (Answer)

over 4 million

#14
Front (Question)

Working memory

Back (Answer)

Limited time capacity: contents of current awareness; storage mechanism that keeps a limited amount of information active fro a brief time such as a few seconds to minutes acoustic 18 seconds duration 7+-/2 items capacity

#15
Front (Question)

Brown-peterson distractor task

Back (Answer)

Retention memory curve participants count backwards by 3s during retention interval memory span drops steeply because of retroactive interference

#16
Front (Question)

Modal model of memory (atkinson & shiffrin)

Back (Answer)

classical information-processing view info -> sensory memory -> STM (maintenance via rehearsal which goes to LTM, or lost) -> LTM and retrieval back to STM • modern model replaces STM with WM

#17
Front (Question)

Is there a ‘place’ in the brain for WM

Back (Answer)

No WM is just referring to a concept or label for some sort of mental activities going on all over the brain, rather than a buffer place or loading dock

#18
Front (Question)

WM vs LTM

Back (Answer)

WM: temporary, fragile duration, limited capacity and size, relatively easy ease of entry, relatively easy ease of retrieval LTM: long-lasting, enduring duration, virtually unlimited capacity and size, effortful ease of entry (rehearsal), ease of retrieval difficult and slow and can be unsuccessful

#19
Front (Question)

Waugh & Norman probe task

Back (Answer)

report digit after probe

#20
Front (Question)

serial position curve

Back (Answer)

Primacy effect - LTM Recency effect - STM

#21
Front (Question)

List length effects

Back (Answer)

better recognition for shorter-list items

#22
Front (Question)

Computational modeling of serial position curves

Back (Answer)

SIMPLE model - Bayesian model CMR model - connectionist model Both model the same pattern

#23
Front (Question)

Evidence for separate stores of WM and LTM

Back (Answer)

error patterns ion memory tasks double dissociations after brain lesions

#24
Front (Question)

H.M. Memory pattern

Back (Answer)

remembers old explicit memories formed before surgery but cannot form new explicit memories (severe anterograde)