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. Given two sets - the intersection is the set of elements that are members of both sets






2. Depth first search






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






4. All nodes below a give node in a tree






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






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






7. A node of a tree that has children






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






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






10. Composed of individually named data fields






11. The next element in a linked list






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






13. The process of collecting garbage for recycling






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






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






16. A process that removes unwanted elements from a collection






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






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






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






20. To combine two ordered linear structures into one






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






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






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






24. Two variables that reference the same object






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






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






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






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






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






30. A pattern that describes a set of similar programs






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






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






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






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






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






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






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






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






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






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






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






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






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






44. Any container with linear ordering






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






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






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






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






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






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