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






2. To modify the order of a set of elements so that a desired ordering holds between them - e.g. alphabetic order






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






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






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






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






7. Composed of individually named data fields






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






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






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






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






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






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






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






15. All nodes below a give node in a tree






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






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






18. Describes a though experiment or view of an entity






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






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






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






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






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






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






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






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






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






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






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






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






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






32. A node of a tree that has children






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






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






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






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






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






38. A case where tow data structures share some elements






39. Any container with linear ordering






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






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






42. 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?"






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






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






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






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






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






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






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






50. A pointer to data