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 linked list in which each elements has both forward and backward pointers






2. Two variables that reference the same object






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






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 before its children






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






7. A variable containing the address of other data






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






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






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






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






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






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






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






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






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






17. All nodes below a give node in a tree






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






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






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






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






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






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






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






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






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






27. A process that removes unwanted elements from a collection






28. A pointer to data






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






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






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






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






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






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






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






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






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






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






39. A pattern that describes a set of similar programs






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






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






42. Any container with linear ordering






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






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






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






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






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






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






49. A case where a program calls itself






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