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 case where tow data structures share some elements






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






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






4. A collection of values






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






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






7. A pattern that describes a set of similar programs






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






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






10. To hide similar items with the same name






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






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






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






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






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






16. A pointer to data






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






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






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






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






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






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






23. To answer the question - "If the algorithm is run several times - what is the average time per run - given the worst possible sequence of runs?"






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






25. In a tree - a node pointed to by a parent node






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






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






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






29. Describes a function that modifies its arguments






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






31. The next element in a linked list






32. Composed of a collection of data values; implemented with a data structure






33. A node of a tree that has children






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






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






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






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






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






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






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






41. A function whose value either does not involve a recursive call - or is exactly the value of a recursive call






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






43. A process that removes unwanted elements from a collection






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






45. A case where a program calls itself






46. Implementation of complex ADTs. Physical representation of how data is stored - organized - and manipulated






47. Describes a though experiment or view of an entity






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






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






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