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. Composed of individually named data fields






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






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






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






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






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






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






8. A pointer to data






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






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






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






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






13. Depth first search






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






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






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






17. The process of collecting garbage for recycling






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






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






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






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






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






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






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






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






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






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






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






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






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






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






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






33. Describes a though experiment or view of an entity






34. Any container with linear ordering






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






36. A variable containing the address of other data






37. A collection of values






38. To combine two ordered linear structures into one






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






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






41. A case where a program calls itself






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






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






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






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






46. To hide similar items with the same name






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






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






49. The next element in a linked list






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