Test your basic knowledge |

Programming

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. The set of operations that define an ADT.






2. Memory that can maintain its state without power. Hard drives and flash drives and rewritable compact disks (CD-RW) are examples of such memory.






3. 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.






4. 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.






5. One of the values on which an operator operates.






6. A statement that executes a function. It consists of the name of the function followed by a list of arguments enclosed in parentheses.






7. a sequence of instructions that specifies to a computer actions and computations to be performed.






8. A step-by-step process for solving a category of problems.






9. A combination of variables and operators and values that represents a single result value.






10. To ________ a variable is to give it an initial value - usually in the context of multiple assignment.






11. 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.






12. A function which has no side effects. It only makes changes to the calling program through its return values.






13. An error in a program.






14. The topmost node in a tree with no parent.






15. A style of program design in which the majority of functions are pure.






16. A new class created by inheriting from an existing class; also called a subclass.






17. There are exactly two boolean values: True and False.






18. A syntactic construct which enables lists to be generated from other lists using a syntax analogous to the mathematical set-builder notation.






19. A set of instructions for solving a class of problems by a mechanical and unintelligent process.






20. An implementation of a queue using a linked list.






21. The set of nodes equidistant from the root.






22. The dot operator ( .) permits access to attributes and functions of a module.






23. An automatic procedure used to validate that individual units of code are working properly.






24. A way to traverse a tree - visiting each node before its children.






25. A statement that assigns a value to a name (variable).






26. The rules that determine which member of a queue is removed next.






27. A reference to a list node can be treated as a single object or as the first in a list of nodes.






28. One of the operators that combines boolean expressions: and or and not.






29. 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.






30. Temporary storage of a precomputed value to avoid redundant computation.






31. A variable used to store an intermediate value in a complex calculation.






32. A data type comprised of a collection of keys and associated values.






33. To examine a program and analyze the syntactic structure.






34. To simplify an expression by performing the operations in order to yield a single value.






35. One of the operators that compares two values: == or != or > or < or >= and <=.






36. The sequential accessing of each element in a list.






37. A language that provides features - such as user-defined classes and inheritance - that facilitate object-oriented programming.






38. To prevent an exception from terminating a program using the try and except statements.






39. The set of rules governing the order in which expressions involving multiple operators and operands are evaluated.






40. 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.






41. An error in a program that makes it impossible to parse






42. A function that returns a boolean value.






43. 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.






44. A name given to a variable.






45. Having no specific pattern. Unpredictable.






46. A named sequence of statements that performs some useful operation. Functions may or may not take parameters and may or may not produce a result.






47. A way of writing a mathematical expression with each operator appearing before its operands.






48. Another name for object code that is ready to be executed.






49. To follow the flow of execution of a program by hand - recording the change of state of the variables and any output produced.






50. An expression that is either true or false.