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 linked list in which each elements has both forward and backward pointers






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






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






4. A case where tow data structures share some elements






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






6. Describes a function that modifies its arguments






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






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






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






10. A classification of objects into a tree structure that groups related objects






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






12. Any container with linear ordering






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






14. A pattern that describes a set of similar programs






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






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






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






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






19. To hide similar items with the same name






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






21. A node of a tree that has children






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






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






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






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






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






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






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






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






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






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






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






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






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






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






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






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






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






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






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






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






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






43. Composed of individually named data fields






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






45. A variable containing the address of other data






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






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






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






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






50. Depth first search







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