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. Use of a function or method without knowing how it's accomplished






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






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






5. Any container with linear ordering






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






7. To combine two ordered linear structures into one






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






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






10. Two variables that reference the same object






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






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






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






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






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






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






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






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






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






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






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






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






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






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






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






26. Composed of individually named data fields






27. A process that removes unwanted elements from a collection






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






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






30. A node of a tree that has children






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






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






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






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






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






36. All nodes below a give node in a tree






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






38. To hide similar items with the same name






39. First-child/next-sibling






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






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






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






43. Describes a though experiment or view of an entity






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






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






46. A collection of values






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






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






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






50. Describes a function that modifies its arguments