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. Any effect of a procedure other than returning a value - e.g. printing or modifying a data structure






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






3. binary tree that is ordered such that each node has contents - and all of its left descendants are less than the contents - an all of its right descendants are greater than the contents






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






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. An order of processing a tree in which the parent node is processed before its children






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






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






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






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






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






12. A pattern that describes a set of similar programs






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






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






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






16. Composed of individually named data fields






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






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






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






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






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






22. Two variables that reference the same object






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






24. To combine two ordered linear structures into one






25. Describes a function that modifies its arguments






26. A case where a program calls itself






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






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






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






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






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






32. Depth first search






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






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






35. First-child/next-sibling






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






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






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






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






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






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






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






43. A contiguous block of memory containing elements of the same type - accessed by numeric index






44. A problem-solving strategy in which a problem is broken down into sub-problems - until simple subproblems are reached






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






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






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






48. All nodes below a give node in a tree






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






50. A process that removes unwanted elements from a collection