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. Describes a function that makes a new data structure but does not modify its arguments






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






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






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






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






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






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






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






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






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






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






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






13. First-child/next-sibling






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






15. A collection of values






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






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






18. Depth first search






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






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






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






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






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






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






25. To combine two ordered linear structures into one






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






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






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






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






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






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






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






33. A pattern that describes a set of similar programs






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






35. The next element in a linked list






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






37. A process that removes unwanted elements from a collection






38. A case where tow data structures share some elements






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






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






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






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






43. Any container with linear ordering






44. A variable containing the address of other data






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






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






47. Describes a function that modifies its arguments






48. The process of collecting garbage for recycling






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






50. 1. In lisp - the function that constructs a pair of points - or basic elements of list structure. 2. To make a cons data structure 2. a cons data structure