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 program in a high-level language before being compiled.






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






3. A special symbol that represents a simple computation like addition or multiplication or string concatenation.






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






5. A program that translates higher level programming languages into basic instructions the CPU can understand.






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






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






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






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






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






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






12. An operation whose runtime does not depend on the size of the data structure.






13. A function that calls itself recursively without ever reaching the base case - ultimately causes a runtime error.






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






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






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






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






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






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






20. A method that acts as a middleman between a caller and a helper method - often making the method easier or less error-prone to invoke.






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






22. A name used inside a function to refer to the value passed as an argument.






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






24. The node that refers to a given node.






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






26. One of the nodes referred to by a node.






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






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






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






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






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 statement that controls the flow of execution depending on some condition.






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






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






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






36. Nodes that share a common parent.






37. A data type which can be modified.






38. A change in the state of a program made by calling a function that is not a result of reading the return value from the function. Can only be produced by modifiers.






39. A part of a string (substring) specified by a range of indices.






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






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






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






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






44. 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).






45. A distinct method of operation within a computer program.






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






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






48. The process of calling the function that is currently executing.






49. Function-like attribute of an object. Methods are invoked (called) on an object using the dot operator.






50. A property of a program that can run on more than one kind of computer.