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 process that removes unwanted elements from a collection






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






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. An order of processing a tree in which the parent node is processed after its children






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






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






7. First-child/next-sibling






8. A pattern that describes a set of similar programs






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






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






11. To combine two ordered linear structures into one






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






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






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. Constructed of multiple components (simple or complex types)






17. A case where a program calls itself






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






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






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






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






22. Any container with linear ordering






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






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






25. A node of a tree that has children






26. Describes a function that modifies its arguments






27. The process of collecting garbage for recycling






28. Two variables that reference the same object






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






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






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






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






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






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






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






36. Describes a though experiment or view of an entity






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






38. All nodes below a give node in a tree






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






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






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






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






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






44. To hide similar items with the same name






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






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






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






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






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






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