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






2. A process that removes unwanted elements from a collection






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






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






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






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






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






8. Two variables that reference the same object






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






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






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






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






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






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






15. To combine two ordered linear structures into one






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






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






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






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






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






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






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






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






24. Describes a function that modifies its arguments






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






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






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






28. A case where a program calls itself






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






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






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






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






33. A pattern that describes a set of similar programs






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






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






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






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






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






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






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






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






42. A collection of values






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






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






45. A case where tow data structures share some elements






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






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






48. All nodes below a give node in a tree






49. First-child/next-sibling






50. Describes a though experiment or view of an entity