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. Any of the characters that move the cursor without printing visible characters. The constant string.whitespace contains all the white-space characters.
whitespace
child
parse
prompt
2. A library is a collection of software used as tools in the development of other software.
standard library
encapsulate
recursive call
wrapper
3. A program development plan intended to avoid debugging by adding and testing only a small amount of code at a time.
counter
object-oriented programming
infinite loop
incremental development
4. A list that is an element of another list.
list
recursive call
variable name
nested list
5. The sequence of characters read into the command interpreter in a command line interface.
volatile memory
level
command line
return value
6. A file that contains printable characters organized into lines separated by newline characters.
text file
aliases
infinite recursion
class
7. 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.
encapsulate
formal language
leaf
prompt
8. The code (or the person who wrote it) that implements an ADT.
provider
constant time
object
directory
9. A variable that is defined inside a class definition but outside any method. These are accessible from any method in the class and are shared by all instances of the class.
chained conditional
class attribute
priority queue
operator
10. An assertion that must be true in order for a method to work correctly.
value
link
precondition
object-oriented language
11. Memory which requires an electrical current to maintain state. Information stored is lost when the computer is turned off.
hint
volatile memory
nested list
side effect
12. A style of programming in which data and the operations that manipulate it are organized into classes and methods.
embedded reference
object-oriented programming
accumulator
mode
13. A data type which cannot be modified. Assignments to elements or slices of immutable types cause a runtime error.
prefix notation
directory
algorithm
immutable data type
14. The process of calling the function that is currently executing.
compound data type
recursion
boolean value
Queue
15. A program (or the person who wrote it) that uses an ADT.
command line argument
loop
client
implementation
16. One of the values on which an operator operates.
operand
object code
fruitful function
decrement
17. To examine a program and analyze the syntactic structure.
operand
infix
parse
problem solving
18. A queueing policy in which the first member to arrive is the first to be removed.
file system
temporary variable
parameter
FIFO(First In First Out)
19. The meaning of a program.
flow of execution
semantics
parse
slice
20. Another name for a runtime error.
exception
functional programming style
optional parameter
link
21. Code that satisfies the syntactic and semantic requirements of an interface.
instantiate
object-oriented programming
implementation
command prompt
22. A user-defined compound type. A class can also be thought of as a template for the objects that are instances of it.
wrapper
class
dot notation
object-oriented programming
23. An error in a program that makes it impossible to parse
loop variable
unit testing
syntax error
object code
24. To divide a large complex program into components (like functions) and isolate the components from each other (by using local variables - for example).
executable
parent
link
encapsulate
25. Part of a program that can never be executed - often because it appears after a return statement.
dead code
increment
conditional statement
hint
26. A change in the state of a program made by calling a function that is not a result of reading the return value from the function. Can only be produced by modifiers.
semantics
algorithm
side effect
encode
27. 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.
standard library
type conversion
comment
traceback
28. The set of operations that define an ADT.
test-driven development (TDD)
temporary variable
semantics
interface
29. A box in a stack diagram that represents a function call. It contains the local variables and parameters of the function.
invariant
frame
compound data type
counter
30. A new class created by inheriting from an existing class; also called a subclass.
header
child class
queueing policy
subexpression
31. Extending built-in operators ( + or - or * or > or < etc.) so that they work with user-defined types.
standard library
boolean function
operator overloading
delimiter
32. A syntactic construct which enables lists to be generated from other lists using a syntax analogous to the mathematical set-builder notation.
body
list comprehension
keyword
semantics
33. The statement in a recursive function with is a call to itself.
key-value pair
side effect
parameter
recursive call
34. An element of a list - usually implemented as an object that contains a reference to another object of the same type.
composition (of functions)
node
Priority Queue
keyword
35. 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.
slice
step size
command line
raise
36. An invisible marker that keeps track of where the next character will be printed.
composition
cursor
path
state diagram
37. Memory that can maintain its state without power. Hard drives and flash drives and rewritable compact disks (CD-RW) are examples of such memory.
preorder
comment
function call
non-volatile memory
38. A branch of the conditional statement in a recursive function that does not result in a recursive call.
immutable data type
base case
directory
attribute
39. A way of developing programs that involves high-level insight into the problem and more planning than incremental development or prototype development.
problem solving
planned development
default value
parse
40. An item of data contained in a node.
siblings
cargo
postfix
development plan
41. The rules that determine which member of a queue is removed next.
default value
list
modulus operator
queueing policy
42. To translate a program written in a high-level language into a low-level language all at once - in preparation for later execution.
cursor
algorithm
data structure
compile
43. A data type (usually a collection of objects) that is defined by a set of operations but that can be implemented in a variety of ways.
abstract data type (ADT)
debugging
functional programming style
list comprehension
44. An operation defined in linear algebra that multiplies two Points and yields a numeric value.
chained conditional
dot product
constant
body
45. A language that provides features - such as user-defined classes and inheritance - that facilitate object-oriented programming.
prototype development
event loop
newline
object-oriented language
46. A program that translates higher level programming languages into basic instructions the CPU can understand.
link
exception
nested list
compiler
47. A method for naming and accessing and organizing files and the data they contain.
compiler
composition (of functions)
parse
file system
48. An error that occurs at runtime.
exception
default value
variable
linear time
49. A programming language that is designed to be easy for humans to read and write.
link
aliases
FIFO(First In First Out)
high-level language
50. One of the nodes referred to by a node.
child
traceback
side effect
optional parameter