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. The area of program text over which a variable can be referenced






2. A case where a program calls itself






3. A node of a tree that has children






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






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






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






7. To look through a data structure until a goal object is found






8. The process of collecting garbage for recycling






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






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






11. An item (or description of items) being sough in a search






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






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






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






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






16. All nodes below a give node in a tree






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






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






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






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






21. To hide similar items with the same name






22. A case where tow data structures share some elements






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






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






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






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






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






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






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






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






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






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






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






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






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






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






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






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






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






40. In a tree search - to move back from the node currently being examined to its parent






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






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






43. Two variables that reference the same object






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






45. Any container with linear ordering






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






47. Depth first search






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






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






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