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. In a tree search - to move back from the node currently being examined to its parent






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






3. A pattern that describes a set of similar programs






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






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






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






7. A case where tow data structures share some elements






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






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






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






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






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






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






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






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






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






17. A process that removes unwanted elements from a collection






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






19. Describes a though experiment or view of an entity






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






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






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






23. Two variables that reference the same object






24. To combine two ordered linear structures into one






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






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






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. The area of program text over which a variable can be referenced






29. To hide similar items with the same name






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






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






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






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






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






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






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






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






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






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






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






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






42. Any container with linear ordering






43. A case where a program calls itself






44. The next element in a linked list






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






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






47. The process of collecting garbage for recycling






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






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






50. A variable containing the address of other data