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. An implementation of a queue using a linked list.
linked queue
attribute
immutable data type
encode
2. An error in a program that makes it do something other than what the programmer intended.
script
recursive call
aliases
semantic error
3. A loop inside the body of another loop.
nested loop
dot notation
initialization method
escape sequence
4. A situation in which two or more names in a given namespace cannot be unambiguously resolved.
Priority Queue
naming collision
value
postfix
5. The set of rules governing the order in which expressions involving multiple operators and operands are evaluated.
rules of precedence
file system
parameter
function definition
6. A statement that consists of two parts: header - which begins with a keyword determining the statement type and ends with a colon. body - containing one or more statements indented the same amount from the header.
parent class
linked queue
compound statement
infinite recursion
7. A data type in which the values are made up of components or elements that are themselves values.
compound data type
event loop
precondition
functional programming style
8. A group of consecutive statements with the same indentation.
preorder
hint
keyword
block
9. A signal such as a keyboard press or mouse click or message from another program.
naming collision
event
class attribute
command prompt
10. A function that calls itself recursively without ever reaching the base case - ultimately causes a runtime error.
linear time
infinite recursion
bug
encapsulate
11. To divide a large complex program into components (like functions) and isolate the components from each other (by using local variables - for example).
level
encapsulate
compound statement
modifier
12. A value provided to a function when the function is called. This value is assigned to the corresponding parameter in the function.
slice
command line argument
file
argument
13. A variable used as part of the terminating condition of a loop.
development plan
random
loop variable
accumulator
14. A statement or group of statements that execute repeatedly until a terminating condition is satisfied.
loop
flow of execution
list comprehension
source code
15. A bottom-most node in a tree with no children.
leaf
newline
queueing policy
decrement
16. A named entity - usually stored on a hard drive or floppy disk or CD-ROM - that contains a stream of characters.
interpret
file
inorder
byte code
17. Repeated execution of a set of programming statements.
stack diagram
iteration
cargo
inorder
18. An assertion that should be true of an object at all times (except perhaps while the object is being modified).
index
linked queue
helper
invariant
19. A step-by-step process for solving a category of problems.
infinite recursion
executable
child class
algorithm
20. To signal an exception using the raise statement.
parse
handle an exception
raise
provider
21. To read a string of characters or tokens and analyze its grammatical structure.
trichotomy
attribute
concatenate
parse
22. Both as a noun and as a verb - it means to increase by 1.
cursor
temporary variable
child
increment
23. The statements inside a loop.
function call
body
token
boolean function
24. To represent one set of values using another set of values by constructing a mapping between them.
parse
encode
modifier
run time error
25. A statement that executes a function. It consists of the name of the function followed by a list of arguments enclosed in parentheses.
problem solving
recursive call
function call
dot product
26. Any of the data types that consist of an ordered set of elements with each element identified by an index.
event
object
sequence
rules of precedence
27. A sequence of one or more characters used to specify the boundary between separate parts of text.
delimiter
list
pure function
compiler
28. To ________ a variable is to give it an initial value - usually in the context of multiple assignment.
source code
initialization (of a variable)
whitespace
interpret
29. Making more than one assignment to the same variable during the execution of a program.
operand
object
attribute
multiple assignment
30. A combination of variables and operators and values that represents a single result value.
linear time
pure function
abstraction
expression
31. A numerical value that does not change during the execution of a program.
queue
unit testing
escape sequence
constant
32. A reference to a list node can be treated as a single object or as the first in a list of nodes.
child
mapping type
comparison operator
fundamental ambiguity theorem
33. A way of developing programs that involves high-level insight into the problem and more planning than incremental development or prototype development.
dot notation
increment
planned development
parse
34. The sequence of characters read into the command interpreter in a command line interface.
command line
binary operator
delimiter
object-oriented programming
35. An assignment to all of the elements in a tuple using a single assignment statement. Useful for swapping values.
tuple assignment
return value
infix
method
36. Multiple variables that contain references to the same object.
aliases
attribute
sequence
fundamental ambiguity theorem
37. A number or string (or other things to be named later) that can be stored in a variable or computed in an expression.
value
provider
low-level language
namespace
38. A syntactic container providing a context for names so that the same name can reside in different namespaces without ambiguity.
operator overloading
integer division
non-volatile memory
namespace
39. Code that is used during program development but is not part of the final version.
scaffolding
recursive definition
mode
preorder
40. A function that does not modify any of the objects it receives as parameters. Most pure functions are fruitful.
client
key-value pair
rules of precedence
pure function
41. A queueing policy in which each member has a priority determined by external factors. The member with the highest priority is the first to be removed.
flow of execution
priority queue
singleton
return value
42. A value passed to a program along with the program's invocation at the command prompt of a command line interface (CLI).
branch
tuple assignment
index
command line argument
43. A name used inside a function to refer to the value passed as an argument.
parameter
delimiter
boolean value
return value
44. The ability to define a new class that is a modified version of a previously defined class.
traverse
base case
inheritance
binary operator
45. A conditional branch with more than two possible flows of execution.
binary operator
index
command line
chained conditional
46. A recursive call that occurs as the last statement (at the tail) of a function definition.
fundamental ambiguity theorem
tail recursion
linear time
recursive definition
47. An integer variable or value that indicates an element of a list.
index
child class
generalize
body
48. Generalization by reducing the information content of a concept.
dictionary
trace
instantiate
abstraction
49. The order in which statements are executed during a program run.
syntax
constant time
parse
flow of execution
50. The ability to combine simple expressions and statements into compound statements and expressions in order to represent complex computations concisely.
node
precondition
instantiate
composition