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






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






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






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






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






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






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






8. The next element in a linked list






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






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






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






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






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






14. Describes a function that modifies its arguments






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






16. A variable containing the address of other data






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






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






19. A pointer to data






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






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






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






23. A description of operations on a data type that could have multiple possible implementations






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






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






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






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






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






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






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






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






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






33. A pattern that describes a set of similar programs






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






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






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






37. The process of collecting garbage for recycling






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






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






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






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






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






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






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






45. All nodes below a give node in a tree






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






47. To hide similar items with the same name






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






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






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