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. Last in first out: describes the order of a stack






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






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






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






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






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






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






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






9. A case where a program calls itself






10. A process that removes unwanted elements from a collection






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






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






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






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






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






16. A list of pairs - where each pair has a key and a value associated with the key






17. 1. In lisp - the function that constructs a pair of points - or basic elements of list structure. 2. To make a cons data structure 2. a cons data structure






18. A node of a tree that has children






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






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






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






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






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






24. Describes a though experiment or view of an entity






25. Composed of a collection of data values; implemented with a data structure






26. The process of collecting garbage for recycling






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






28. All nodes below a give node in a tree






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






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






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






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






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






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






35. Depth first search






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






37. To hide similar items with the same name






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






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






40. A case where tow data structures share some elements






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






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






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






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






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






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






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






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






49. A pattern that describes a set of similar programs






50. Composed of individually named data fields







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