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. An extra record at the start or end of a data structure such as a linked list - to simplify processing






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






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






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






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






6. Composed of individually named data fields






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






8. A case where a program calls itself






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






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






11. Last in first out: describes the order of a stack






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






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






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






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






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






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






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






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






20. A pointer to data






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






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






23. Constructed of multiple components (simple or complex types)






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






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






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






27. A problem that is so hard that it cannot be solved unless the problem is small






28. First-child/next-sibling






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






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






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






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






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






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






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






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






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






38. The next element in a linked list






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






40. The process of collecting garbage for recycling






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






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






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






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






45. storage that is no longer pointed to by any variable and therefore can no longer be accessed






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






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






48. Describes a function that modifies its arguments






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






50. A case where tow data structures share some elements