Graphs and Boolean Logic

Question 1

Binary Search Tree

Answer 1

Tree where each node has at most two branches, and the value of each node is greater than its left child and less than its right child

Question 2

Boolean Expression

Answer 2

Logical statement that can be evaluated to either true or false when given inputs

Question 3

De Morgan’s Laws

Answer 3

Rule that states that:
(NOT A) AND (NOT B) == NOT (A OR B)
(NOT A) OR (NOTB) == NOT (A AND B)

Question 4

Directed Graph

Answer 4

Graph where each edge has a start node and an end node

Question 5

D-Type Flip-Flop

Answer 5

Logic circuit that delays input by one clock cycle

Question 6

Edge

Answer 6

Connection between points in a graph

Question 7

Full Adder

Answer 7

Logic circuit that adds two binary digits with a carry digit

Question 8

Graph

Answer 8

Set of nodes and the edges that connect them

Question 9

Half Adder

Answer 9

Logic circuit that adds two binary digits without a carry digit

Question 10

Karnaugh Map

Answer 10

Type of truth table where lines and blocks of 1s are highlighted to help simplify a Boolean expression

Question 11

Logical AND

Answer 11

Boolean operation that takes two inputs and returns true only if both inputs are true

Question 12

Logical NOT

Answer 12

Boolean operation that takes a single input and returns the opposite Boolean value

Question 13

Logical OR

Answer 13

Boolean operation that takes two inputs and returns true if either input is true

Question 14

Logical XOR

Answer 14

Boolean operation that takes two inputs and returns true only if the inputs are different

Question 15

Node

Answer 15

Point in a graph

Question 16

Tree

Answer 16

Undirected graph with no loops, where any two connected nodes are connected by a single edge

Question 17

Truth Table

Answer 17

Table that shows how the inputs of a Boolean expression relate to its outputs

Question 18

Undirected Graph

Answer 18

Graph where each edge can start or end at either of the nodes that it connects