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 pattern that describes a set of similar programs






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






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. Describes a function that makes a new data structure but does not modify its arguments






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






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






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






9. To combine two ordered linear structures into one






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






11. Describes a though experiment or view of an entity






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






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






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






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






16. A case where tow data structures share some elements






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






18. Two variables that reference the same object






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






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






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






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






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






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






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






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






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






28. Any container with linear ordering






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






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






31. To hide similar items with the same name






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






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






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






35. The process of collecting garbage for recycling






36. A process that removes unwanted elements from a collection






37. Depth first search






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






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






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






41. A variable containing the address of other data






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






43. Composed of individually named data fields






44. The next element in a linked list






45. First-child/next-sibling






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






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






48. An extra record at the start or end of a data structure such as a linked list - to simplify processing






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






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







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