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 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.
tuple
index
mutable data type
text file
2. A special character that causes the cursor to move to the next tab stop on the current line.
trichotomy
tab
tuple
Priority Queue
3. A statement which makes the objects contained in a module available for use within another module.
import statement
body
continue statement
method
4. To read a string of characters or tokens and analyze its grammatical structure.
raise
parse
traverse
variable
5. One of the values in a list (or other sequence). The bracket operator selects elements of a list.
element
body
tail recursion
recursive definition
6. A program (or the person who wrote it) that uses an ADT.
natural language
generalize
clone
client
7. The code (or the person who wrote it) that implements an ADT.
trace
handle an exception
provider
cursor
8. A way of writing a mathematical expression with each operator appearing before its operands.
prefix notation
variable name
method
compound data type
9. To follow the flow of execution of a program by hand - recording the change of state of the variables and any output produced.
Queue
assignment statement
development plan
trace
10. A data type which can be modified.
wrapper
argv (argument vector)
operand
mutable data type
11. A syntactic construct which enables lists to be generated from other lists using a syntax analogous to the mathematical set-builder notation.
whitespace
variable name
list comprehension
standard library
12. The first part of a compound statement. Headers begin with a keyword and end with a colon (:)
scalar multiplication
formal language
header
client
13. 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.
base case
comment
command line argument
dictionary
14. A process for developing a program.
algorithm
linear time
development plan
scalar multiplication
15. The class from which a child class inherits.
escape sequence
parent class
index
leaf
16. A distinct method of operation within a computer program.
executable
mode
compiler
return value
17. A character or string used to indicate where a string should be split.
delimiter
traverse
incremental development
overflow
18. A data type comprised of a collection of keys and associated values.
singleton
natural language
counter
mapping type
19. A way to traverse a tree - visiting the left subtree and then the root and then the right subtree.
random
parse
dot notation
inorder
20. 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.
algorithm
command line
executable
veneer
21. To signal an exception using the raise statement.
exception
return value
infinite recursion
raise
22. Another name for object code that is ready to be executed.
key
portability
executable
local variable
23. A way of developing programs starting with a prototype and gradually testing and improving it.
nested loop
prototype development
list comprehension
immutable data type
24. A syntactic container providing a context for names so that the same name can reside in different namespaces without ambiguity.
continue statement
namespace
mapping type
tail recursion
25. To simplify an expression by performing the operations in order to yield a single value.
inorder
list
evaluate
object
26. A conditional branch with more than two possible flows of execution.
chained conditional
header
mutable type
natural language
27. Any of the data types that consist of an ordered set of elements with each element identified by an index.
linked queue
preorder
value
sequence
28. To translate a program written in a high-level language into a low-level language all at once - in preparation for later execution.
loop variable
interface
compile
Priority Queue
29. a sequence of instructions that specifies to a computer actions and computations to be performed.
scaffolding
standard library
recursive definition
program
30. An automatic procedure used to validate that individual units of code are working properly.
unit testing
parse
composition (of functions)
veneer
31. A bottom-most node in a tree with no children.
hint
class attribute
leaf
constant time
32. The statement in a recursive function with is a call to itself.
algorithm
node
recursive call
optional parameter
33. Generalization by reducing the information content of a concept.
siblings
program
state diagram
abstraction
34. A way of writing mathematical expressions with the operators after the operands.
node
generic data structure
algorithm
postfix
35. To examine a program and analyze the syntactic structure.
polymorphic
parse
loop
chained conditional
36. A variable defined inside a function. A local variable can only be used inside its function.
local variable
concatenate
boolean expression
wrapping code in a function
37. A function which changes its arguments inside the function body. Only mutable types can be changed by modifiers.
modifier
loop
command line argument
assignment statement
38. An item of data contained in a node.
object
non-volatile memory
key
cargo
39. A tree in which each node refers to zero or one or two dependent nodes.
binary tree
assignment statement
cursor
test-driven development (TDD)
40. A data type in which the values are made up of components or elements that are themselves values.
precondition
implementation
volatile memory
compound data type
41. A way of developing programs that involves high-level insight into the problem and more planning than incremental development or prototype development.
development plan
planned development
operator
comparison operator
42. The set of nodes equidistant from the root.
wrapping code in a function
pure function
level
constant
43. An error in a program.
fruitful function
bug
initialization (of a variable)
generalize
44. A parameter written in a function header with an assignment to a default value which it will receive if no corresponding argument is given for it in the function call.
recursive call
immutable data type
postfix
optional parameter
45. Decrease by 1.
decrement
parent
infinite loop
compiler
46. The sequence of characters read into the command interpreter in a command line interface.
command line
fundamental ambiguity theorem
variable
evaluate
47. A way of writing mathematical expressions with the operators between the operands.
infix
fruitful function
postfix
formal language
48. A collection of key-value pairs that maps from keys to values.
key
dictionary
return value
leaf
49. An operation whose runtime does not depend on the size of the data structure.
FIFO(First In First Out)
constant time
traverse
standard library
50. The second part of a compound statement. The body consists of a sequence of statements all indented the same amount from the beginning of the header.
tuple
comparison operator
stack diagram
body