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 top node of a tree - from which all other nodes can be reached






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






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






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






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






6. A pattern that describes a set of similar programs






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






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






9. Describes a function that modifies its arguments






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






11. A pointer to data






12. Describes a though experiment or view of an entity






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






14. First-child/next-sibling






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






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






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






18. All nodes below a give node in a tree






19. An ordering that can be guaranteed to terminate - e.g. starting at a positive integer and counting down






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






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






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






23. The amount of space on the runtime stack required for execution of a program






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






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






26. Container for storing a collection of data in unique key/value pairs






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






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






29. To hide similar items with the same name






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






31. Two variables that reference the same object






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






33. A sequence of records - where each record contains a link to the next one






34. A collection of values






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






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






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






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






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






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






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






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






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






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






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






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






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






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






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






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