Test your basic knowledge |

Data Structures

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. The area of program text over which a variable can be referenced






2. To answer the question - "If the algorithm is run several times - what is the average time per run - given the worst possible sequence of runs?"






3. A data structure that implements a complete binary tree within an array - such that every parent node has a value that is less than the value of either of its children






4. A sequence of clear and precise step-by-step instructions for solving a problem in a finite amount of time






5. A stack containing a stack frame of variable value for each active invocation of procedure






6. Values are in the most basic form and cannot be decomposed into smaller parts






7. In a tree search - to move back from the node currently being examined to its parent






8. A queue implemented within an array - where the first elements of the array logically follows the last elements






9. A condition of the input data where the data will be handled by call(s) to the same program






10. A simple case that can be solved easily - without recursion






11. Any container with linear ordering






12. A section of the runtime stack holding the values of all variables for one invocation






13. A tree node containing a contents value but with no children






14. To modify the order of a set of elements so that a desired ordering holds between them - e.g. alphabetic order






15. Use of a function or method without knowing how it's accomplished






16. Composed of individually named data fields






17. A given collection of values along with a collection of operations for use on those values






18. A pointer to the next element in a linked list






19. Last in first out: describes the order of a stack






20. A runtime error that occurs when an operation such as method call is attempted on a null pointer






21. An abstracted function that describes the amount of computer time or memory space required by an algorithm - as a function of problem size. for problems larger than a certain size - the actual time or space required will be less than the Big O multip






22. A problem that is so hard that it cannot be solved unless the problem is small






23. A classification of objects into a tree structure that groups related objects






24. storage that is no longer pointed to by any variable and therefore can no longer be accessed






25. A case where a program calls itself






26. A description of the kinds of objects that exist in a computer program - e.g a Java class hierarchy






27. A problem-solving strategy in which a problem is broken down into sub-problems - until simple subproblems are reached






28. A function whose value either does not involve a recursive call - or is exactly the value of a recursive call






29. A description of operations on a data type that could have multiple possible implementations






30. Describes a function that modifies its arguments






31. In a tree - a node that points to a given node






32. The number of links between the root of a tree and the leaves






33. In object oriented programming - a description of a set of similar objects






34. 1. In lisp - the function that constructs a pair of points - or basic elements of list structure. 2. To make a cons data structure 2. a cons data structure






35. Given two sets -the union is the set of elements that are members of either set






36. Implementation of complex ADTs. Physical representation of how data is stored - organized - and manipulated






37. Any effect of a procedure other than returning a value - e.g. printing or modifying a data structure






38. A data structure that can be identified at runtime as being a member of a class






39. A list of pairs - where each pair has a key and a value associated with the key






40. In a search tree - a program that changes a state into a child state e.g a move in a game






41. A formal description of a language in terms of vocabulary and rules for writing phrases and sentences






42. Give two sets - the set difference is the set of elements of the first set that are not members of the second set






43. The process of collecting garbage for recycling






44. Describes a data structure that cannot be changed once it has been created - such as Integer or String in Java






45. A pointer to data






46. A collection of objects that are inserted and removed according to the LIFO principle






47. Given two sets - the intersection is the set of elements that are members of both sets






48. In a tree - a node pointed to by a parent node






49. To look through a data structure until a goal object is found






50. A search in which children of a node are considered before siblings are considered