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. An order of processing a tree in which the parent node is processed in between its children






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






3. The process of collecting garbage for recycling






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






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






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






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






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






9. A case where tow data structures share some elements






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






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






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






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






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






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






16. A pattern that describes a set of similar programs






17. Describes a function that modifies its arguments






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






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






20. A type in which variables of that type are pointers to objects. in the code integer i = 3 - the variable i holds a pointer to the integer object that contains the value. in in j = 3 - the variable j contains the value. in java - only reference types






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






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






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






24. A variable containing the address of other data






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






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






27. Two variables that reference the same object






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






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






30. The next element in a linked list






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






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






33. Composed of individually named data fields






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






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






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






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






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






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






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






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






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






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






44. In a search tree - the number of children of a given node. often - the branching factors of individual nodes will vary - so an average value may be used






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






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






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






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






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






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







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