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. The number of links between the root of a tree and the leaves






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






3. A process that removes unwanted elements from a collection






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






5. Any container with linear ordering






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






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






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






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






10. A description of the kinds of objects that exist in a computer program - e.g a Java class hierarchy






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






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






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






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






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






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






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






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






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






20. A node of a tree that has children






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






22. A case where tow data structures share some elements






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






24. A variable containing the address of other data






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






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






27. All nodes below a give node in a tree






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






29. Depth first search






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






31. To hide similar items with the same name






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






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






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






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






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






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






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






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






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






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






42. Describes a function that modifies its arguments






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






44. A collection of values






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






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






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






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






49. The process of collecting garbage for recycling






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