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






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






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






4. To combine two ordered linear structures into one






5. Describes a function that makes a new data structure but does not modify its arguments






6. All nodes below a give node in a tree






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






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






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






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






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






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






13. Describes a function that modifies its arguments






14. The next element in a linked list






15. Depth first search






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






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






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






19. Describes a though experiment or view of an entity






20. A node of a tree that has children






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






22. A variable containing the address of other data






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






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






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






26. Composed of individually named data fields






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






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






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






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






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






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






33. Any container with linear ordering






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






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






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






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






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






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






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






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






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






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






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






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






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






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






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






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






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