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 named sequence of statements that performs some useful operation. Functions may or may not take parameters and may or may not produce a result.






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






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






4. A variable in the sys module which stores a list of command line arguments passed to a program at run time.






5. The ability to define a new class that is a modified version of a previously defined class.






6. A loop inside the body of another loop.






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






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






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






10. Having no specific pattern. Unpredictable.






11. A function that calls itself recursively without ever reaching the base case - ultimately causes a runtime error.






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






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






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






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






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






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






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






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






20. An operator that takes two operands.






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






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






23. The set of operations that define an ADT.






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






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






26. A method that is not invoked directly by a caller but is used by another method to perform part of an operation.






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






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






29. A way of writing mathematical expressions with the operators after the operands.






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






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






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






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






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






35. A function that yields a return value.






36. A statement that causes the current iteration of a loop to end.






37. A data type in which the values are made up of components or elements that are themselves values.






38. The first part of a compound statement. Headers begin with a keyword and end with a colon (:)






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






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






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






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






43. A process for developing a program.






44. The class from which a child class inherits.






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






46. The structure of a program.






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






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






49. A distinct method of operation within a computer program.






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