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. Values are in the most basic form and cannot be decomposed into smaller parts






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






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






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






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






6. A process that removes unwanted elements from a collection






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






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






9. A variable containing the address of other data






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






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






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






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






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






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






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






17. To hide similar items with the same name






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






19. A sequence of records - where each record contains a link to the next one






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






21. Composed of individually named data fields






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






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






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






25. The next element in a linked list






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






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






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






29. All nodes below a give node in a tree






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






31. To combine two ordered linear structures into one






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






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






34. A sequence of clear and precise step-by-step instructions for solving a problem in a finite amount of time






35. A node of a tree that has children






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






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






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






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






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






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






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






43. A case where tow data structures share some elements






44. Describes a function that modifies its arguments






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






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






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






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






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






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