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. Describes a function that modifies its arguments






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






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






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






5. A collection of values






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






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






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






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






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






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






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






13. To combine two ordered linear structures into one






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






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






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






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






18. First-child/next-sibling






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






20. Describes a though experiment or view of an entity






21. All nodes below a give node in a tree






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






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






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






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






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






27. Composed of individually named data fields






28. Two variables that reference the same object






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






30. A node of a tree that has children






31. A collection of objects that are inserted and removed according to the LIFO principle






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






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






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






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






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






37. To hide similar items with the same name






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






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






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






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






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






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






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






45. The process of collecting garbage for recycling






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






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






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






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






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






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