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. A classification of objects into a tree structure that groups related objects






3. A case where a program calls itself






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






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






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






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






8. A node of a tree that has children






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






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






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






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






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






14. A pointer to data






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






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






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






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






19. A process that removes unwanted elements from a collection






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






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






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






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






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






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






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






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






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






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






30. The area of program text over which a variable can be referenced






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






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






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






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






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






36. Describes a though experiment or view of an entity






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






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






39. Depth first search






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






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






42. All nodes below a give node in a tree






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






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






45. To hide similar items with the same name






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






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






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






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






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