It's a set of steps used to solve a problem.
Algorithm
This theory states, "Every computation that can be done in the real world can be effectively performed by a Turing machine."
Church-Turing Thesis
This is the 1st phase of the Software development process
This primitive type occupies 2 bytes of memory
Char
What is the value of num?
num = 22 % 5;
2
A collection of similar items stored together accessed using their position.
Array
This person is the father of the computer
Charles Babbage
A program construct that allows for a block of code to be repeated multiple times?
Loop
Does this code compile in Java?
sum = 0
for(int i = 0; i <= 5; ++i;){
sum += i;
}
False
This type represents a logical value, either true or false
Boolean
A binary digit with two possible values, 0 or 1.
Bit
This person made the first computer program
Ada Lovelace
A sorting algorithm that employs the "divide-and-conquer" strategy.
Merge sort
The term for a value that is passed into a method when it is called
Parameter
temp = variable1
variable1 = variable2
variable2 = temp
What is the value of the variable 2?
Variable 1
A sequence of binary digits made up of eight bits. It has 256 possible values
Byte
This precursor to the internet was established in 1969, connecting 4 computers at different locations, and laid the foundation for the network.
APERNET
The computational method which is concerned with the removal of unnecessary detail is called ___
Abstraction
True or False: Java supports multiple inheritance
False
If( string1 == string2){
}
This is not the correct way to compare strings because:
The == operator compares the memory addresses or references of the objects, not the contents
A numerical value that corresponds to a unique element in an array.
Index
What was the name of the British computer that cracked the German codes during World War II?
Colossus
This programming concept allows a single interface or method name to be used with different underlying implementations
Polymorphism
What do we call it when multiple methods have the same name but different signatures
Method overload
int sum = 0;
for( int i = 1; i < 10; --i ){
sum += i;
i *=2;
}
How many times does this code run
Infinitetly