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 boolean expression in a conditional statement that determines which branch is executed.






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






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






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






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






6. A name that refers to a value.






7. A queueing policy in which each member has a priority determined by external factors. The member with the highest priority is the first to be removed.






8. A style of programming in which data and the operations that manipulate it are organized into classes and methods.






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






10. An operation that divides one integer by another and yields an integer. Integer division yields only the whole number of times that the numerator is divisible by the denominator and discards any remainder.






11. The statements inside a loop.






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






13. A graphical representation of a stack of functions and their variables and the values to which they refer.






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






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






16. An embedded reference used to link one object to another.






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






18. A variable used as part of the terminating condition of a loop.






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






20. To execute a program in a high-level language by translating it one line at a time.






21. An assertion that must be true in order for a method to work correctly.






22. A bottom-most node in a tree with no children.






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






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






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






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






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






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






29. A variable defined inside a function. A local variable can only be used inside its function.






30. A compound data type that is often used to model a thing or concept in the real world.






31. A value provided to a function when the function is called. This value is assigned to the corresponding parameter in the function.






32. A named collection of objects where each object is identified by an index.






33. An ADT that performs the operations one might perform on a queue.






34. To join two strings end-to-end.






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






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






37. A statement that causes the current iteration of a loop to end.






38. Memory which requires an electrical current to maintain state. Information stored is lost when the computer is turned off.






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






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






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






42. The node that refers to a given node.






43. A data type which can be modified.






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






45. A definition which defines something in terms of itself. It often provides an elegant way to express complex data structures.






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






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






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






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






50. A function that does not modify any of the objects it receives as parameters. Most pure functions are fruitful.