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. The area of program text over which a variable can be referenced






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






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






4. A variable containing the address of other data






5. Two variables that reference the same object






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






7. The process of collecting garbage for recycling






8. First-child/next-sibling






9. The next element in a linked list






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






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






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






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






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






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






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






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






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






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






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






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






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






23. A process that removes unwanted elements from a collection






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






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






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






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






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






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






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






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






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






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






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






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






36. A case where tow data structures share some elements






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






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






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






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






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






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






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






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






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






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






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






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






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






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