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. Give two sets - the set difference is the set of elements of the first set that are not members of the second set






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






3. First-child/next-sibling






4. A case where a program calls itself






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






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






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






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






9. All nodes below a give node in a tree






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






11. A collection of values






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. Implementation of complex ADTs. Physical representation of how data is stored - organized - and manipulated






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






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






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






17. A section of the runtime stack holding the values of all variables for one invocation






18. A problem whose solution requires a linear amount of time or space if the problem is size n






19. Describes a function that modifies its arguments






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






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






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






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






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






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






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






27. Any container with linear ordering






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






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






30. A collection of objects that are inserted and removed according to the LIFO principle






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






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






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






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






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






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






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






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






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






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






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






42. A variable containing the address of other data






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






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






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






46. A case where tow data structures share some elements






47. Depth first search






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






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






50. To hide similar items with the same name