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






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






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






4. Describes a function that modifies its arguments






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






6. An item (or description of items) being sough in a search






7. To hide similar items with the same name






8. All nodes below a give node in a tree






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






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






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






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






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






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






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






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






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






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






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






20. A case where a program calls itself






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






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






23. Composed of individually named data fields






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






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






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






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






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






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






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






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






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






33. To combine two ordered linear structures into one






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






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






36. A pattern that describes a set of similar programs






37. A case where tow data structures share some elements






38. A pointer to data






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






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






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






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






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






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






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






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






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






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






49. A collection of values






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