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. All nodes below a give node in a tree






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






3. A pointer to data






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






5. Two variables that reference the same object






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






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






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






9. To convert from a pointer to the data that is pointed to






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






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






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






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






14. A linked list in which the last element points back to the first element






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






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






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






18. A process that removes unwanted elements from a collection






19. A case where a program calls itself






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






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






22. Describes a function that makes a new data structure but does not modify its arguments






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






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






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






26. Any container with linear ordering






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






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






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






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






31. To hide similar items with the same name






32. Describes a though experiment or view of an entity






33. First-child/next-sibling






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. A contiguous block of memory containing elements of the same type - accessed by numeric index






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






37. A description of the state of a process such as a board game






38. First in first out: describes ordering of a queue






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






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






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






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






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






44. An item (or description of items) being sough in a search






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






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






47. Composed of individually named data fields






48. Composed of multiple sequential elements stored in contiguous bytes of memory






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






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