Q&A

What are those things that look like concatenated hourglasses in the (TTL) circuit of Question 3?

https://www.docdroid.net/1L1FeI3/question3.pdf

I'm trying to fully understand how to solve that problem, but I don't even know what to search for, hence this question.

Any input would be GREATLY appreciated!

Hello to everyone who's reading this. :)

I have a sort of pedantic question.

Let's say I wanted to construct the truth table for p ^ ¬q.

Is it correct to give the following?:

_____________

p | q | ¬q | p ^ ¬q |

0 | 0 | 1 | 0 |

0 | 1 | 0 | 0 |

1 | 0 | 1 | 1 |

1 | 1 | 0 | 0 |

---------------------

Or, would I have to give the following?:

___________

p | q | p ^ ¬q |

0 | 0 | 0 |

0 | 1 | 0 |

1 | 0 | 1 |

1 | 1 | 0 |

-----------------

(This isn't really about what a teacher would accept on a test, but rather about whether both are strictly correct or if only the bottom one is correct.)

Any input would be greatly appreciated!

In addition to other things, I read this ( https://www.tomdalling.com/blog/modern-opengl/expl... ), and while I understand the algebra of dividing by a number approaching zero from the positive, I don't get how having the camera approach what it's projecting to the point that it's right at what it's projecting makes the lines intersect at infinity.

Could someone please clarify this or elaborate on it?

Question #4:

https://www.docdroid.net/qCr3OeQ/e2.pdf

Question #4's Solution:

https://www.docdroid.net/qCr3OeQ/e2.pdf#page=3

The solution seems to try to get the reader to think about the significance of the computations sought, but it doesn't seem to specify what that significance is, and I'd like to know, so could someone please explain that?

Any input would be GREATLY appreciated!

Question #3:

https://www.docdroid.net/qCr3OeQ/e2.pdf

Question #3's Solution:

https://www.docdroid.net/qCr3OeQ/e2.pdf#page=3

Is the only important (generally-applicable) part of the proof the "u ⋅ v = (Ru) ⋅ (Rv) = u^T R^T Rv = ||u|| ||v|| cos γ" part? That is, is the "Consider a rotation matrix R that rotates u to (||u||, 0, 0) and that rotates v to ||v||(cos γ, sin γ, 0)." a specific example (that is not a general statement) (used for attempting to help the reader better understand the presented situation)? If I'm wrong, could someone please elaborate? Also, how does that prove the equivalence between the sum of u_i v_i for i = 1,2,3, ... and ||u|| ||v|| cos γ?

Any input would be GREATLY appreciated!

P.S.

Lecture 2's slides (should you deem them useful):

https://www.docdroid.net/vaNUUUF/2-slides-9pp.pdf#...

Hello to everyone who's reading this. :)

I'm very new to learning OpenGL, and I'm watching a YouTube video, and the guy from the video gives code to render a triangle ( http://dpaste.com/2H84QMM ), but I'd like to modify it so that a rectangle is rendered, instead (for learning purposes).

So, could someone please modify the code and post the modified code in another dpaste link (for example). If you're not too lazy, I'd also appreciate it if you could mention which lines of the code were changed, but it's not necessary.

MY CONFUSION:

There's this problem in my Computer Graphics book (whose problem statement and solution can be found below), and I believe to now understand the book's solution for it, except for why the answer [n × n × (m – 1) + 1] is an approximation, rather than an exact answer.

PROBLEM STATEMENT:

Show that with an n × n pixel grid, where each pixel can take on m intensity levels, we can approximate n × n × (m – 1) + 1 overall intensity levels.

SOLUTION OF PROBLEM:

Since the n ×n pixels can be set to a non-zero intensity value one after another to produce n ×n overall intensity levels, and there are m MINUS 1 non-zero intensity levels for the individual pixels, we can approximate a total of n × n × (m – 1) non-zero overall intensity levels. Finally, we need to add one more overall intensity level that corresponds to zero intensity (all pixels off).

Any input would be GREATLY appreciated!

I'm confused for questions Q1(ii) and Q2 of the following.:

https://www.docdroid.net/rrCOG5R/myquestions.pdf

Here are my answers.:

https://www.docdroid.net/szmpb40/myanswers.pdf

I'm not sure if I understand what question Q1(ii) is asking. What's confusing me is the word "maximum." I get that the maximum possible amount of collisions for n inserted values is n - 1, but that hash function's effect, specifically for inserting the values mentioned, was computed out by me, and I found there to be six collisions. So, is the answer six, like I typed in my answers, or is it n - 1, or am I completely missing what's being asked?

I'm similarly confused about Q2. Is my answer (correctly) answering what the question is asking?

Assuming that I'm not correctly answering one or both of the questions, what's wrong with my answer(s)?

Any input would be GREATLY appreciated!

I'm confused for questions Q1(ii) and Q2 of the following.:

https://www.docdroid.net/rrCOG5R/myquestions.pdf

Here are my answers.:

https://www.docdroid.net/szmpb40/myanswers.pdf#pag...

I'm not sure if I understand what question Q1(ii) is asking. What's confusing me is the word "maximum." I get that the maximum possible amount of collisions for n inserted values is n - 1, but that hash function's effect, specifically for inserting the values mentioned, was computed out by me, and I found there to be six collisions. So, is the answer six, like I typed in my answers, or is it n - 1, or am I completely missing what's being asked?

I'm similarly confused about Q2. Is my answer (correctly) answering what the question is asking?

Any input would be GREATLY appreciated!

Here is (both parts a and b of) the question.:

http://dpaste.com/3XSTG8K

Here is my work so far.:

https://www.docdroid.net/uAVvJpV/myworksofar.pdf

Both parts a and b seem, to me, to be asking me to do the exact same thing / use "bottom-up" construction. (Am I correct about that (terminology)? Is the one and only construction used for min-heaps "bottom-up" construction, and the one and only construction used for max-heaps "top-down" construction?)

What am I doing wrong?

Any input would be GREATLY appreciated!

Here is the question.:

http://dpaste.com/0HW4VCE#wrap

I've been trying to do this, but not only am I stuck, but to even get to where I am, it's taking VERY long.

If I had this question on the exam, it would take me so long that I'd have to come back to it at the end, and I probably would not be able to complete it on time, if I could even complete it in the first place.

Having said that, if I were given a tree diagram and were asked to come up with the in-order and post-order traversals, I would be able to quite easily. My difficulty is with doing this process backwards.

Could someone please tell me of a systematic approach on how to do this as fast and reliably as possible?

Any input would be GREATLY appreciated!

The recursiveVersion and iterativeVersion methods are supposed to state whether game can be won or not.

The instructions for how the game is played can be found here.:

https://www.docdroid.net/YOP9dkK/stuckonprogrammin...

My recursiveVersion method works well for both good and bad inputs.

My iterativeVersion method only works well for good inputs.

Here is the code with the iterativeVersion method (in the TheRowGame class).:

http://dpaste.com/1T7YXQX

Here is the code for the helper class, StackFrame.:

http://dpaste.com/2K0WTD8

Here is the error I am getting.:

http://dpaste.com/3A9512X

Why is the index not always in the interval [0,9]?

Could someone please help me fix this issue?

Any help in fixing this issue would be greatly appreciated!

P.S.

I'm aware that I can fix other minor things like making the methods static, but right now, I just want to focus on the more difficult stuff, which, for me, at least, is getting this bug fixed.

Hello, everyone.

I'm stuck on converting recursive code into iterative code that uses a Stack, but, even after days of "breaking my head," I still haven't figured it out.

I had an assignment question ( https://www.docdroid.net/YOP9dkK/stu...ion.pdf#pag... ) for which I needed to be able to do this, but I was, unfortunately, not able to figure this out on time for that assignment's deadline, and that will likely cost me a lot of marks, but there's nothing I can do about that anymore, and I have a test coming up soon, and that topic may come up again (but, even if it doesn't, I would still really like to know), so I would really appreciate it if someone could help me figure it out as soon as possible, because I have so much material to learn in a short amount of time that I feel overwhelmed.

Here's my (Java) code.:

http://dpaste.com/1TSCAGT

http://dpaste.com/2XQ8C9B

Basically, my question is how do I make public boolean iterativeVersion(int index, int[] theRow, boolean[] visited) do what public boolean recursiveVersion(int index, int[] theRow, boolean[] visited) does?

Any input would be greatly appreciated!

P.S.

If you need more information, just let me know.

Hello, everyone. :)

I'm looking at several different sources for the composite/multiple-segment trapezoidal rule (for approximating the value of an integral), but the formulas don't seem to agree. One place says I ≈ Δx/2 [f(a) + f(b)] + Δx Σ_(i=2)^(N-1) f(x_i). Another place says I ≈ Δx/2 [f(a) + f(b)] + Δx Σ_(i=2)^(N) f(x_i). Yet another place says I ≈ Δx/2 [f(a) + f(b) + 2 Σ_(i=1)^(N-1) f(a + iΔx)]. Only the first one seems correct to me. Basically, the second one seems to me like it should end at N-1, not N, and the third one seems to me like it should end at N-2, not N-1.

Am I right, or not?

For reference, the first formula can be found toward the beginning of the solution for part c.: https://www.docdroid.net/uNEKLNh/i.pdf#page=2

The second formula is equation (9.13) from here.: https://www.docdroid.net/9gQvLmE/ii.pdf

The third formula is in the frame of this video at 6:30. (The link already points to 6:30, for your convenience.): https://www.youtube.com/watch?v=Br9SWhhgRyg&featur...

Any input would be greatly appreciated!

My main question is surrounded by triple asterisks below (and I care about its answer the most of all the questions I asked), but I ask other related questions throughout my post.

From link 2:

(i) At dynamic equilibrium, reactants are converted to products and products are converted to reactants at an equal and constant rate.

(ii) Static equilibrium occurs when all particles in the reaction are at rest and there is no motion between reactants and products. [What if the only particles in the reaction that move are electrons (as opposed to atoms)? That counts as "motion between reactants and products", right?]

From link 3:

Redox (short for reduction–oxidation reaction) is a chemical reaction in which the oxidation states of atoms are changed (which, if I'm correct, implies MANDATORY motion of electrons, by definition).

So, if a redox reaction requires electron motion and electron motion of a redox reaction does indeed count as motion between reactants and products, then redox reactions should ALWAYS have motion between reactants and products, right?

Someone has told me that a redox reaction with a potential of 0 means the system in question is in equilibrium, so, ***must redox reactions with a potential of 0 ALWAYS be in dynamic equilibrium (as opposed to static equilibrium), or can they also be in static equilibrium?***

If I'm wrong (anywhere in this post, but especially with my main question), please correct me.

Any input would be GREATLY appreciated!

Hello to everyone who reads this. :)

I DO understand the two following points.:

1. If the redox potential of a redox reaction is positive, then the redox reaction is spontaneous.

2. If the redox potential of a redox reaction is negative, then the redox reaction is NOT spontaneous/non-spontaneous.

What I am NOT 100 percent sure I understand is what a redox potential of 0 (so neither positive nor negative) means (since most, if not all, sources don't seem to mention that). ***Does it simply mean that there is no reaction that can occur (whether spontaneous or not), period?*** [The triple asterisks are just for surrounding the part/sentence of this post which I deem the most important. :)]

Any input would be GREATLY appreciated!

P.S.

"Potentials" = "Potential differences", right?

I've seen a YouTube video saying to balance a redox reaction either in acidic or basic solution, and then showing how to do it, but I don't understand how the decision to use an acidic or basic solution is made in the first place.

Could someone please tell me how one chooses whether to use an acidic or basic solution (without making the explanation more complicated than necessary)?

Any input would be GREATLY appreciated!

I tried three different internal laptop keyboards, and none of them are registered by the computer. I tried pressing F2 to enter setup, and I also tried Ctrl + Alt + Del to restart the computer as ways of checking that the particular keyboard being tested works, but none of them work.

I would very much appreciate any suggestions you may have!