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 problem whose solution requires a linear amount of time or space if the problem is size n






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






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






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






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






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






7. The process of collecting garbage for recycling






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






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






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






11. A stack containing a stack frame of variable value for each active invocation of procedure






12. A pointer to data






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






14. The next element in a linked list






15. A case where a program calls itself






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






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






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






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






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






21. Describes a though experiment or view of an entity






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






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






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






25. A pattern that describes a set of similar programs






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






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






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






29. First-child/next-sibling






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






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






32. Two variables that reference the same object






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 data structure representing a sequence of items - which are removed in the same order as they were inserted.






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






36. To hide similar items with the same name






37. A process that removes unwanted elements from a collection






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






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






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






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






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






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






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






45. Constructed of multiple components (simple or complex types)






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






47. A case where tow data structures share some elements






48. A variable containing the address of other data






49. Composed of individually named data fields






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