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. Describes a function that modifies its arguments






2. A number that is defined as an object so that it has a runtime type and methods that can be used - e.g. Integer in Java






3. A node of a tree that has children






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






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






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






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






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






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






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






11. A linked list in which each elements has both forward and backward pointers






12. A collection of values






13. The area of program text over which a variable can be referenced






14. To hide similar items with the same name






15. 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?"






16. Composed of a collection of data values; implemented with a data structure






17. An order of processing a tree in which the parent node is processed before its children






18. The process of collecting garbage for recycling






19. A type in which variables of that type are pointers to objects. in the code integer i = 3 - the variable i holds a pointer to the integer object that contains the value. in in j = 3 - the variable j contains the value. in java - only reference types






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






21. All nodes below a give node in a tree






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






23. A variable containing the address of other data






24. A pattern that describes a set of similar programs






25. A case where tow data structures share some elements






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






27. o(n^2) - a problem whose solution requires a quadratic amount of time or space if the problem is of size n






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






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






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






31. An order of processing a tree in which the parent node is processed after its children






32. Any container with linear ordering






33. To combine two ordered linear structures into one






34. A pointer to data






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






36. Constructed of multiple components (simple or complex types)






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






38. An elements of a linked list - tree - or graph - often represented by a data structure






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






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






41. In a tree - the union of a node's parent and the parent's ancestors






42. Describes a though experiment or view of an entity






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






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






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






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






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






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






49. binary tree that is ordered such that each node has contents - and all of its left descendants are less than the contents - an all of its right descendants are greater than the contents






50. In a search tree - the number of children of a given node. often - the branching factors of individual nodes will vary - so an average value may be used