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 queueing policy in which the first member to arrive is the first to be removed.






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






3. An explicit statement that takes a value of one type and computes a corresponding value of another type.






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






5. An element of a list - usually implemented as an object that contains a reference to another object of the same type.






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






7. A thing to which a variable can refer.






8. The block of statements in a compound statement that follows the header.






9. A linked list with a single node.






10. One of the possible paths of the flow of execution determined by conditional execution.






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






12. A reference stored in an attribute of an object.






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






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






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






16. A character or string used to indicate where a string should be split.






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






18. An assignment to all of the elements in a tuple using a single assignment statement. Useful for swapping values.






19. 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?






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






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






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






23. A function that is defined inside a class definition and is invoked on instances of that class. :override:: To replace a default. Examples include replacing a default parameter with a particular argument and replacing a default method by providing a






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






25. A way to traverse a tree - visiting the children of each node before the node itself.






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






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






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






29. The code (or the person who wrote it) that implements an ADT.






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






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






32. Generalization by reducing the information content of a concept.






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






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






35. A parameter written in a function header with an assignment to a default value which it will receive if no corresponding argument is given for it in the function call.






36. A statement that assigns a value to a name (variable).






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






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






39. To ________ a variable is to give it an initial value - usually in the context of multiple assignment.






40. A bottom-most node in a tree with no children.






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






42. A signal such as a keyboard press or mouse click or message from another program.






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






44. To represent one set of values using another set of values by constructing a mapping between them.






45. A name that refers to a value.






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






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






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






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






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