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 description of the kinds of objects that exist in a computer program - e.g a Java class hierarchy






2. To combine two ordered linear structures into one






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






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






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






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






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






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






9. The next element in a linked list






10. A collection of values






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






12. The process of collecting garbage for recycling






13. Describes a though experiment or view of an entity






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






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






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






17. A pattern that describes a set of similar programs






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






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






20. A description of the state of a process such as a board game






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






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






23. All nodes below a give node in a tree






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






25. First-child/next-sibling






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






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






28. Values are in the most basic form and cannot be decomposed into smaller parts






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






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






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






32. A case where tow data structures share some elements






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






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






35. Depth first search






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






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






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






39. A node of a tree that has children






40. A pointer to data






41. Two variables that reference the same object






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






43. A number that is defined as an object so that it has a runtime type and methods that can be used - e.g. Integer in Java






44. To hide similar items with the same name






45. Describes a function that modifies its arguments






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






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






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






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






50. Describes a data structure or device in which all accesses have the same cost - O(1)