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 data structure that cannot be changed once it has been created - such as Integer or String in Java






2. Describes a though experiment or view of an entity






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






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






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






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






7. A list of pairs - where each pair has a key and a value associated with the key






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






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






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






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






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






13. To hide similar items with the same name






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






15. Any container with linear ordering






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






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






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






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






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






21. In a tree - a node that points to a given node






22. A node of a tree that has children






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






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






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






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






27. A process that removes unwanted elements from a collection






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






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






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






31. A pointer to data






32. A case where tow data structures share some elements






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






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






35. A problem-solving strategy in which a problem is broken down into sub-problems - until simple subproblems are reached






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






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






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






39. An abstracted function that describes the amount of computer time or memory space required by an algorithm - as a function of problem size. for problems larger than a certain size - the actual time or space required will be less than the Big O multip






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






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






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






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






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






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






46. To combine two ordered linear structures into one






47. First-child/next-sibling






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






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






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