ACES Computer Science

0.0(0)
Studied by 0 people
call kaiCall Kai
learnLearn
examPractice Test
spaced repetitionSpaced Repetition
heart puzzleMatch
flashcardsFlashcards
GameKnowt Play
Card Sorting

1/14

encourage image

There's no tags or description

Looks like no tags are added yet.

15 Terms

1
New cards

Post order

  • The left subtree is traversed first.

  • Then the right subtree is traversed.

  • Finally, the root node of the subtree is traversed.


<ul><li><p><span style="line-height: 1.6; font-size: inherit; color: inherit;">The left subtree is traversed first.</span></p></li><li><p><span style="line-height: 1.6; font-size: inherit; color: inherit;">Then the right subtree is traversed.</span></p></li><li><p><span style="line-height: 1.6; font-size: inherit; color: inherit;">Finally, the root node of the subtree is traversed.</span></p></li></ul><p></p>
2
New cards

In order

  • The left subtree is traversed first.

  • Then the root node for that subtree is traversed.

  • Finally, the right subtree is traversed.


<ul><li><p><span style="line-height: 1.6; font-size: inherit; color: inherit;">The left subtree is traversed first.</span></p></li><li><p><span style="line-height: 1.6; font-size: inherit; color: inherit;">Then the root node for that subtree is traversed.</span></p></li><li><p><span style="line-height: 1.6; font-size: inherit; color: inherit;">Finally, the right subtree is traversed.</span></p></li></ul><p></p>
3
New cards

Pre order

  • The root node of the subtree is visited first.

  • Then the left subtree is traversed.

  • At last, the right subtree is traversed.


<ul><li><p><span style="line-height: 1.6; font-size: inherit; color: inherit;">The root node of the subtree is visited first.</span></p></li><li><p><span style="line-height: 1.6; font-size: inherit; color: inherit;">Then the left subtree is traversed.</span></p></li><li><p><span style="line-height: 1.6; font-size: inherit; color: inherit;">At last, the right subtree is traversed.</span></p></li></ul><p></p>
4
New cards

Depth first search

You pick a path, then go down a path inside that path, etc, until you have found the end of that path. Then you go up a level and go down the other path.

<p>You pick a path, then go down a path inside that path, etc, until you have found the end of that path. Then you go up a level and go down the other path. </p>
5
New cards

Breath first search

Cover every single layer of a the entire tree, do not just go down one path

<p>Cover every single layer of a the entire tree, do not just go down one path </p>
6
New cards

Adjacency Matrices

Just 2d Arrays, Array[Row][Column] with a sequence of numbers going row →

7
New cards
<p>What gate is this? </p>

What gate is this?

AND Gate

8
New cards
<p>What gate is this? </p>

What gate is this?

OR Gate

9
New cards
<p>What gate is this?</p>

What gate is this?

NOT Gate

10
New cards
<p>What gate is this? </p>

What gate is this?

NOR Gate

11
New cards
<p>What gate is this? </p>

What gate is this?

NAND Gate

12
New cards
<p>What gate is this? </p>

What gate is this?

XOR Gate, A and B must be different values

13
New cards
<p>What gate is this?</p>

What gate is this?

XNOR

14
New cards

OSI

Open Systems Interconnection, comes in 7 layers

15
New cards

TCP/IP

Transmission Control Protocol, Internet Protocol