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 contiguous block of memory containing elements of the same type - accessed by numeric index






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






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






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






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






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






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






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






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






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






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






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






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






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






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






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






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






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






19. A case where a program calls itself






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






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






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






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






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






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






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






27. A pattern that describes a set of similar programs






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






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






30. The process of collecting garbage for recycling






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






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






33. A pointer to data






34. In object oriented programming - a description of a set of similar objects






35. A process that removes unwanted elements from a collection






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






37. All nodes below a give node in a tree






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






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






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






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






42. Describes a function that modifies its arguments






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






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






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






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






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






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






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






50. Depth first search