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






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






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






4. Describes a though experiment or view of an entity






5. A pointer to data






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






7. Describes a function that modifies its arguments






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






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






10. In object oriented programming - a description of a set of similar objects






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






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






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






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






15. A node of a tree that has children






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






17. To combine two ordered linear structures into one






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






19. Any container with linear ordering






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






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






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






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






24. Composed of individually named data fields






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






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






27. Two variables that reference the same object






28. The next element in a linked list






29. First-child/next-sibling






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






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






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






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






34. A case where tow data structures share some elements






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






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






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






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






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






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






41. Given two sets - the intersection is the set of elements that are members of both sets






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






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






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






45. To hide similar items with the same name






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






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






48. A variable containing the address of other data






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






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