Save
Upgrade to remove ads
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

ALGO FA 1

QuestionAnswer
Muhammad ibn Musa al-Khwarizmi – 9th century mathematician T
Analysis of algorithms is the determination of the amount of time and space resources required to execute it. T
_________ is a sequence of unambiguous instructions for solving a problem. algorithm
_________ thus a sequence of computational steps that transform the input into the output. algorithm
"GCD (700,24)" 4
______ refers to an algorithm is asserted when it is said that the algorithm is correct with respect to a specification. correctness
" GCD (224,602)" 14
A criterion where all operations to be performed must be sufficiently basic that they can be done exactly and in finite length. effectiveness
" A sequence of computational steps that transform the input into the output." algorithm
" GCD (24,60)" 12
" Adjacent Linked list is collection of linked lists, one for each vertex, that contain all the vertices adjacent to the list’s vertex." TRUE
Linked list is sequence of zero or more nodes each containing two kinds of information: some data and one or more links called pointers to other nodes. TRUE
" __________ searching for a given word/pattern in a text" string matching
" Sorting ______ is a special piece of information used to guide sorting." key
" A sorting property that if it preserves the relative order of any two equal elements in its input" stability
" Finding a given value, called a search key, in a given set." sorting
" Edges set E of vertex pairs." TRUE
Model development is an __________ process. iterative
Program testing is the process of executing a program with the intent of finding errors. TRUE
GCD (345,12) 3
" There are how many steps involved in solving computational problems " 9
Pseudocode gives a high-level description of an algorithm without the ambiguity associated with plain text but also without the need to know the syntax of a particular programming language. TRUE
Stack uses LIFO / FILO approach. TRUE
Stack uses LIFO / FILO approach. TRUE
" It is a sequence of characters from an alphabet" string
" Connected components is the maximum connected subgraph of a given graph." TRUE
" Cycle simple path of a positive length that starts and ends a the same vertex." TRUE
Queue uses FIFO / LILO approach. TRUE
" __________ A sequence of n items of the same data type that are stored contiguously in computer memory and made accessible by specifying a value of the array’s index." array
IT refers to an algorithm is asserted when it is said that the algorithm is correct with respect to a specification correctness
There are how many elements of a problem statement 3
" A criterion where all operations to be performed must be sufficiently basic that they can be done exactly and in finite length" effectiveness
__________ is finding a given value, called a search key, in a given set. searching
" is a sorting property that does not require extra memory, except, possibly for a few memory units" in place
" It refers to the correctness refers to the input-output behavior of the algorithm" Functional
The presence of documentation helps keep track of all aspects of an application and it improves on the quality of a software product. TRUE
" It refers to the process that a program must end finite number of steps." Finiteness
GCD (2344:1231) 1
" __________ string consist of letters, numbers, and special characters." Text String
_________ is any well-defined computational procedure that takes some value, or set of values, as input and produces some value, or set of values, as output. algorithm
" Ordered Tree is a rooted tree in which all the children of each vertex are ordered" TRUE
"It refers to a sequence of unambiguous instructions for solving a problem " Algorithm
"__________ is a sorting property that if it preserves the relative order of any two equal elements in its input. " stability
"Cycle A simple path of a positive length that starts and ends a the same vertex. " TRUE
"Arrays is sequence of n items of the same data type that are stored contiguously in computer memory " TRUE
Vertices sets: a finite set V of items. TRUE
Created by: crystallll
 

 



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