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. In a tree search - to move back from the node currently being examined to its parent






2. A case where a program calls itself






3. Any container with linear ordering






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






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






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






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






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






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






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






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






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






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






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






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






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






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






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






19. A pointer to data






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






21. A case where tow data structures share some elements






22. To hide similar items with the same name






23. A collection of values






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






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






26. Describes a function that modifies its arguments






27. A process that removes unwanted elements from a collection






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






29. A node of a tree that has children






30. Describes a though experiment or view of an entity






31. The process of collecting garbage for recycling






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






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






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






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. A description of the kinds of objects that exist in a computer program - e.g a Java class hierarchy






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






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






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






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






41. All nodes below a give node in a tree






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






43. Depth first search






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






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






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






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






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






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






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