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. To convert from a pointer to the data that is pointed to






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






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






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






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






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






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






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






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






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






11. First-child/next-sibling






12. A pointer to data






13. The process of collecting garbage for recycling






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






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






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






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






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






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






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






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






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






23. To combine two ordered linear structures into one






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






25. Any container with linear ordering






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






27. Describes a function that modifies its arguments






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






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






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






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






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






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






34. An elements of a linked list - tree - or graph - often represented by a data structure






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






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






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






38. A pattern that describes a set of similar programs






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






40. A process that removes unwanted elements from a collection






41. Composed of individually named data fields






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






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






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






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






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






47. A case where tow data structures share some elements






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






49. A collection of values






50. To answer the question - "If the algorithm is run several times - what is the average time per run - given the worst possible sequence of runs?"