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. o(n^2) - a problem whose solution requires a quadratic amount of time or space if the problem is of size n






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






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






5. The next element in a linked list






6. A pointer to data






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






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






9. To hide similar items with the same name






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






11. Depth first search






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






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






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






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






16. A collection of objects that are inserted and removed according to the LIFO principle






17. A stack containing a stack frame of variable value for each active invocation of procedure






18. The process of collecting garbage for recycling






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






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






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






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






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






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






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






26. Two variables that reference the same object






27. A description of the state of a process such as a board game






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






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






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






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






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






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






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






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






36. Any container with linear ordering






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






38. Composed of individually named data fields






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






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






41. A node of a tree that has children






42. A queue implemented within an array - where the first elements of the array logically follows the last elements






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






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






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






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






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






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






49. Describes a though experiment or view of an entity






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