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. Two variables that reference the same object






2. A variable containing the address of other data






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






4. Describes a function that modifies its arguments






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






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






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






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






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






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






11. Any container with linear ordering






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






13. All nodes below a give node in a tree






14. A node of a tree that has children






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






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






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






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






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






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






21. A pointer to data






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






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






24. Describes a function that makes a new data structure but does not modify its arguments






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






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






27. The next element in a linked list






28. To combine two ordered linear structures into one






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






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






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






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






33. Describes a though experiment or view of an entity






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






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






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






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






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






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






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






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






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






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






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






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






46. To hide similar items with the same name






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






48. First-child/next-sibling






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






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