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. Use of a function or method without knowing how it's accomplished






2. A process that removes unwanted elements from a collection






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






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






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. o(n^2) - a problem whose solution requires a quadratic amount of time or space if the problem is of size n






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






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






9. First-child/next-sibling






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






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






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






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






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






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






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






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






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






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






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






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






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






23. A case where a program calls itself






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






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






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






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






28. The process of collecting garbage for recycling






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






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






31. To hide similar items with the same name






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






33. Depth first search






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






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






36. Any container with linear ordering






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. An elements of a linked list - tree - or graph - often represented by a data structure






39. Composed of individually named data fields






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






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






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






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






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






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






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






47. A case where tow data structures share some elements






48. All nodes below a give node in a tree






49. A collection of values






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