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 visual cue that tells the user to input data.






2. A function that returns a boolean value.






3. A collection of key-value pairs that maps from keys to values.






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






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






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






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






8. One of the values in a list (or other sequence). The bracket operator selects elements of a list.






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






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






11. A function that yields a return value.






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






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






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






15. A statement that controls the flow of execution depending on some condition.






16. The statement in a recursive function with is a call to itself.






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






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






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






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






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






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






23. A named entity - usually stored on a hard drive or floppy disk or CD-ROM - that contains a stream of characters.






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






25. A list of the functions that are executing - printed when a runtime error occurs. Also commonly refered to as a stack trace since it lists the functions in the order in which they are stored in the runtime stack.






26. The process of formulating a problem and finding a solution and expressing the solution.






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






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






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






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






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






32. An organization of data for the purpose of making it easier to use.






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






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






35. A compound data type whose elements cannot be assigned new values.






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






37. The interval between successive elements of a linear sequence. The third (and optional argument) to the range function is called the step size. If not specified it defaults to 1.






38. An error that occurs at runtime.






39. A method for naming and accessing and organizing files and the data they contain.






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






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






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






43. A name that refers to a value.






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






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






46. Using the output from one function call as the input to another.






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






48. An intermediate language between source code and object code. Many modern languages first compile source code into byte code and then interpret the byte code with a program called a virtual machine.






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






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