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 variable containing the address of other data






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






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






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






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






6. All nodes below a give node in a tree






7. A pattern that describes a set of similar programs






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






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






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






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






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. To modify the order of a set of elements so that a desired ordering holds between them - e.g. alphabetic order






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






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






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






17. Last in first out: describes the order of a stack






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






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






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






21. The process of collecting garbage for recycling






22. A node of a tree that has children






23. Composed of individually named data fields






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






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






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






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






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






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






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






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






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






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






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






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






36. Describes a though experiment or view of an entity






37. Any container with linear ordering






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






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






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






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






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






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






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






45. First-child/next-sibling






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






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






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






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






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