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. Separation of the properties of a data type from its implementation






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






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






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






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






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






7. A variable containing the address of other data






8. Composed of individually named data fields






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






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






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






12. A collection of values






13. A process that removes unwanted elements from a collection






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






15. A pointer to data






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






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






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






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






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






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






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






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






24. First-child/next-sibling






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






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






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






28. To combine two ordered linear structures into one






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






30. A case where tow data structures share some elements






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






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






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






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






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






36. A case where a program calls itself






37. The next element in a linked list






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






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






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






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






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






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






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






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






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






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






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






49. Any container with linear ordering






50. A pattern that describes a set of similar programs