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 problem whose solution requires a linear amount of time or space if the problem is size n






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






3. To hide similar items with the same name






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






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






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






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






8. Any container with linear ordering






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






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






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






12. The process of collecting garbage for recycling






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






14. First-child/next-sibling






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






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






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






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






19. A node of a tree that has children






20. A case where tow data structures share some elements






21. A collection of values






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






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






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






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






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






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






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






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






30. Describes a though experiment or view of an entity






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






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






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






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






35. A pointer to data






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






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






38. In a tree - the union of a node's parent and the parent's ancestors






39. A process that removes unwanted elements from a collection






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






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






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






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






44. To combine two ordered linear structures into one






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






46. A sequence of records - where each record contains a link to the next one






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






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






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






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