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 pattern that describes a set of similar programs






2. Depth first search






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






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






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






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






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






8. A collection of values






9. A pointer to data






10. A variable containing the address of other data






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






12. A case where tow data structures share some elements






13. A process that removes unwanted elements from a collection






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






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






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






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






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






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






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






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






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






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






24. Composed of individually named data fields






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






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






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






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






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






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






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






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






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






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






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






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






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






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






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






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






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






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






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






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






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






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






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






48. The next element in a linked list






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






50. A case where a program calls itself