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 sequence of records - where each record contains a link to the next one






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






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






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






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






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






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






8. The next element in a linked list






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






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






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






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






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






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






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






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






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






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






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






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






21. 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?"






22. A case where a program calls itself






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






24. Two variables that reference the same object






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






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






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






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






29. First-child/next-sibling






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






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






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






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






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






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






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






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






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






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






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






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






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






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






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






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






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






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






48. A node of a tree that has children






49. In a tree search - to move back from the node currently being examined to its parent






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