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 data structure that cannot be changed once it has been created - such as Integer or String in Java






2. All nodes below a give node in a tree






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






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






5. Depth first search






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






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






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






9. To combine two ordered linear structures into one






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






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






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






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






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






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






16. First-child/next-sibling






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






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






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






20. A condition of the input data where the data will be handled by call(s) to the same program






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






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






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






24. A case where tow data structures share some elements






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






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






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






28. A node of a tree that has children






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






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






31. The process of collecting garbage for recycling






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






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






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






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






36. A pointer to data






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






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






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






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






41. A collection of values






42. Describes a function that modifies its arguments






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






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






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






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






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






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






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






50. Given two sets -the union is the set of elements that are members of either set