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. An order of processing a tree in which the parent node is processed in between its children






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






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






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






5. Any container with linear ordering






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






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






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






9. A case where tow data structures share some elements






10. Describes a though experiment or view of an entity






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






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






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






14. Depth first search






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






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






17. To hide similar items with the same name






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






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






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






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






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






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






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






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






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






27. A collection of values






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






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






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






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






32. All nodes below a give node in a tree






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






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






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






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






37. A pointer to data






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






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






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






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






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






43. A case where a program calls itself






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






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






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






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






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






49. First-child/next-sibling






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