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. Last in first out: describes the order of a stack






2. A process that removes unwanted elements from a collection






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






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






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






6. First-child/next-sibling






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






8. The process of collecting garbage for recycling






9. A collection of values






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






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






12. Composed of individually named data fields






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






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






15. The next element in a linked list






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






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






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






19. A pointer to data






20. A pattern that describes a set of similar programs






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






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






23. Depth first search






24. A case where tow data structures share some elements






25. Describes a data structure that cannot be changed once it has been created - such as Integer or String in Java






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






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






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






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






30. Describes a function that modifies its arguments






31. A stack containing a stack frame of variable value for each active invocation of procedure






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






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






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






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






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






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






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






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






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






41. A node of a tree that has children






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






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






44. To hide similar items with the same name






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






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






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






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






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






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