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 named collection of objects where each object is identified by an index.






2. A data type which cannot be modified. Assignments to elements or slices of immutable types cause a runtime error.






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






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






5. The value given to an optional parameter if no argument for it is provided in the function call.






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






7. An assertion that should be true of an object at all times (except perhaps while the object is being modified).






8. A sequence of one or more characters used to specify the boundary between separate parts of text.






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






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






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






12. The first part of a compound statement. Headers begin with a keyword and end with a colon (:)






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






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






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






16. An error in a program that makes it do something other than what the programmer intended.






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






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






19. A special character that causes the cursor to move to the next tab stop on the current line.






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






21. A programming language that is designed to be easy for a computer to execute; also called machine language or assembly language.






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






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






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






25. A data structure that implements a collection using a sequence of linked nodes.






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






27. A file that contains printable characters organized into lines separated by newline characters.






28. A way of developing programs that involves high-level insight into the problem and more planning than incremental development or prototype development.






29. Decrease by 1.






30. A way of writing mathematical expressions with the operators after the operands.






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






32. Code that satisfies the syntactic and semantic requirements of an interface.






33. Nodes that share a common parent.






34. The ability to define a new class that is a modified version of a previously defined class.






35. An explicit statement that takes a value of one type and computes a corresponding value of another type.






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






37. A branch of the conditional statement in a recursive function that does not result in a recursive call.






38. The value provided as the result of a function call.






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






40. An error in a program.






41. An integer variable or value that indicates an element of a list.






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






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






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






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






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






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






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






49. A program in a high-level language before being compiled.






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