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 description of operations on a data type that could have multiple possible implementations






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






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






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






5. All nodes below a give node in a tree






6. A pointer to data






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






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






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






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






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






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






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






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






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






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






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






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






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






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






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






22. Describes a though experiment or view of an entity






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






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






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






26. A node of a tree that has children






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






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






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






30. Describes a function that modifies its arguments






31. Depth first search






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






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






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






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






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






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






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






39. A variable containing the address of other data






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






41. Composed of individually named data fields






42. To combine two ordered linear structures into one






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






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






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






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






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






48. A pattern that describes a set of similar programs






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






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