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






2. The next element in a linked list






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






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






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






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






7. Depth first search






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






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






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






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






12. The process of collecting garbage for recycling






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






14. A pointer to data






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






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






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






18. All nodes below a give node in a tree






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






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






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






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






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






24. A case where a program calls itself






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






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






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






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






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






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






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






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






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






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






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






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






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






38. A node of a tree that has children






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






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






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






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






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






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






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






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






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






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






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






50. First-child/next-sibling