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 function whose value either does not involve a recursive call - or is exactly the value of a recursive call






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






3. Depth first search






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






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






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






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






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






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






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






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






12. Two variables that reference the same object






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






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






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






16. Describes a function that modifies its arguments






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






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






19. The process of collecting garbage for recycling






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






21. A variable containing the address of other data






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






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






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






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






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






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






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






29. A pattern that describes a set of similar programs






30. Any container with linear ordering






31. To hide similar items with the same name






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






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






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






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






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






37. A case where tow data structures share some elements






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






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






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






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






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






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






44. A pointer to data






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






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






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






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






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






50. A description of the kinds of objects that exist in a computer program - e.g a Java class hierarchy







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