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. The amount of space on the runtime stack required for execution of a program






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






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






4. The top node of a tree - from which all other nodes can be reached






5. A node of a tree that has children






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






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






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






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






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






11. The process of collecting garbage for recycling






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






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






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






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






16. A pattern that describes a set of similar programs






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






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






19. To hide similar items with the same name






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






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






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






23. A pointer to data






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. An ordering that can be guaranteed to terminate - e.g. starting at a positive integer and counting down






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






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






28. A case where a program calls itself






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






30. A case where tow data structures share some elements






31. A data structure that can be identified at runtime as being a member of a class






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






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






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






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






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






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






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






39. A description of the kinds of objects that exist in a computer program - e.g a Java class hierarchy






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






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






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






43. Any container with linear ordering






44. A process that removes unwanted elements from a collection






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






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






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






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






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






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