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. Describes a function that modifies its arguments






3. Any container with linear ordering






4. A process that removes unwanted elements from a collection






5. Describes a though experiment or view of an entity






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






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






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






9. Depth first search






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






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






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






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






14. Two variables that reference the same object






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






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






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






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






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






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






21. To combine two ordered linear structures into one






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






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






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






25. All nodes below a give node in a tree






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






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






28. The next element in a linked list






29. Composed of individually named data fields






30. A variable containing the address of other data






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






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. o(n^2) - a problem whose solution requires a quadratic amount of time or space if the problem is of size n






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






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






36. A number that is defined as an object so that it has a runtime type and methods that can be used - e.g. Integer in Java






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






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






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






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






41. Describes a function that makes a new data structure but does not modify its arguments






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






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






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






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






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






47. A case where tow data structures share some elements






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






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






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