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. In a search tree - a program that changes a state into a child state e.g a move in a game






2. A node of a tree that has children






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






4. All nodes below a give node in a tree






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






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






7. Depth first search






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






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






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






11. Composed of individually named data fields






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






13. Any container with linear ordering






14. The next element in a linked list






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






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






17. A pattern that describes a set of similar programs






18. First-child/next-sibling






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






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






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






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






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






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






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






26. A pointer to data






27. A collection of values






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






29. Given two sets - the intersection is the set of elements that are members of both sets






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






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






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






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






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






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






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






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






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






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






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






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






42. To combine two ordered linear structures into one






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






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






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






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






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






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






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






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







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