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. Values are in the most basic form and cannot be decomposed into smaller parts






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






3. A linked list in which each elements has both forward and backward pointers






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






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






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






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






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






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






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






11. Describes a function that modifies its arguments






12. A pattern that describes a set of similar programs






13. A variable containing the address of other data






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






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






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






17. Depth first search






18. All nodes below a give node in a tree






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






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






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






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






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






24. First-child/next-sibling






25. The next element in a linked list






26. To combine two ordered linear structures into one






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






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






29. A case where a program calls itself






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






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






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






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






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






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






36. Composed of individually named data fields






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






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






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






40. A tree node containing a contents value but with no children






41. Any container with linear ordering






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






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






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






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






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






47. An item (or description of items) being sough in a search






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






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






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