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. All nodes below a give node in a tree






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






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






4. A process that removes unwanted elements from a collection






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






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






7. The process of collecting garbage for recycling






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






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






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






11. A collection of values






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






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






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






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






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






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






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






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






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






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






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






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






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






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






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






27. Describes a function that modifies its arguments






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






29. Two variables that reference the same object






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






31. An extra record at the start or end of a data structure such as a linked list - to simplify processing






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






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






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






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






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






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






38. A pointer to data






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






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






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






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






43. A variable containing the address of other data






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






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






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






47. Any container with linear ordering






48. First-child/next-sibling






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






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