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. Describes a function that makes a new data structure but does not modify its arguments






2. A collection of values






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






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






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






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






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






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






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






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






11. To hide similar items with the same name






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






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






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






15. First-child/next-sibling






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






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






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






19. Composed of individually named data fields






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






21. Describes a though experiment or view of an entity






22. Two variables that reference the same object






23. A pointer to the next element in a linked list






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






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






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






27. Describes a function that modifies its arguments






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






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






30. A case where tow data structures share some elements






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






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






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






34. The process of collecting garbage for recycling






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






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






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






38. The next element in a linked list






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






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






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






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






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






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






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






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






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






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






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






50. A variable containing the address of other data