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 search tree - a program that changes a state into a child state e.g a move in a game






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






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






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






5. A case where tow data structures share some elements






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






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






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






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






10. Describes a though experiment or view of an entity






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






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






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






14. A variable containing the address of other data






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






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






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






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






19. Depth first search






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






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






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






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






24. Two variables that reference the same object






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






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






27. The next element in a linked list






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






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






30. A node of a tree that has children






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






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






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






34. To hide similar items with the same name






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






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






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






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






39. First-child/next-sibling






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






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






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






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






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






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






46. A case where a program calls itself






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






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






49. A pointer to data






50. A process that removes unwanted elements from a collection