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. Given two sets -the union is the set of elements that are members of either set






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






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






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






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






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






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






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






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






10. To answer the question - "If the algorithm is run several times - what is the average time per run - given the worst possible sequence of runs?"






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






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






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






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






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






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






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






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






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






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






21. A variable containing the address of other data






22. A collection of values






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






24. Two variables that reference the same object






25. To hide similar items with the same name






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






27. A list of pairs - where each pair has a key and a value associated with the key






28. A case where tow data structures share some elements






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






30. The next element in a linked list






31. A pointer to data






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






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






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






35. Any container with linear ordering






36. The process of collecting garbage for recycling






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






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






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






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






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






42. A node of a tree that has children






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






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






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






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






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






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






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






50. A process that removes unwanted elements from a collection