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. A section of the runtime stack holding the values of all variables for one invocation






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






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






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






5. A collection of values






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






7. A contiguous block of memory containing elements of the same type - accessed by numeric index






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






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






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






11. Describes a function that modifies its arguments






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






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






14. The next element in a linked list






15. A case where a program calls itself






16. Separation of the properties of a data type from its implementation






17. All nodes below a give node in a tree






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






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






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






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






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






23. The process of collecting garbage for recycling






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






25. To hide similar items with the same name






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






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






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






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






30. A case where tow data structures share some elements






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






32. A node of a tree that has children






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






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






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






36. The top node of a tree - from which all other nodes can be reached






37. Depth first search






38. A data structure representing a sequence of items - which are removed in the same order as they were inserted.






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






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






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






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






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






44. Composed of individually named data fields






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






46. Two variables that reference the same object






47. A pointer to data






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






49. An extra record at the start or end of a data structure such as a linked list - to simplify processing






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