SUBJECTS
|
BROWSE
|
CAREER CENTER
|
POPULAR
|
JOIN
|
LOGIN
Business Skills
|
Soft Skills
|
Basic Literacy
|
Certifications
About
|
Help
|
Privacy
|
Terms
|
Email
Search
Test your basic knowledge |
Programming
Start Test
Study First
Subject
:
it-skills
Instructions:
Answer 50 questions in 15 minutes.
If you are not ready to take this test, you can
study here
.
Match each statement with the correct term.
Don't refresh. All questions and answers are randomly picked and ordered every time you load a test.
This is a study tool. The 3 wrong answers for each question are randomly chosen from answers to other questions. So, you might find at times the answers obvious, but you will see it re-enforces your understanding as you take the test each time.
1. A statement which makes the objects contained in a module available for use within another module.
keyword
text file
import statement
comment
2. A way to traverse a tree - visiting each node before its children.
preorder
value
boolean function
script
3. To replace something unnecessarily specific (like a constant value) with something appropriately general (like a variable or parameter). It makes code more versatile - more likely to be reused and sometimes even easier to write.
precondition
generalize
cargo
slice
4. An explicit statement that takes a value of one type and computes a corresponding value of another type.
singleton
type conversion
comment
exception
5. An integer variable or value that indicates an element of a list.
infinite loop
byte code
index
instance
6. A property of a program that can run on more than one kind of computer.
composition
attribute
slice
portability
7. The structure of a program.
body
comparison operator
import statement
syntax
8. To create an instance of a class.
debugging
constant time
instantiate
node
9. Any one of the languages that people have designed for specific purposes - such as representing mathematical ideas or computer programs; all programming languages are formal languages.
low-level language
formal language
queueing policy
optional parameter
10. To join two strings end-to-end.
incremental development
flow of execution
concatenate
immutable data type
11. One of the named data items that makes up an instance.
list traversal
volatile memory
attribute
branch
12. Generalization by reducing the information content of a concept.
decrement
conditional statement
abstraction
runtime error
13. A process for developing a program.
list comprehension
index
precondition
development plan
14. A graphical representation of a stack of functions and their variables and the values to which they refer.
stack diagram
dot operator
exception
header
15. An escape character '' followed by one or more printable characters used to designate a nonprintable character.
escape sequence
linked list
condition
precondition
16. An element of a list - usually implemented as an object that contains a reference to another object of the same type.
raise
parent
node
abstract data type (ADT)
17. A program (or the person who wrote it) that uses an ADT.
concatenate
level
tuple assignment
client
18. An operation defined in linear algebra that multiplies two Points and yields a numeric value.
fundamental ambiguity theorem
debugging
planned development
dot product
19. An operator denoted with a percent sign ( %) - that works on integers and yields the remainder when one number is divided by another.
counter
modulus operator
stack diagram
index
20. The ability to define a new class that is a modified version of a previously defined class.
integer division
inheritance
implementation
linked queue
21. The process of calling the function that is currently executing.
token
recursion
raise
step size
22. To translate a program written in a high-level language into a low-level language all at once - in preparation for later execution.
priority queue
mapping type
compile
modifier
23. An implementation of a queue using a linked list.
fundamental ambiguity theorem
aliases
linked queue
FIFO(First In First Out)
24. A way to traverse a tree - visiting the children of each node before the node itself.
unit testing
postorder
body
attribute
25. An invisible marker that keeps track of where the next character will be printed.
tail recursion
body
cursor
raise
26. The set of operations that define an ADT.
immutable data type
linear time
interface
event loop
27. A character or string used to indicate where a string should be split.
delimiter
priority queue
rules of precedence
algorithm
28. The interval between successive elements of a linear sequence. The third (and optional argument) to the range function is called the step size. If not specified it defaults to 1.
program
step size
composition (of functions)
dot notation
29. Nodes that share a common parent.
handle an exception
docstring
object
siblings
30. The class from which a child class inherits.
planned development
parent class
prototype development
algorithm
31. An ADT that performs the operations one might perform on a queue.
variable
scaffolding
decrement
Queue
32. An expression in parentheses that acts as a single operand in a larger expression.
subexpression
operator overloading
linked list
return value
33. To execute a program in a high-level language by translating it one line at a time.
postfix
level
list traversal
interpret
34. Function-like attribute of an object. Methods are invoked (called) on an object using the dot operator.
volatile memory
directory
base case
method
35. One of the operators that compares two values: == or != or > or < or >= and <=.
comparison operator
assignment statement
executable
portability
36. A variable or value used to select a member of an ordered set - such as a character from a string.
index
key
traverse
object-oriented programming
37. An assertion that must be true in order for a method to work correctly.
object
object-oriented programming
precondition
random
38. A compound data type that is often used to model a thing or concept in the real world.
operator
infinite loop
object
index
39. A function that is defined inside a class definition and is invoked on instances of that class. :override:: To replace a default. Examples include replacing a default parameter with a particular argument and replacing a default method by providing a
compound data type
method
object
mode
40. A data type which cannot be modified. Assignments to elements or slices of immutable types cause a runtime error.
immutable data type
multiple assignment
index
rules of precedence
41. A statement that creates a new function specifying its name and parameters and the statements it executes.
queueing policy
function definition
Queue
nesting
42. Part of a program that can never be executed - often because it appears after a return statement.
tuple assignment
postorder
dead code
provider
43. Calling one function from within the body of another or using the return value of one function as an argument to the call of another.
postorder
state diagram
object code
composition (of functions)
44. Having no specific pattern. Unpredictable.
docstring
body
random
event loop
45. A programming language that is designed to be easy for a computer to execute; also called machine language or assembly language.
raise
optional parameter
low-level language
embedded reference
46. A way of developing programs that involves high-level insight into the problem and more planning than incremental development or prototype development.
header
initialization method
planned development
dead code
47. Memory that can maintain its state without power. Hard drives and flash drives and rewritable compact disks (CD-RW) are examples of such memory.
concatenate
non-volatile memory
aliases
priority queue
48. An ADT that defines the operations one might perform on a priority queue.
syntactical errors
Priority Queue
attribute
parent
49. Making more than one assignment to the same variable during the execution of a program.
namespace
queue
multiple assignment
object code
50. A situation in which two or more names in a given namespace cannot be unambiguously resolved.
interpret
trace
naming collision
script