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. An organization of data for the purpose of making it easier to use.






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






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






4. A numerical value that does not change during the execution of a program.






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






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






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.






8. A numerical result that is too large to be represented in a numerical format.






9. To divide a large complex program into components (like functions) and isolate the components from each other (by using local variables - for example).






10. The set of operations that define an ADT.






11. A number or string (or other things to be named later) that can be stored in a variable or computed in an expression.






12. A statement or group of statements that execute repeatedly until a terminating condition is satisfied.






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






14. A name given to a variable.






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






16. Any of the characters that move the cursor without printing visible characters. The constant string.whitespace contains all the white-space characters.






17. The node that refers to a given node.






18. Part of a program that can never be executed - often because it appears after a return statement.






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






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






21. A situation in which two or more names in a given namespace cannot be unambiguously resolved.






22. One program structure within another - such as a conditional statement inside a branch of another conditional statement.






23. A general process for solving a category of problems.






24. The ability to combine simple expressions and statements into compound statements and expressions in order to represent complex computations concisely.






25. A statement that creates a new function specifying its name and parameters and the statements it executes.






26. A collection of key-value pairs that maps from keys to values.






27. To replace something unnecessarily specific (like a constant value) with something appropriately general (like a variable or parameter). It makes code more versatile - more likely to be reused and sometimes even easier to write.






28. A way of developing programs starting with a prototype and gradually testing and improving it.






29. To translate a program written in a high-level language into a low-level language all at once - in preparation for later execution.






30. A program stored in a file (usually one that will be interpreted).






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






32. A graphical representation of a set of variables and the values to which they refer.






33. An operator denoted with a percent sign ( %) - that works on integers and yields the remainder when one number is divided by another.






34. A method that is not invoked directly by a caller but is used by another method to perform part of an operation.






35. A function which changes its arguments inside the function body. Only mutable types can be changed by modifiers.






36. An error that occurs at runtime.






37. The statement in a recursive function with is a call to itself.






38. A group of consecutive statements with the same indentation.






39. An expression that is either true or false.






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






41. A function that can operate on more than one type. If all the operations in a function can be applied to a type then the function can be applied to a type.






42. An item of data contained in a node.






43. To represent one set of values using another set of values by constructing a mapping between them.






44. A data type in which the elements can be modified. It is a compound type - e.g. lists.






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






46. A special character that causes the cursor to move to the beginning of the next line.






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






48. Code that is used during program development but is not part of the final version.






49. The process of finding and removing any of the three kinds of programming errors.






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