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 object oriented programming - a description of a set of similar objects






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






3. First-child/next-sibling






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






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






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






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






8. To combine two ordered linear structures into one






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






10. Any container with linear ordering






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






12. All nodes below a give node in a tree






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






14. Give two sets - the set difference is the set of elements of the first set that are not members of the second set






15. To hide similar items with the same name






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






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






18. Describes a though experiment or view of an entity






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






20. Composed of individually named data fields






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






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






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






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






25. A case where a program calls itself






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






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






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






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






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






31. A collection of values






32. Depth first search






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






34. A pointer to data






35. 1. In lisp - the function that constructs a pair of points - or basic elements of list structure. 2. To make a cons data structure 2. a cons data structure






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






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






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






39. In a tree - a node that points to a given node






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






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






42. A node of a tree that has children






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






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






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






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






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






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






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






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