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. Any container with linear ordering






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






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






4. A case where a program calls itself






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






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






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






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






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






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






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






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






13. A node of a tree that has children






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






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






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






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






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






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






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






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






22. All nodes below a give node in a tree






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






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






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






26. A variable containing the address of other data






27. The next element in a linked list






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






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






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






31. Describes a though experiment or view of an entity






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






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






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. A stack containing a stack frame of variable value for each active invocation of procedure






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






37. A process that removes unwanted elements from a collection






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






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






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






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






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






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






44. First-child/next-sibling






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






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






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






48. A case where tow data structures share some elements






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






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