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 whose solution requires a linear amount of time or space if the problem is size n






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






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






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






5. Any container with linear ordering






6. Composed of a collection of data values; implemented with a data structure






7. A contiguous block of memory containing elements of the same type - accessed by numeric index






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






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






10. A collection of values






11. A case where tow data structures share some elements






12. In a tree - a node pointed to by a parent node






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






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






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






16. A pattern that describes a set of similar programs






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






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






19. The next element in a linked list






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






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






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






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






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






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






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






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






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






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






31. A stack containing a stack frame of variable value for each active invocation of procedure






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






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






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






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






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






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






38. First-child/next-sibling






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






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






41. Describes a though experiment or view of an entity






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






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






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






45. All nodes below a give node in a tree






46. To hide similar items with the same name






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






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






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






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