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. Given two sets -the union is the set of elements that are members of either set






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






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






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






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






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






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






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






9. To hide similar items with the same name






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






11. A case where tow data structures share some elements






12. The next element in a linked list






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






14. A pattern that describes a set of similar programs






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






16. First-child/next-sibling






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






18. Describes a function that modifies its arguments






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






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






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






22. A case where a program calls itself






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






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






25. A process that removes unwanted elements from a collection






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






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






28. Any container with linear ordering






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






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






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






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






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






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






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






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






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






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






39. A node of a tree that has children






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






41. A variable containing the address of other data






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






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






44. Composed of individually named data fields






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






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






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






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






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






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