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 condition of the input data where the data will be handled by call(s) to the same program






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






3. A case where a program calls itself






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






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






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






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






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






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






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






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






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






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






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






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






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






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






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






19. To hide similar items with the same name






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






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






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






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






24. Composed of individually named data fields






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






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






27. The next element in a linked list






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






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






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






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






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. Separation of the properties of a data type from its implementation






34. To combine two ordered linear structures into one






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






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






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






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






39. First-child/next-sibling






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






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






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






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






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






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






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






47. A variable containing the address of other data






48. The process of collecting garbage for recycling






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






50. Two variables that reference the same object







Sorry!:) No result found.

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