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. First in first out: describes ordering of a queue






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






3. First-child/next-sibling






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






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






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






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






8. Describes a function that modifies its arguments






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






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






11. The next element in a linked list






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






13. Two variables that reference the same object






14. A variable containing the address of other data






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






16. Describes a data structure or device in which all accesses have the same cost - O(1)






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






18. A case where tow data structures share some elements






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






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






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






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






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






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






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






26. Describes a though experiment or view of an entity






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






28. Depth first search






29. To hide similar items with the same name






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






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






32. Any container with linear ordering






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






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






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






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






37. The process of collecting garbage for recycling






38. A collection of values






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






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






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






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






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






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






45. A pattern that describes a set of similar programs






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






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






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






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






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