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 sequence of records - where each record contains a link to the next one






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






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






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






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






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






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






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






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






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






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






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






13. The process of collecting garbage for recycling






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






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






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






17. First-child/next-sibling






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






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






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






21. Two variables that reference the same object






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






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






24. A case where a program calls itself






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






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






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






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






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






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






31. A pointer to data






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






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






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






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






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






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






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






39. Describes a though experiment or view of an entity






40. A node of a tree that has children






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






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






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






44. Any container with linear ordering






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






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






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






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






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






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