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. An order of processing a tree in which the parent node is processed after its children






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






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






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






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






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






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






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






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






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






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






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






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






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






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






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






18. Depth first search






19. A queue implemented within an array - where the first elements of the array logically follows the last elements






20. The process of collecting garbage for recycling






21. The next element in a linked list






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






23. A variable containing the address of other data






24. Two variables that reference the same object






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






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






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






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






29. To combine two ordered linear structures into one






30. A case where tow data structures share some elements






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






32. To hide similar items with the same name






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






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






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






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






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






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






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






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






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






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






43. All nodes below a give node in a tree






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






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






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






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






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






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






50. A case where a program calls itself