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. Composed of individually named data fields






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






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






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






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






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






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






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






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






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






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






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






13. Depth first search






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






15. A problem whose solution requires a linear amount of time or space if the problem is size n






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






17. A process that removes unwanted elements from a collection






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






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






20. Last in first out: describes the order of a stack






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






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






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






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






25. A pattern that describes a set of similar programs






26. Describes a though experiment or view of an entity






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






28. o(n^2) - a problem whose solution requires a quadratic amount of time or space if the problem is of size n






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






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






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






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






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






34. A node of a tree that has children






35. A case where tow data structures share some elements






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






37. To hide similar items with the same name






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






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






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






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






42. First-child/next-sibling






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






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






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






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






47. A runtime error that occurs when an operation such as method call is attempted on a null pointer






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






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






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