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 tree node containing a contents value but with no children






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






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






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






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






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






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






8. To hide similar items with the same name






9. A pointer to data






10. Any container with linear ordering






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






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






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






14. Depth first search






15. binary tree that is ordered such that each node has contents - and all of its left descendants are less than the contents - an all of its right descendants are greater than the contents






16. A case where a program calls itself






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






18. The next element in a linked list






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






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






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






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






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






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






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






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






27. A pattern that describes a set of similar programs






28. First-child/next-sibling






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






30. A variable containing the address of other data






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






32. 1. In lisp - the function that constructs a pair of points - or basic elements of list structure. 2. To make a cons data structure 2. a cons data structure






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






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






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






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






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






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






39. Two variables that reference the same object






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






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






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






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






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






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






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






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






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






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






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