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 pointer to the next element in a linked list






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






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






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






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






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






7. A case where tow data structures share some elements






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






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






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






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






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






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






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






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






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






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






18. Depth first search






19. Give two sets - the set difference is the set of elements of the first set that are not members of the second set






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






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






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






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






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






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






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






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






28. Any container with linear ordering






29. To hide similar items with the same name






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






31. The process of collecting garbage for recycling






32. A pointer to data






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






34. A type in which variables of that type are pointers to objects. in the code integer i = 3 - the variable i holds a pointer to the integer object that contains the value. in in j = 3 - the variable j contains the value. in java - only reference types






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






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






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






38. Composed of individually named data fields






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






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






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






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






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






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






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






46. Two variables that reference the same object






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






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






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






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