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. A collection of values






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






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






4. A process that removes unwanted elements from a collection






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






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






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






8. Container for storing a collection of data in unique key/value pairs






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






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






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






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






13. Constructed of multiple components (simple or complex types)






14. A pattern that describes a set of similar programs






15. The next element in a linked list






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






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






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






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






20. All nodes below a give node in a tree






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






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






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






24. A pointer to data






25. A variable containing the address of other data






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






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






28. Describes a function that modifies its arguments






29. The process of collecting garbage for recycling






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






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






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






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






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






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






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






37. Two variables that reference the same object






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 data structure that can be identified at runtime as being a member of a class






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






41. Composed of a collection of data values; implemented with a data structure






42. A case where tow data structures share some elements






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






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






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






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






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






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






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






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