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. Constructed of multiple components (simple or complex types)






3. Two variables that reference the same object






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






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






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






7. A pointer to data






8. A node of a tree that has children






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






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






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






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. o(n^2) - a problem whose solution requires a quadratic amount of time or space if the problem is of size n






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






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






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






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






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






19. To hide similar items with the same name






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






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






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






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






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






25. A collection of values






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






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






28. The next element in a linked list






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






30. The process of collecting garbage for recycling






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






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






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






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






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






36. Any container with linear ordering






37. A condition of the input data where the data will be handled by call(s) to the same program






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






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






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






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






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






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. Describes a function that makes a new data structure but does not modify its arguments






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






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






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






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






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