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 classification of objects into a tree structure that groups related objects






2. A case where a program calls itself






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






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






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. A runtime error that occurs when an operation such as method call is attempted on a null pointer






7. A process that removes unwanted elements from a collection






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






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






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






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






12. Composed of individually named data fields






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






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






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






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






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






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






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






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






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






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






23. To hide similar items with the same name






24. A pattern that describes a set of similar programs






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






26. Two variables that reference the same object






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






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






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






30. A case where tow data structures share some elements






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






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






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






34. The next element in a linked list






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






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






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






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






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






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






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






42. Depth first search






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






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






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






46. Describes a though experiment or view of an entity






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






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






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






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