, undirected edges allow for movement in either direction whereas directed edges only allow movement in the specified direction.
what are the instances of using undirected graph instead of directed graph and vice versa?
18 Matching Annotations
- Jul 2023
-
dsc-courses.github.io dsc-courses.github.ioGraphs1
-
-
dsc-courses.github.io dsc-courses.github.io
-
First, identify affordances for the specific outcomes that they make more likely.
do you find the affordance with your intuition first? or is there specific way of finding a object's affordance?
-
DataIndexedIntegerSet uses this idea of an array to implement a set of integers. It maintains a
Is it possible to have a two same numbers in this kind of list?
-
arithmetic
and it only applies when the tree is complete tree
-
Implementing removeMin, however, requires more work to maintain the completeness property.
is it because all the nodes in the tree have to be connected to each other?
-
-
dsc-courses.github.io dsc-courses.github.io
-
2-3 search tree
In 2-3 search tree, wouldn't it take another recursion to go through node with more than 1 element and wouldn't that make the tree less efficient?
-
alphabet.
In the presentation, I am seeing that string data goes to through some alphabets that is not included in a data. Why is that?
-
TST nodes can only have up to 3 non-null children
how can they contain all the string data only with 3 non-null children?
-
The binary search tree on the right shows the result of inserting each element in the left-to-right
I would like to know searching with this method is efficient. It seems like it is taking extra steps and could be more efficient.
-
For example, the ABCDEFG tree depicted above has a height of 2 because there are only two edges from the overall root to any of the deepest leaf nodes.
I think I still need some more explanation about what the height represents and how it affects the runtime.
-
N = high - low
to note that high represents the highest number during binary search and Low represents the lowest number during binary search.
-
-
dsc-courses.github.io dsc-courses.github.io
-
The best case (most efficient or fastest) occurs when the target is the same as the A[0]—even when the array is very large
I think I need an extra explanation of why target being the first element in the array makes the case most efficient.
-
The length of the A.
I think it is because it determines the number of loops. Correct me if I am wrong.
-
Node<Integer> n2 = new Node<>(2, n3); n1.next = n2;
in my understanding, there are two ways to define the next value, which is by putting it next to the previous value in a same parentheses, or define the next one by using .next.
-
each linked node contains its own element and a “link” or reference to the next node
In my understanding, all the elements in linked node are separated, but each value contains information about node's element and what is the next element
-
elementData = newData
what's the purpose of assigning elementData to newData?
-
Asymptotic analysis is a way of evaluating the efficiency of an algorithm on large inputs.
In what occasion, asymptotic analysis is useful. Why do we need to evaluate the efficiency of the code?
-
ArrayList<E>
I am kind of confused with what type of E is. How does E make difference with other array list type?
-