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. Constructed of multiple components (simple or complex types)






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






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






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






5. Composed of individually named data fields






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






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






8. The process of collecting garbage for recycling






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






10. First-child/next-sibling






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






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






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






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






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






16. Depth first search






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






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






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






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






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






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






23. Describes a function that modifies its arguments






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






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






26. A problem that is so hard that it cannot be solved unless the problem is small






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






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






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






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






31. To combine two ordered linear structures into one






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






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






34. The next element in a linked list






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






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






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






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






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






40. A collection of values






41. A pointer to data






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






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






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






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






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






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






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






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






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