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. Composed of individually named data fields






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






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






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






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






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






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






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






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






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






11. Any container with linear ordering






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






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






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






15. Two variables that reference the same object






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






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






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






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






20. Describes a function that modifies its arguments






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






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






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






24. To combine two ordered linear structures into one






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






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






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






28. A variable containing the address of other data






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






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






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






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






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






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






35. All nodes below a give node in a tree






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






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






38. Describes a though experiment or view of an entity






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






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






41. First in first out: describes ordering of a queue






42. First-child/next-sibling






43. A pattern that describes a set of similar programs






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






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






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






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






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






49. A pointer to data






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






Can you answer 50 questions in 15 minutes?



Let me suggest you:

Browse all subjects

Browse all tests

Most popular tests



Major Subjects

Tests & Exams


AP
CLEP
DSST
GRE
SAT
GMAT

Browse all subjects

Browse all tests

Most popular tests