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 formal description of a language in terms of vocabulary and rules for writing phrases and sentences






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






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






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






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. An extra record at the start or end of a data structure such as a linked list - to simplify processing






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






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






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






10. A node of a tree that has children






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






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






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






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






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






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






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






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






19. A case where a program calls itself






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






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






22. Describes a function that modifies its arguments






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






24. All nodes below a give node in a tree






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






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






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






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






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






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






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






32. Any container with linear ordering






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






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






35. To hide similar items with the same name






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






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






38. A collection of values






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






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






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






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






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






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






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






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






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






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






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






50. A pointer to data