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 statement that causes the current iteration of a loop to end.






2. The meaning of a program.






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






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






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






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






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






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






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






10. An item of data contained in a node.






11. A name that refers to a value.






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






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






14. A combination of variables and operators and values that represents a single result value.






15. A set of characters that are treated as a unit for purposes of parsing such as the words in a natural language.






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






17. Given any real numbers a and b exactly one of the following relations holds: a < b or a > b or a = b. Thus when you can establish that two of the relations are false you can assume the remaining one is true. What is it called?






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






19. A style of program design in which the majority of functions are pure.






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






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






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






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






24. One of the pairs of items in a dictionary. Values are looked up in a dictionary by key.






25. A data type which can be modified.






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






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






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






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






30. Extending built-in operators ( + or - or * or > or < etc.) so that they work with user-defined types.






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






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






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






34. A process for developing a program.






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






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






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






38. An expression in parentheses that acts as a single operand in a larger expression.






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






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






41. Another name for a runtime error.






42. A programming language that is designed to be easy for humans to read and write.






43. A name given to a variable.






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






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






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






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






48. The set of operations that define an ADT.






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






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