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 node of a tree that has children






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






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






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






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






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






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






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






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






10. The process of collecting garbage for recycling






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






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






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






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






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






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






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






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






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






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






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






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






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






24. A case where tow data structures share some elements






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






26. A process that removes unwanted elements from a collection






27. Composed of multiple sequential elements stored in contiguous bytes of memory






28. An abstracted function that describes the amount of computer time or memory space required by an algorithm - as a function of problem size. for problems larger than a certain size - the actual time or space required will be less than the Big O multip






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






30. First-child/next-sibling






31. Two variables that reference the same object






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






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






34. A pointer to data






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






36. Describes a function that modifies its arguments






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






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






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






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






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






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






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






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






45. A pattern that describes a set of similar programs






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






47. A collection of values






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






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






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






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