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. In a tree - a node that points to a given node






2. A pattern that describes a set of similar programs






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






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






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






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






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






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






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






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






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






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






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






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






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






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






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






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






19. Describes a though experiment or view of an entity






20. All nodes below a give node in a tree






21. A sequence of records - where each record contains a link to the next one






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






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






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






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






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






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






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






29. A case where tow data structures share some elements






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. First-child/next-sibling






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






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






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






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






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






37. A node of a tree that has children






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






39. A collection of values






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






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






42. A variable containing the address of other data






43. The process of collecting garbage for recycling






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






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






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






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






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






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






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