MIT Introduction to Electrical Engineering and Computer Science Flashcards

1
Q

How are variables, data structures, and procedures stored and managed in Python?

A

In a binding environment that associates names with values. Procedures are associations of names to pointers that point to the actual procedure, in addition to pointers to the global environment (providing access to the global namespace.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

Describe how objects are implemented in Python?

A

An object is constructed as a class as a local environment, just like when calling a procedure. An instance of that class is then constructed as a local environment again, with the class environment as a parent.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

What is the standard Python interpreter written in?

A

C

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

What is the core data structure in Python and how is it implemented?

A

A dictionary which is an associative array of key value pairs implemented as a hash table in C in which each entry stores a struct containing hash, key, value information.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

Contrast lists and tuples in Python

A

Lists are mutable and usually homogenous whereas tuples are immutable data structures.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

In control theory, if a system incorporates feedback what type of behavior will it exhibit?

A

Feedback produces cyclic signal flow paths. Even transient input can produce persistent responses.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

Adding/extending delays in a feedback system increases/decreases stability.

A

Delays in a feedback system are destabilizing: think about the wall finder robot trying to gauge its distance from the wall.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

Describe transistors / integrated circuit chip growth since 1970

A

In 1970 there were around 1,000 transistors / chip, now there are easily 5 - 10 billion.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

Kirchoff’s Voltage Law states that

A

the sum of all voltages around any closed path is zero.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

Kirchoff’s Current Law states that

A

the sum of current entering and leaving a node are equal.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

What is an op-amp?

A

Operational amplifier, an electronic component capable of taking an input voltage and amplifying it many times over into a single output.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

What is a transistor?

A

An electronic device capable of acting as a switch or current amplifier. In its capacity as a switch, transistors can store binary values. Modern computer microchips contain billions of transistors acting as such logic gates.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

Op amps in addition to Thevenin and Norton equivalents, are used in electronic circuits

A

as abstractions to simplify engineering problems.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

What is the sample space in probability theory?

A

The maximum set of all atomic events.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

What is Bayes’ Rule?

A

Conditional Probability: a rule that gives the probability that one event A occurs given that a different event B is known to have occurred. Conditioning on B restricts the sample space from the universe to B, leaving the likelihood of A occurring to the original overlap between A and B.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

What data structures are useful for implementing depth and breadth first search algorithms?

A

A stack (LIFO) can be used for a depth-first search and a queue (FIFO) can be used for a breadth-first search.

17
Q

How can a stack be implemented in Python?

A

As a class with method procedures for push, pop, empty, etc.

18
Q

Conducting a search in which access to each node may have a different cost associated with it can be performed how?

A

With a priority queue that encodes the cost as priority in each search path.