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 problem-solving strategy in which a problem is broken down into sub-problems - until simple subproblems are reached






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






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






4. To combine two ordered linear structures into one






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






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






7. A collection of values






8. A case where tow data structures share some elements






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






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






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






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






13. A pointer to data






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






15. Depth first search






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






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






18. A variable containing the address of other data






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






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






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






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






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






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






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






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






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






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






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






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






31. The next element in a linked list






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






33. Any container with linear ordering






34. Describes a though experiment or view of an entity






35. A node of a tree that has children






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






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






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






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






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






41. Composed of individually named data fields






42. A pattern that describes a set of similar programs






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






44. Describes a function that modifies its arguments






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






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






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






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






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






50. A process that removes unwanted elements from a collection