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. To modify the order of a set of elements so that a desired ordering holds between them - e.g. alphabetic order






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






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






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






5. The process of collecting garbage for recycling






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






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






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






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






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






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






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






13. To hide similar items with the same name






14. Any container with linear ordering






15. In a search tree - the number of children of a given node. often - the branching factors of individual nodes will vary - so an average value may be used






16. Two variables that reference the same object






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






18. The next element in a linked list






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






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






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






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






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






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






25. A process that removes unwanted elements from a collection






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






27. Depth first search






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






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






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






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






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






33. A variable containing the address of other data






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






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






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






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






38. A node of a tree that has children






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






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






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






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






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






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






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






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






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






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






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






50. A case where a program calls itself