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 section of the runtime stack holding the values of all variables for one invocation






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






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






4. A variable containing the address of other data






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






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






7. A process that removes unwanted elements from a collection






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






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






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






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






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






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






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






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






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






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






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






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






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






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






22. All nodes below a give node in a tree






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






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






25. A case where a program calls itself






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






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






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






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






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






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






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






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






34. Describes a function that modifies its arguments






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






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






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






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






39. Any container with linear ordering






40. Describes a though experiment or view of an entity






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






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






43. Depth first search






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






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






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






47. Two variables that reference the same object






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






49. A case where tow data structures share some elements






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