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 condition of the input data where the data will be handled by call(s) to the same program






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






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






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






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






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






7. A node of a tree that has children






8. Describes a data structure that cannot be changed once it has been created - such as Integer or String in Java






9. A collection of values






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






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






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






13. Composed of individually named data fields






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






15. Describes a function that modifies its arguments






16. A case where a program calls itself






17. Depth first search






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






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






20. All nodes below a give node in a tree






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






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






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






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






25. First-child/next-sibling






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






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






28. A pattern that describes a set of similar programs






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






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






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






32. To combine two ordered linear structures into one






33. Any container with linear ordering






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






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






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






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






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






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






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






41. The next element in a linked list






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






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






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






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






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






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






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






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






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







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