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. Container for storing a collection of data in unique key/value pairs






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






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






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






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






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






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






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






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






10. First-child/next-sibling






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






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






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






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






15. Any container with linear ordering






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






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






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






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






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






21. In a tree - the union of a node's parent and the parent's ancestors






22. A pointer to data






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






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






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






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






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






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






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






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






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






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






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






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






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






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






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






38. The next element in a linked list






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






40. An extra record at the start or end of a data structure such as a linked list - to simplify processing






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






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






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






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






45. All nodes below a give node in a tree






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






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






48. A case where tow data structures share some elements






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






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