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 formal description of a language in terms of vocabulary and rules for writing phrases and sentences






2. To combine two ordered linear structures into one






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






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






5. A problem-solving strategy in which a problem is broken down into sub-problems - until simple subproblems are reached






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






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






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






9. First-child/next-sibling






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






11. A process that removes unwanted elements from a collection






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






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






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






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






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






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






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






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






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






21. To hide similar items with the same name






22. A pattern that describes a set of similar programs






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






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






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






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






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






28. Any container with linear ordering






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






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






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






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






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






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






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






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






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






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






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






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






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






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






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






44. Composed of individually named data fields






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






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






47. All nodes below a give node in a tree






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






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






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