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






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






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






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






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






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






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






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






9. A collection of values






10. A function whose value either does not involve a recursive call - or is exactly the value of a recursive call






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






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






13. A case where tow data structures share some elements






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






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






16. The process of collecting garbage for recycling






17. Describes a function that modifies its arguments






18. First-child/next-sibling






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






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






21. A formal description of a language in terms of vocabulary and rules for writing phrases and sentences






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






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






24. Describes a though experiment or view of an entity






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






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






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






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






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






30. A pattern that describes a set of similar programs






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






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






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






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






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






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






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






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






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






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






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






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






43. All nodes below a give node in a tree






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






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






46. A pointer to data






47. The area of program text over which a variable can be referenced






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






49. A case where a program calls itself






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







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