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. A recursive call that occurs as the last statement (at the tail) of a function definition.






2. To iterate through the elements of a set performing a similar operation on each.






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






4. It prevents a compiler from compiling.






5. A process for developing a program.






6. Calling one function from within the body of another or using the return value of one function as an argument to the call of another.






7. A signal such as a keyboard press or mouse click or message from another program.






8. A way to traverse a tree - visiting the left subtree and then the root and then the right subtree.






9. The order in which statements are executed during a program run.






10. The process of adding a function header and parameters to a sequence of program statements. This process is very useful whenever the program statements in question are going to be used multiple times.






11. Any one of the languages that people speak that evolved naturally.






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






13. An expression in parentheses that acts as a single operand in a larger expression.






14. A data type in which the values are made up of components or elements that are themselves values.






15. A way of writing mathematical expressions with the operators between the operands.






16. A program development plan intended to avoid debugging by adding and testing only a small amount of code at a time.






17. An operation whose runtime is a linear function of the size of the data structure.






18. An expression that is either true or false.






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






20. The output of the compiler after it translates the program.






21. A special method that is invoked automatically when a new object is created and that initializes the object's attributes.






22. A tree in which each node refers to zero or one or two dependent nodes.






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






24. A list that is an element of another list.






25. An error that does not occur until the program has started to execute but that prevents the program from continuing.






26. A visual cue that tells the user to input data.






27. An operation defined in linear algebra that multiplies each of the coordinates of a Point by a numeric value.






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






29. A loop in which the terminating condition is never satisfied.






30. A software development practice which arrives at a desired feature through a series of small but iterative steps motivated by automated tests which are written first that express increasing refinements of the desired feature.






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






32. A statement which makes the objects contained in a module available for use within another module.






33. A reference stored in an attribute of an object.






34. A reserved word that is used by the compiler to parse program; you cannot use keywords like if or def or while as variable names.






35. Use of the dot operator '.' to access functions inside a module.






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






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






38. One of the basic elements of the syntactic structure of a program - analogous to a word in a natural language.






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






40. A programming construct that waits for events and processes them.






41. A character or string used to indicate where a string should be split.






42. A box in a stack diagram that represents a function call. It contains the local variables and parameters of the function.






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






44. The structure of a program.






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






46. Another name for a runtime error.






47. A set of values. The type of a value determines how it can be used in expressions. So far the types you have seen are integers (type int) and floating-point numbers (type float) and strings (type str).






48. A name given to a variable.






49. A name that refers to a value.






50. A data item that is mapped to a value in a dictionary. Used to look up values in a dictionary.