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 process of collecting garbage for recycling






2. To hide similar items with the same name






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






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






5. A case where tow data structures share some elements






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






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






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






9. A process that removes unwanted elements from a collection






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






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






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






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






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






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






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






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






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






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






20. A pointer to data






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






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






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






24. Composed of individually named data fields






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






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






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






28. The amount of space on the runtime stack required for execution of a program






29. A case where a program calls itself






30. The next element in a linked list






31. All nodes below a give node in a tree






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






33. A node of a tree that has children






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






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






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






37. First-child/next-sibling






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






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






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






41. Any container with linear ordering






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






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






44. To answer the question - "If the algorithm is run several times - what is the average time per run - given the worst possible sequence of runs?"






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






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






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






48. A variable containing the address of other data






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






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