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 process for developing a program.
development plan
index
method
root
2. A compound data type that is often used to model a thing or concept in the real world.
accumulator
class
Queue
object
3. A loop in which the terminating condition is never satisfied.
infinite loop
infix
Queue
trace
4. A signal such as a keyboard press or mouse click or message from another program.
command line argument
event
run time error
constant time
5. An expression that is either true or false.
index
increment
level
boolean expression
6. The block of statements in a compound statement that follows the header.
step size
body
tail recursion
Queue
7. Memory which requires an electrical current to maintain state. Information stored is lost when the computer is turned off.
chained conditional
delimiter
temporary variable
volatile memory
8. Nodes that share a common parent.
initialization (of a variable)
siblings
path
decrement
9. An integer variable or value that indicates an element of a list.
function
index
aliases
infinite recursion
10. Information in a program that is meant for other programmers (or anyone reading the source code) and has no effect on the execution of the program.
comment
functional programming style
embedded reference
command line argument
11. A special character that causes the cursor to move to the next tab stop on the current line.
linked queue
tab
tuple assignment
syntax
12. a sequence of instructions that specifies to a computer actions and computations to be performed.
program
chained conditional
algorithm
traverse
13. A data type that contains a sequence of elements of any type - like a list but is immutable. Can be used wherever an immutable type is required.
branch
tuple
encode
operand
14. A set of instructions for solving a class of problems by a mechanical and unintelligent process.
algorithm
list traversal
incremental development
prefix notation
15. There are exactly two boolean values: True and False.
preorder
traverse
local variable
boolean value
16. An ADT that defines the operations one might perform on a priority queue.
Priority Queue
random
program
expression
17. A statement or group of statements that execute repeatedly until a terminating condition is satisfied.
semantics
encapsulate
loop
cursor
18. An operation whose runtime is a linear function of the size of the data structure.
linear time
inheritance
parameter
escape sequence
19. An escape character '' followed by one or more printable characters used to designate a nonprintable character.
tab
slice
object-oriented language
escape sequence
20. A programming language that is designed to be easy for humans to read and write.
syntax error
high-level language
data structure
sequence
21. An operation defined in linear algebra that multiplies each of the coordinates of a Point by a numeric value.
run time error
tab
handle an exception
scalar multiplication
22. A thing to which a variable can refer.
object
method
namespace
linked list
23. One of the pairs of items in a dictionary. Values are looked up in a dictionary by key.
interpret
key-value pair
debugging
random
24. Using the output from one function call as the input to another.
base case
mode
function composition
operand
25. One program structure within another - such as a conditional statement inside a branch of another conditional statement.
embedded reference
integer division
nesting
function composition
26. To simplify an expression by performing the operations in order to yield a single value.
compiler
fundamental ambiguity theorem
body
evaluate
27. A general process for solving a category of problems.
fundamental ambiguity theorem
function composition
algorithm
decrement
28. An error in a program that makes it impossible to parse
syntax error
boolean function
escape sequence
function composition
29. A set of characters that are treated as a unit for purposes of parsing such as the words in a natural language.
directory
chained conditional
token
pure function
30. A string constant on the first line of a function or module definition - they provide a convenient way to associate documentation with code.
argv (argument vector)
clone
concatenate
docstring
31. A function that calls itself recursively without ever reaching the base case - ultimately causes a runtime error.
infinite recursion
initialization (of a variable)
encapsulate
dictionary
32. The ability to define a new class that is a modified version of a previously defined class.
scaffolding
scalar multiplication
inheritance
standard library
33. A style of program design in which the majority of functions are pure.
functional programming style
return value
key
parameter
34. A variable defined inside a module - accessed by using the dot operator ( .).
linear time
binary operator
non-volatile memory
attribute
35. An explicit statement that takes a value of one type and computes a corresponding value of another type.
linear time
function definition
iteration
type conversion
36. A combination of variables and operators and values that represents a single result value.
trichotomy
linear time
expression
object code
37. A data type which can be modified.
mutable data type
value
slice
inheritance
38. A class definition that implements an ADT with method definitions that are invocations of other methods - sometimes with simple transformations. It does no significant work but it improves or standardizes the interface seen by the client.
veneer
syntax
variable name
logical operator
39. To ________ a variable is to give it an initial value - usually in the context of multiple assignment.
initialization (of a variable)
fundamental ambiguity theorem
problem solving
operator
40. A situation in which two or more names in a given namespace cannot be unambiguously resolved.
data type
queueing policy
embedded reference
naming collision
41. A style of programming in which data and the operations that manipulate it are organized into classes and methods.
delimiter
object-oriented programming
child
parse
42. A branch of the conditional statement in a recursive function that does not result in a recursive call.
preorder
base case
trace
function definition
43. One of the named data items that makes up an instance.
Queue
method
algorithm
attribute
44. To create a new object that has the same value as an existing object.
chained conditional
algorithm
block
clone
45. 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
logical operator
syntax
tail recursion
method
46. Generalization by reducing the information content of a concept.
linear time
abstraction
recursion
method
47. A method for naming and accessing and organizing files and the data they contain.
mapping type
file system
link
naming collision
48. One of the nodes referred to by a node.
run time error
child
test-driven development (TDD)
Priority Queue
49. A named collection of files - also called a folder.
preorder
subexpression
directory
boolean expression
50. An error in a program.
file system
nesting
boolean function
bug