From b8f0ab6fded74b3283780550618a15f852f619e6 Mon Sep 17 00:00:00 2001 From: thomasabishop Date: Fri, 9 Dec 2022 09:00:05 +0000 Subject: [PATCH] Autosave: 2022-12-09 09:00:05 --- Electronics/Digital_Circuits/Latches.md | 4 ++-- Topic_Log.md | 11 ++++++++++- 2 files changed, 12 insertions(+), 3 deletions(-) diff --git a/Electronics/Digital_Circuits/Latches.md b/Electronics/Digital_Circuits/Latches.md index fe17d7c..a5cc712 100644 --- a/Electronics/Digital_Circuits/Latches.md +++ b/Electronics/Digital_Circuits/Latches.md @@ -10,13 +10,13 @@ tags: [logic-gates, binary, memory] The combinatorial digital circuits we have looked at so far have been non-sequential. The outcome is a function of its immediate set of inputs and everything happens at once: there is no means of storing state for future use. In other words there is no _[memory](/Hardware/Memory/Memory.md)_. -In contrast, a sequential digital circuit's output depends not only on its present set of inputs but also on past inputs to the circuit. It has some knowledge of its own previous state through the existence of memory - a component that allows for the **storage and retrieval of binary data**. +In contrast, a sequential digital circuit's output depends not only on its present set of inputs but also on past inputs to the circuit. It has some knowledge of its own previous state through the existence of memory. This can be implemented via components that allow for the **storage and retrieval of binary data**. ## What is a latch? A latch is a circuit component that works as a very basic memory device. It is capable of setting and resetting a single bit. We can remember what it does by thinking of a door latch: once you turn the key the lock is set, when you turn it back it is unset. -The **SR Latch** (for "set/reset") has two inputs: S (for set) and R (for reset) and one output, Q. Q stands for the bit that is remembered. There is also not-Q which is the opposite of whatever Q is currfently set to. +The **SR Latch** (for "set/reset") has two inputs: _S_ (for "set") and _R_ (for "reset") and one output, _Q_. _Q_ stands for the bit that is remembered. (There is also not-Q which is the opposite of whatever Q is currently set to.) > When S is set to 1, output Q becomes 1 also. When S goes to 0, Q remains 1. When R is set to 1, this clears the memory bit and Q becomes 0. Q remains at 0 even if R goes back to 0. diff --git a/Topic_Log.md b/Topic_Log.md index c4a065b..9fd6264 100644 --- a/Topic_Log.md +++ b/Topic_Log.md @@ -14,7 +14,7 @@ ## GraphQL -- What is a transformer +- What is a transformer? ## AWS @@ -23,3 +23,12 @@ - Elastic Beanstalk and how it differs from using multiple different services at once - AWS Amplify - Deploy my own website on AWS + +## Git + +- What is rebasing? +- What is cherry-picking? +- GitFlow methodology in the context of releases, hotfixes etc +- How can you rollback without a hard-reset, i.e. how can you keep the future state (from the point of view of the rolled-back branch) accessible? +- Tagging (also in relation to Git flow) +- See if there is an advanced Git course on LinkedIn