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 function whose value either does not involve a recursive call - or is exactly the value of a recursive call






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






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






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






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






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






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






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






9. The next element in a linked list






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






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






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






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






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






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






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






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






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






19. First-child/next-sibling






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






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






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






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






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






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






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






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






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






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






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






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






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. A given collection of values along with a collection of operations for use on those values






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






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






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






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






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






39. To hide similar items with the same name






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






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






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






43. A pattern that describes a set of similar programs






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






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






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






47. A collection of values






48. Two variables that reference the same object






49. The process of collecting garbage for recycling






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