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 programming construct that waits for events and processes them.






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






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






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






5. The name and location of a file within a file system.






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






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






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






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






10. To create an instance of a class.






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






12. A variable or value used to select a member of an ordered set - such as a character from a string.






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






14. A conditional branch with more than two possible flows of execution.






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






16. A function that changes one or more of the objects it receives as parameters. Most modifiers are void.






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






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






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






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






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






22. An automatic procedure used to validate that individual units of code are working properly.






23. Information in a program that is meant for other programmers (or anyone reading the source code) and has no effect on the execution of the program.






24. A variable used to store an intermediate value in a complex calculation.






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






26. A character that is used to separate tokens such as punctuation in a natural language.






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






28. One of the named data items that makes up an instance.






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






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






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






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






33. Code that is used during program development but is not part of the final version.






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






35. A reference to a list node can be treated as a single object or as the first in a list of nodes.






36. A data type (usually a collection of objects) that is defined by a set of operations but that can be implemented in a variety of ways.






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






38. To create a new object that has the same value as an existing object.






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






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






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






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






43. A string constant on the first line of a function or module definition - they provide a convenient way to associate documentation with code.






44. A way of writing a mathematical expression with each operator appearing before its operands.






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






46. An escape character '' followed by one or more printable characters used to designate a nonprintable character.






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






48. A linked list with a single node.






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






50. A statement or group of statements that execute repeatedly until a terminating condition is satisfied.