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. A search in which children of a node are considered before siblings are considered






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






3. Two variables that reference the same object






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






5. An ordering that can be guaranteed to terminate - e.g. starting at a positive integer and counting down






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






7. The next element in a linked list






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






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






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






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






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






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






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






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






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






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






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






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






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






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






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






23. Describes a function that modifies its arguments






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






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






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






27. First-child/next-sibling






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






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






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






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






32. A pattern that describes a set of similar programs






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






34. The process of collecting garbage for recycling






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






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






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. To modify the order of a set of elements so that a desired ordering holds between them - e.g. alphabetic order






39. All nodes below a give node in a tree






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






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






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






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






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






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






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






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






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






49. Any container with linear ordering






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