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. In a tree search - to move back from the node currently being examined to its parent






2. A case where a program calls itself






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






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






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






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






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






8. First-child/next-sibling






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






10. Any container with linear ordering






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






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






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






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






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






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






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






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






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






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






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






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






23. The next element in a linked list






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






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






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






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






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






29. Two variables that reference the same object






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






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






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






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






34. Describes a function that modifies its arguments






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






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






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






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






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






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






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






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






43. A variable containing the address of other data






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






45. A pointer to data






46. Depth first search






47. A process that removes unwanted elements from a collection






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






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






50. A case where tow data structures share some elements







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