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. Container for storing a collection of data in unique key/value pairs






2. A process that removes unwanted elements from a collection






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






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






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






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






7. A collection of values






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






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






10. The amount of space on the runtime stack required for execution of a program






11. The process of collecting garbage for recycling






12. A variable containing the address of other data






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






14. Describes a though experiment or view of an entity






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






16. A case where tow data structures share some elements






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






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






19. The next element in a linked list






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






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






22. Any container with linear ordering






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






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






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






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






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






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






29. Two variables that reference the same object






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






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






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






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






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






36. A node of a tree that has children






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






38. To hide similar items with the same name






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






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






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






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






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






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






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






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






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






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






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






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