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. Give two sets - the set difference is the set of elements of the first set that are not members of the second set






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






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






4. Depth first search






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






6. A node of a tree that has children






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






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






9. A variable containing the address of other data






10. A case where tow data structures share some elements






11. A pointer to data






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






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






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






15. To hide similar items with the same name






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






17. Describes a though experiment or view of an entity






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






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






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






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






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






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






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






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






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






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






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






29. A pattern that describes a set of similar programs






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






31. A collection of values






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






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






34. Any container with linear ordering






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






36. The next element in a linked list






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






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






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






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






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






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






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






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






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






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






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






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






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






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