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. A data structure representing a sequence of items - which are removed in the same order as they were inserted.






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






3. The process of collecting garbage for recycling






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






5. To combine two ordered linear structures into one






6. The next element in a linked list






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






8. To hide similar items with the same name






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






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






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






12. Composed of individually named data fields






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






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






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






16. A collection of values






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






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






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






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






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






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. storage that is no longer pointed to by any variable and therefore can no longer be accessed






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






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






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






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






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






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






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






31. Describes a though experiment or view of an entity






32. A case where tow data structures share some elements






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






34. A sequence of clear and precise step-by-step instructions for solving a problem in a finite amount of time






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






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






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






38. A node of a tree that has children






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






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






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






42. Describes a function that modifies its arguments






43. Two variables that reference the same object






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






45. First-child/next-sibling






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






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






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






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






50. Composed of a collection of data values; implemented with a data structure