Save
or

or

taken

Make sure to remember your password. If you forget it there is no way for StudyStack to send you a reset link. You would need to create a new account.

Enter the associated with your account, and we'll email you a link to reset your password.
focusNode
Didn't know it?
click below

Knew it?
click below
Don't Know
Remaining cards (0)
Know
0:00
Embed Code - If you would like this activity on your web page, copy the script below and paste it into your web page.

Normal Size     Small Size show me how

# Computer Science 345

TermDefinition
Stable A sorting algorithm is __________ if it preserves the original relative ordering of records that match on the key value being sorted.
Internal An algorithm is __________ if it processes and sorts data entirely within the computer's memory; i.g. all the data it works with fits into memory
In-place An algorithm is said to be a(n) __________ algorithm if it does not require additional memory (or very little, i.g. temporary local variables) to operate.
External An algorithm is __________ if it processes and sorts data within the computer's external memory; the data may be larger than what can fit into memory.
Bubble Sort procedure( A[]:list ){ do{ didSwap = false; for(int i=1; i<=A.length;i++){ if( A[i-1] > A[i]) { swap( A[i-1], A[i] ) didSwap = true; } } } while(didSwap); }
Optimized bubble sort procedure( A[]:list ){ n =A.length; do{ didSwap = false; for(int i=1; i<=n-1;i++){ if( A[i-1] > A[i]) { swap( A[i-1], A[i] ) didSwap = true; } } n = n - 1; } while(di
Graph A Graph G=(V,E) is described by a set of vertices V, and a set of ordered pairs E, such that |V|≠0 and E is a binary relation on V.
Path Sequence of Connected Vertices.
Created by: 329600587

Voices

Use these flashcards to help memorize information. Look at the large card and try to recall what is on the other side. Then click the card to flip it. If you knew the answer, click the green Know box. Otherwise, click the red Don't know box.

When you've placed seven or more cards in the Don't know box, click "retry" to try those cards again.

If you've accidentally put the card in the wrong box, just click on the card to take it out of the box.

You can also use your keyboard to move the cards as follows:

• SPACEBAR - flip the current card
• LEFT ARROW - move card to the Don't know pile
• RIGHT ARROW - move card to Know pile
• BACKSPACE - undo the previous action

If you are logged in to your account, this website will remember which cards you know and don't know so that they are in the same box the next time you log in.

When you need a break, try one of the other activities listed below the flashcards like Matching, Snowman, or Hungry Bug. Although it may feel like you're playing a game, your brain is still making more connections with the information to help you out.

To see how well you know the information, try the Quiz or Test activity.

Pass complete!
 "Know" box contains: Time elapsed: Retries:
restart all cards