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. In a tree - a node pointed to by a parent node






2. A collection of values






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






4. Describes a function that modifies its arguments






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






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






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






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






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






10. Describes a though experiment or view of an entity






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






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






13. Depth first search






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






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






16. Two variables that reference the same object






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






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






19. To hide similar items with the same name






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






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






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






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






24. A node of a tree that has children






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






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






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






28. A process that removes unwanted elements from a collection






29. A case where a program calls itself






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






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






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






33. A variable containing the address of other data






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






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






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






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






38. Composed of individually named data fields






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






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






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






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






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






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






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






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






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






48. First-child/next-sibling






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






50. The next element in a linked list