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 that can be identified at runtime as being a member of a class






2. A process that removes unwanted elements from a collection






3. Depth first search






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






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






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






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






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






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






10. Describes a though experiment or view of an entity






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






12. Describes a function that makes a new data structure but does not modify its arguments






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






14. A collection of values






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






16. A variable containing the address of other data






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






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






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






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






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






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






23. First-child/next-sibling






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






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






26. A pattern that describes a set of similar programs






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






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






29. Two variables that reference the same object






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






31. The next element in a linked list






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






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






34. Composed of individually named data fields






35. A type in which variables of that type are pointers to objects. in the code integer i = 3 - the variable i holds a pointer to the integer object that contains the value. in in j = 3 - the variable j contains the value. in java - only reference types






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






37. A case where a program calls itself






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






39. A node of a tree that has children






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






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






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






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






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






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






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






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






48. In a tree search - to move back from the node currently being examined to its parent






49. A case where tow data structures share some elements






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