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. Implementation of complex ADTs. Physical representation of how data is stored - organized - and manipulated






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






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






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






5. The next element in a linked list






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






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






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






9. The process of collecting garbage for recycling






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






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






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






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






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






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






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






17. Composed of individually named data fields






18. 1. In lisp - the function that constructs a pair of points - or basic elements of list structure. 2. To make a cons data structure 2. a cons data structure






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






20. A process that removes unwanted elements from a collection






21. A variable containing the address of other data






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






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






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






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






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






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






28. Any container with linear ordering






29. A case where a program calls itself






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






31. To combine two ordered linear structures into one






32. A case where tow data structures share some elements






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






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






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






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. Constructed of multiple components (simple or complex types)






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






39. Depth first search






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






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






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






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






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






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






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






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






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






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






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