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






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






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






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






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






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






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






8. A runtime error that occurs when an operation such as method call is attempted on a null pointer






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






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






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






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






13. The process of collecting garbage for recycling






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






15. The next element in a linked list






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






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






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






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






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






21. All nodes below a give node in a tree






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






23. A pointer to data






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






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






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






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






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






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






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 pattern that describes a set of similar programs






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






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






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






35. To hide similar items with the same name






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






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






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






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






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






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






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






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






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






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






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






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






48. To combine two ordered linear structures into one






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






50. Depth first search