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. Describes a function that makes a new data structure but does not modify its arguments






2. To hide similar items with the same name






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






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






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






6. Any container with linear ordering






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






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






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






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






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






12. Describes a function that modifies its arguments






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






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






15. To combine two ordered linear structures into one






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






17. Depth first search






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






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






20. Two variables that reference the same object






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






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






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






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






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






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






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






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






29. A process that removes unwanted elements from a collection






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






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






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






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






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






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






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






37. Composed of individually named data fields






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






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






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






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






42. A pattern that describes a set of similar programs






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






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






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






46. Separation of the properties of a data type from its implementation






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






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






49. The next element in a linked list






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