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 operations on a data type that could have multiple possible implementations






3. A pointer to data






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






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






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






7. A node of a tree that has children






8. Any container with linear ordering






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






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






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






12. A variable containing the address of other data






13. To combine two ordered linear structures into one






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






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






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






17. A linked list in which each elements has both forward and backward pointers






18. Describes a though experiment or view of an entity






19. A stack containing a stack frame of variable value for each active invocation of procedure






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






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






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






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






24. All nodes below a give node in a tree






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






26. A case where tow data structures share some elements






27. A collection of values






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






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






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






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






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






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






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






35. Two variables that reference the same object






36. Describes a function that modifies its arguments






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






38. The next element in a linked list






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






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






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






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






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






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






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






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






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. Composed of multiple sequential elements stored in contiguous bytes of memory






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






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







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