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. Composed of individually named data fields






2. A collection of values






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






4. A case where a program calls itself






5. To hide similar items with the same name






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






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






8. Describes a function that modifies its arguments






9. A pointer to data






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






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






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






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






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






15. A variable containing the address of other data






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






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






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






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






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






21. A node of a tree that has children






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






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






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






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






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






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






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






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






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






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






32. A pattern that describes a set of similar programs






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






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






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






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






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






38. A case where tow data structures share some elements






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






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






41. Any container with linear ordering






42. First-child/next-sibling






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






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






45. Depth first search






46. The next element in a linked list






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






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






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






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