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 process for developing a program.






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






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






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






5. A syntactic container providing a context for names so that the same name can reside in different namespaces without ambiguity.






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






7. A part of a string (substring) specified by a range of indices.






8. The class from which a child class inherits.






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






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






11. A special character that causes the cursor to move to the beginning of the next line.






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






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






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






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






16. A kind of data structure that can contain data of any type.






17. The set of operations that define an ADT.






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






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






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






21. It prevents a compiler from compiling.






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






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






24. The boolean expression in a conditional statement that determines which branch is executed.






25. An ordered set of objects waiting for a service of some kind.






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






27. The set of nodes equidistant from the root.






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






29. A function that yields a return value.






30. A sequence of one or more characters used to specify the boundary between separate parts of text.






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






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






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. An element of a list - usually implemented as an object that contains a reference to another object of the same type.






35. A style of programming in which data and the operations that manipulate it are organized into classes and methods.






36. A way to traverse a tree - visiting each node before its children.






37. A group of consecutive statements with the same indentation.






38. A method that acts as a middleman between a caller and a helper method - often making the method easier or less error-prone to invoke.






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






40. The value given to an optional parameter if no argument for it is provided in the function call.






41. An invisible marker that keeps track of where the next character will be printed.






42. An ADT that performs the operations one might perform on a queue.






43. A branch of the conditional statement in a recursive function that does not result in a recursive call.






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






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






46. A linked list with a single node.






47. A way of writing mathematical expressions with the operators between the operands.






48. A compound data type that is often used to model a thing or concept in the real world.






49. A statement that controls the flow of execution depending on some condition.






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