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 - the number of children of a given node. often - the branching factors of individual nodes will vary - so an average value may be used






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






3. A variable containing the address of other data






4. To combine two ordered linear structures into one






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






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






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






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. Give two sets - the set difference is the set of elements of the first set that are not members of the second set






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






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






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






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






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






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






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






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






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






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






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






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






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






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






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






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






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






27. Describes a function that modifies its arguments






28. A section of the runtime stack holding the values of all variables for one invocation






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






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






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






32. A pattern that describes a set of similar programs






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






34. To hide similar items with the same name






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






36. A node of a tree that has children






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






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






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






41. A process that removes unwanted elements from a collection






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






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






44. A case where tow data structures share some elements






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






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






47. First-child/next-sibling






48. Two variables that reference the same object






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






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