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 linked list in which the last element points back to the first element






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






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






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






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






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






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






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






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






10. A variable containing the address of other data






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






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






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






14. A case where tow data structures share some elements






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






16. A pointer to data






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






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






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






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






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






22. Any container with linear ordering






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






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






25. A pattern that describes a set of similar programs






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. The top node of a tree - from which all other nodes can be reached






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






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






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






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






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






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






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






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






36. Composed of individually named data fields






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






38. All nodes below a give node in a tree






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






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






41. A node of a tree that has children






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






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






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






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






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






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






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






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






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