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 case where tow data structures share some elements






3. Two variables that reference the same object






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






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






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






7. To combine two ordered linear structures into one






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






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






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






11. A pattern that describes a set of similar programs






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






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






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






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






16. A process that removes unwanted elements from a collection






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






18. A queue implemented within an array - where the first elements of the array logically follows the last elements






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






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






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






22. A node of a tree that has children






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






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






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






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






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






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






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






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






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






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






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






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






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






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






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






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






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






40. A case where a program calls itself






41. The process of collecting garbage for recycling






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






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






44. Any container with linear ordering






45. A variable containing the address of other data






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






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






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






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






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