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 collection of objects that are inserted and removed according to the LIFO principle






2. Two variables that reference the same object






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






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






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






6. A type in which variables of that type are pointers to objects. in the code integer i = 3 - the variable i holds a pointer to the integer object that contains the value. in in j = 3 - the variable j contains the value. in java - only reference types






7. A function whose value either does not involve a recursive call - or is exactly the value of a recursive call






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






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






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






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






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






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






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






15. The amount of space on the runtime stack required for execution of a program






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






17. A pattern that describes a set of similar programs






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






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






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






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






22. Describes a though experiment or view of an entity






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






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






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






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






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






28. Last in first out: describes the order of a stack






29. A collection of values






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






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






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






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






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






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






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






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






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






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






40. A case where tow data structures share some elements






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






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






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






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






46. A case where a program calls itself






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






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






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






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