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






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






3. To combine two ordered linear structures into one






4. Any container with linear ordering






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






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






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






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






9. All nodes below a give node in a tree






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






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






12. Give two sets - the set difference is the set of elements of the first set that are not members of the second set






13. A node of a tree that has children






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






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






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






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






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






19. Describes a function that modifies its arguments






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






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






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






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






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






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






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






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






28. Two variables that reference the same object






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






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






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






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






33. A case where a program calls itself






34. The top node of a tree - from which all other nodes can be reached






35. Depth first search






36. First-child/next-sibling






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






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






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






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






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






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






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






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






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






46. A variable containing the address of other data






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






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






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






50. A process that removes unwanted elements from a collection