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. Composed of a collection of data values; implemented with a data structure






2. A pattern that describes a set of similar programs






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






4. Describes a though experiment or view of an entity






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






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






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






8. To hide similar items with the same name






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






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






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






12. A process that removes unwanted elements from a collection






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






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






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






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






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






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






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






20. First-child/next-sibling






21. To combine two ordered linear structures into one






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






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






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






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






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






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






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






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






30. Depth first search






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






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






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






34. Describes a function that modifies its arguments






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






36. A data structure representing a sequence of items - which are removed in the same order as they were inserted.






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






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






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






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






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






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






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






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






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






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






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






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






49. Two variables that reference the same object






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







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