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






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






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






4. Memory that can maintain its state without power. Hard drives and flash drives and rewritable compact disks (CD-RW) are examples of such memory.






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






6. An error that occurs at runtime.






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






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






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






10. A string displayed by a command line interface indicating that commands can be entered.






11. To divide a large complex program into components (like functions) and isolate the components from each other (by using local variables - for example).






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






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






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






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






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






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






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






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






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






21. The set of operations that define an ADT.






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






23. A thing to which a variable can refer.






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






25. A name that refers to a value.






26. The second part of a compound statement. The body consists of a sequence of statements all indented the same amount from the beginning of the header.






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






28. A way of developing programs starting with a prototype and gradually testing and improving it.






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






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






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






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






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






34. The node that refers to a given node.






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






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






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






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






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






40. A function that returns a boolean value.






41. The sequential accessing of each element in a list.






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






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






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






45. The value provided as the result of a function call.






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






47. A data type which cannot be modified. Assignments to elements or slices of immutable types cause a runtime error.






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






49. A function that yields a return value.






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