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. Describes a data structure or device in which all accesses have the same cost - O(1)






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






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






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






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






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






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






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






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






10. Any container with linear ordering






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






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






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






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






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






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






17. A case where tow data structures share some elements






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






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






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






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






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






23. A collection of values






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






25. A pointer to data






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






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






28. A formal description of a language in terms of vocabulary and rules for writing phrases and sentences






29. First-child/next-sibling






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






31. The next element in a linked list






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






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






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






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






36. Describes a though experiment or view of an entity






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






38. A variable containing the address of other data






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






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






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






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






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






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






45. Describes a function that modifies its arguments






46. A case where a program calls itself






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






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






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






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