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. All nodes below a give node in a tree






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






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






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






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






6. Two variables that reference the same object






7. A node of a tree that has children






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






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






10. A process that removes unwanted elements from a collection






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






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






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






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






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






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






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






18. Any container with linear ordering






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






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






21. To modify the order of a set of elements so that a desired ordering holds between them - e.g. alphabetic order






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






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






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






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






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. A description of operations on a data type that could have multiple possible implementations






28. A pointer to data






29. A case where a program calls itself






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






31. A type in which variables of that type are pointers to objects. in the code integer i = 3 - the variable i holds a pointer to the integer object that contains the value. in in j = 3 - the variable j contains the value. in java - only reference types






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






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






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






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






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






37. Composed of individually named data fields






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






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






40. The next element in a linked list






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






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






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






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






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






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






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






48. The process of collecting garbage for recycling






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






50. To hide similar items with the same name