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. The next element in a linked list






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






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






4. Any container with linear ordering






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






6. Two variables that reference the same object






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






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






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






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






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






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






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






14. A variable containing the address of other data






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






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






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






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






19. Describes a function that modifies its arguments






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






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






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






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






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






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






26. A case where tow data structures share some elements






27. Composed of individually named data fields






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






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






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






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






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






33. A process that removes unwanted elements from a collection






34. Implementation of complex ADTs. Physical representation of how data is stored - organized - and manipulated






35. Describes a though experiment or view of an entity






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






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






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






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






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






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






42. Use of a function or method without knowing how it's accomplished






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






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






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






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






47. A node of a tree that has children






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






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






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