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 data structure or device in which all accesses have the same cost - O(1)






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






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






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






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






6. To combine two ordered linear structures into one






7. Depth first search






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






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






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






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






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






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






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






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






16. A process that removes unwanted elements from a collection






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






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






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






20. Given two sets - the intersection is the set of elements that are members of both sets






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






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






23. The process of collecting garbage for recycling






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






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






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






27. All nodes below a give node in a tree






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






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






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






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






32. A case where tow data structures share some elements






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






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






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






36. A pointer to data






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






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






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






40. Describes a function that modifies its arguments






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






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






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 linked list in which the last element points back to the first element






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






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






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






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






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






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