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 first part of a compound statement. Headers begin with a keyword and end with a colon (:)






2. A recursive call that occurs as the last statement (at the tail) of a function definition.






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






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






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






6. An ordered set of objects waiting for a service of some kind.






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






8. A user-defined compound type. A class can also be thought of as a template for the objects that are instances of it.






9. A program (or the person who wrote it) that uses an ADT.






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






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






12. Both as a noun and as a verb - it means to increase by 1.






13. An item of data contained in a node.






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






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






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






17. A syntactic container providing a context for names so that the same name can reside in different namespaces without ambiguity.






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






19. Any of the data types that consist of an ordered set of elements with each element identified by an index.






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






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






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






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






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






25. The set of operations that define an ADT.






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






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






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






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






30. A variable used in a loop to accumulate a series of values - such as by concatenating them onto a string or adding them to a running sum.






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






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






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






34. An ADT that defines the operations one might perform on a priority queue.






35. A statement that consists of two parts: header - which begins with a keyword determining the statement type and ends with a colon. body - containing one or more statements indented the same amount from the header.






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






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






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






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






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






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






42. The boolean expression in a conditional statement that determines which branch is executed.






43. An expression that is either true or false.






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






45. Repeated execution of a set of programming statements.






46. A thing to which a variable can refer.






47. A queueing policy in which the first member to arrive is the first to be removed.






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






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






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