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. Given two sets -the union is the set of elements that are members of either set






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






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






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






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






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






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






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






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






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






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






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






13. To hide similar items with the same name






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






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






16. The process of collecting garbage for recycling






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






18. First-child/next-sibling






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






20. A variable containing the address of other data






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






22. A pattern that describes a set of similar programs






23. Two variables that reference the same object






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






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






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






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






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






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






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






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






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






33. A linked list in which the last element points back to the first element






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






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






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






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






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






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






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






41. A process that removes unwanted elements from a collection






42. Describes a though experiment or view of an entity






43. A pointer to data






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






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






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






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






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






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






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