Neha Shah

Part A
CS 240
September 12, 2014
Quantum Computing
1) What is Quantum Computing?
a) “Quantum computing relies on quantum physics by taking advantage of certain quantum
physics properties of atoms or nuclei that allow them to work together as quantum bits, or
qubits, to be the computer's processor and memory. By interacting with each other while
being isolated from the external environment, qubits can perform certain calculations
exponentially faster than conventional computers.”1
b) Not so much for everyday tasks (i.e. email) ,mainly used for cryptography, modeling, and
indexing very large databases1
2) Regular computers vs. Quantum computers
a) Regular computers use bits
i) Bits encode in binary form (ones or zeros)
b) Quantum computers use qubits
i) Quibit is a “quantum system that encodes the zero and the one into two
distinguishable quantum states.”2
c) “A quantum computer can do an arbitrary reversible classical computation on all the
numbers simultaneously, which a binary system cannot do, and also has some ability to
produce interference between various different numbers.” 1
3) How are quibits implemented in quantum computing?
a) In order for the binary data to be turned into two different quantum states, the usage of
superposition and entanglement are required.
i) Superposition: “the ability of a quantum system to be in multiple states at the same
time”2
ii) Entanglement: “an extremely strong correlation that exists between quantum
particles…The particles remain perfectly correlated even if separated by great
distances. The particles are so intrinsically connected, they can be said to “dance” in
instantaneous, perfect unison, even when placed at opposite ends of the universe.”2
4) Futuristic usage of quantum computers?
a) Superconductors working at room temperature2
b) Computer running quantum mechanics will be able to search through a large amount of
possible solutions, and will present the best possible solution. 2

1
http://www.webopedia.com/TERM/Q/quantum_computing.html
2
https://uwaterloo.ca/institute-for-quantum-computing/quantum-computing-101#What-is-
quantum-computing
Neha Shah
Part B
CS 240
September 12, 2014
Fuzzy Sets
1) What are fuzzy sets?
a) Introduced by Lotfi A. Zadeh (1965) as an extension of the classical notion of set.3
b) A mathematical set with the property that an object can be a member of the set, not a
member of the set, or any of a continuum of states of being a partial member of the set. 4
c) Determined by their membership functions
d) Answer may only be between 0 to 1
e) Used to make computers smarter, and to think more like humans with logical reasoning.
2) Classical set theory vs. Fuzzy Sets
a) “In classical set theory, the membership of elements in a set is assessed in binary terms
according to a bivalent condition — an element either belongs or does not belong to the
set.”3
b) “…fuzzy set theory permits the gradual assessment of the membership of elements in a
set; this is described with the aid of a membership function valued in the real unit interval
[0, 1].”3
3) Types of Fuzzy Membership Functions
a) Triangular Membership Function: defined by a lower limit a, an upper limit b, and a
value m, where a < m < b.5
b) Trapezoidal Membership Function: defined by a lower limit a, an upper limit d, a lower
support limit b, and an upper support limit c, where a < b < c < d.5
c) Gaussian Membership Function: defined by a central value m and a standard deviation k
> 0.5
4) Types of Fuzzy Set Operations
a) Intersection, Union, and union are defined in their own membership functions
i) Fuzzy Union: represented by OR, the most commonly used method for fuzzy union is
to take the maximum.6
ii) Fuzzy Intersection: represented by AND, most commonly used to find the minimum5
iii) Fuzzy Complement: represented by NOT, same logic as the Boolean logic5
5) Uses for Fuzzy Sets
a) Wide range of domain where information is incorrect or imprecise3
b) Bioinformatics 3
c) Genealogical research3

Neha Shah

3
http://www.princeton.edu/~achaney/tmve/wiki100k/docs/Fuzzy_set.html
4
http://www.merriam-webster.com/dictionary/fuzzy%20set
5
http://www.dma.fi.upm.es/java/fuzzy/fuzzyinf/funpert_en.htm
6
http://www.tech.dmu.ac.uk/~hseker/CSCI3406%20200809/Week%20%203%20%20CSCI
%203006%20Lecture%203and4.ppt
Part C
CS 240
September 12, 2014

1) CISC Architecture7
 Complex Instruction Set Chip
 Relies mainly on hardware
 Includes multi-clock complex instructions
 Memory-to-memory: “LOAD" and "STORE" incorporated in instructions
 Small code sizes, high cycles per second
 Transistors used for storing complex instructions
VS.
7
2) RISC Architecture
 Reduced Instruction Set Chip
 Emphasis on software
 Single-clock, reduced instruction only
 Register to register: “LOAD" and "STORE “are independent instructions
 Low cycles per second, large code sizes
 Spends more transistors on memory registers
VS.
3) MIPS Architecture8
 Microprocessor without Interlocked Pipeline Stages
 A RISC Instruction Set Architecture (ISA)
 Contains 32 registers
 Has a 3 register format
 Fixed 32 bit length

I, ___Neha Shah_________________________ have carefully read and understood the posted

N.S.____________________
Name Initials

7
http://cs.stanford.edu/people/eroberts/courses/soco/projects/risc/risccisc/
8
https://courses.engr.illinois.edu/cs232/fa2011/lectures/L07.pdf