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. A description of the state of a process such as a board game






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






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






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






6. Any container with linear ordering






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






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






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






10. Describes a function that modifies its arguments






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






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






13. All nodes below a give node in a tree






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






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






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






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






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






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






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






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






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






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






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






25. 1. In lisp - the function that constructs a pair of points - or basic elements of list structure. 2. To make a cons data structure 2. a cons data structure






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






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






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






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






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






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






32. To combine two ordered linear structures into one






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






34. To hide similar items with the same name






35. A node of a tree that has children






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






37. A variable containing the address of other data






38. A pointer to data






39. First-child/next-sibling






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






41. A case where a program calls itself






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






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






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






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






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






47. The process of collecting garbage for recycling






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






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






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