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. An item (or description of items) being sough in a search






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






3. A case where tow data structures share some elements






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






5. To answer the question - "If the algorithm is run several times - what is the average time per run - given the worst possible sequence of runs?"






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






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






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






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






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






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






12. A node of a tree that has children






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






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






15. A sequence of records - where each record contains a link to the next one






16. A collection of values






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






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






19. A case where a program calls itself






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






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






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






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






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






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






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






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






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






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






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






31. All nodes below a give node in a tree






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






33. Depth first search






34. A pattern that describes a set of similar programs






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






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






37. Any container with linear ordering






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






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






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






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






42. A data structure that can be identified at runtime as being a member of a class






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






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






45. A pointer to data






46. Two variables that reference the same object






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






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






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






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