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 contiguous block of memory containing elements of the same type - accessed by numeric index






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






3. A pointer to data






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






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






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






7. The next element in a linked list






8. The process of collecting garbage for recycling






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






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






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






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






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






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






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






16. To combine two ordered linear structures into one






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






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






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






20. A case where tow data structures share some elements






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






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






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






24. A variable containing the address of other data






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






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






27. To hide similar items with the same name






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






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






30. First-child/next-sibling






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






32. Depth first search






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






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






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






36. A pattern that describes a set of similar programs






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






38. A node of a tree that has children






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






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






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






42. Any container with linear ordering






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






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






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






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






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






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






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






50. Describes a though experiment or view of an entity