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 description of the kinds of objects that exist in a computer program - e.g a Java class hierarchy






2. All nodes below a give node in a tree






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






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






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






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






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






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






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






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






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






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






13. A process that removes unwanted elements from a collection






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






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






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






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






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






19. A pointer to data






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






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






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






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






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






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






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






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






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






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






30. A collection of values






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






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






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






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






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






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






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






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






39. To combine two ordered linear structures into one






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






41. Separation of the properties of a data type from its implementation






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






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






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






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






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






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






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






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






50. A case where a program calls itself