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. storage that is no longer pointed to by any variable and therefore can no longer be accessed






3. Depth first search






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






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






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






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






8. In a tree - a node pointed to by a parent node






9. The next element in a linked list






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






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






12. Describes a function that modifies its arguments






13. A collection of values






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






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






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






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






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






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






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






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






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






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. A node of a tree that has children






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






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






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






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






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






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






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






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






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






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






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






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






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






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






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






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






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






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






43. Composed of individually named data fields






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






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






46. To hide similar items with the same name






47. To combine two ordered linear structures into one






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






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






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