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. To convert from a pointer to the data that is pointed to






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






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






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






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






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






7. A collection of values






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






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






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






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






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






13. Two variables that reference the same object






14. To hide similar items with the same name






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






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






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






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






19. Composed of individually named data fields






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






21. A queue implemented within an array - where the first elements of the array logically follows the last elements






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






23. To combine two ordered linear structures into one






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






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






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






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






28. First-child/next-sibling






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






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






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






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






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






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






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






36. A case where a program calls itself






37. Any container with linear ordering






38. A node of a tree that has children






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






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






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






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






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






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






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






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






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






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






49. An ordering that can be guaranteed to terminate - e.g. starting at a positive integer and counting down






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