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 condition of the input data where the data will be handled by call(s) to the same program






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






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






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






5. A node of a tree that has children






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






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






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






9. Depth first search






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






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






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






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






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






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






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






17. The process of collecting garbage for recycling






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






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






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






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






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. In a tree search - to move back from the node currently being examined to its parent






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






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






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






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






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






29. The number of links between the root of a tree and the leaves






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






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






32. The next element in a linked list






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






34. To combine two ordered linear structures into one






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






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






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






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






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






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






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






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






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






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






45. A case where a program calls itself






46. Describes a though experiment or view of an entity






47. Describes a function that modifies its arguments






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






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






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