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 collection of values






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






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






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






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






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






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






8. First-child/next-sibling






9. Composed of individually named data fields






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






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






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






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






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






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






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






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






18. The next element in a linked list






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






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






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 after its children






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






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






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






26. Depth first search






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






28. A pattern that describes a set of similar programs






29. A case where tow data structures share some elements






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






31. Any container with linear ordering






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






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






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






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






36. A case where a program calls itself






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






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






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






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






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






42. A pointer to data






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






44. A runtime error that occurs when an operation such as method call is attempted on a null pointer






45. The process of collecting garbage for recycling






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 linked list in which the last element points back to the first element






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






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






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