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






2. A variable used to count something - usually initialized to zero and incremented in the body of a loop.






3. Calling one function from within the body of another or using the return value of one function as an argument to the call of another.






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






5. Nodes that share a common parent.






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






7. A new class created by inheriting from an existing class; also called a subclass.






8. A way to traverse a tree - visiting the left subtree and then the root and then the right subtree.






9. The sequence of characters read into the command interpreter in a command line interface.






10. One of the operators that compares two values: == or != or > or < or >= and <=.






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






12. An operation that divides one integer by another and yields an integer. Integer division yields only the whole number of times that the numerator is divisible by the denominator and discards any remainder.






13. It prevents a compiler from compiling.






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






15. A numerical result that is too large to be represented in a numerical format.






16. A thing to which a variable can refer.






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






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






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






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






21. To examine a program and analyze the syntactic structure.






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






23. One program structure within another - such as a conditional statement inside a branch of another conditional statement.






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






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






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






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






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






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






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






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






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






33. An item of data contained in a node.






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






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






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






37. a sequence of instructions that specifies to a computer actions and computations to be performed.






38. A name that refers to a value.






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






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






41. The statements inside a loop.






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






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






44. An error in a program that makes it do something other than what the programmer intended.






45. One of the values on which an operator operates.






46. A named sequence of statements that performs some useful operation. Functions may or may not take parameters and may or may not produce a result.






47. Making more than one assignment to the same variable during the execution of a program.






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






49. An operator denoted with a percent sign ( %) - that works on integers and yields the remainder when one number is divided by another.






50. An implementation of a queue using a linked list.