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 a program calls itself






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






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






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






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






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






7. First-child/next-sibling






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






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






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






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






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






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






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






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






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






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






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






19. Describes a though experiment or view of an entity






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






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






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






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






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






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






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






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






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






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






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






31. Any container with linear ordering






32. All nodes below a give node in a tree






33. First in first out: describes ordering of a queue






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






35. storage that is no longer pointed to by any variable and therefore can no longer be accessed






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






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






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






39. Depth first search






40. To hide similar items with the same name






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






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






43. To combine two ordered linear structures into one






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






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






46. A pointer to data






47. A collection of values






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






49. A case where tow data structures share some elements






50. The process of collecting garbage for recycling