Save
Busy. Please wait.
Log in with Clever
or
show password
Forgot Password?
Don't have an account?  Sign up 
Sign up using Clever
or
Username is available taken
show password


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. Your email address is only used to allow you to reset your password. See our Privacy Policy and Terms of Service.

Already a StudyStack user? Log In

Reset Password
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
edit
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

Compsci #9

From 6 [algorithms]

TermDefinition
Algorithms Step-by-step procedure for solving a problem in a finite amount of time. Algorithms must have a clear stopping point
Pseudocode Describe algorithms in a way that is intended for human eyes only. Focuses on the logic
Case time The running time of an algorithm grows with input size. Average case time is often difficult to determine. We focus on the worst case running time
Algorithm scalability Scalability includes speed. Does the algorithm finish quickly when processing large inputs?
Experimental study Evaluate the scalability by measuring the running time when using various input sizes
Experimental study limitations Results may not be indicative of the running time on other inputs not included in the experiment. To compare two algorithms, you must use the same software/hardware
Theoretical analysis Predicting how an algorithm's runtime grows with input size by analyzing its logic, not by running the code. This saves time, is hardware/software independent, and estimates efficiency based on the number of operations relative to input size
Primitive operations Primitive operations are simple steps in an algorithm, each taking a basic amount of time. Counting them helps measure an algorithm's efficiency without running it
RAM model Standardize the primitive operation. Consists of a CPU and limitless bank of memory cells. To simplify the model, we assume memory cells are numbered and accessing a cell takes unit time
Algorithms function Instead of measuring an algorithm's running time for a specific input size, we find a function that shows how running time changes with input size. This helps predict performance and compare algorithms
Created by: jolly_n4
Popular Computers sets

 

 



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:

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