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. A process that removes unwanted elements from a collection






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






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






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






5. A case where tow data structures share some elements






6. Any container with linear ordering






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






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






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






10. To hide similar items with the same name






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






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






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






14. A case where a program calls itself






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






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






17. To combine two ordered linear structures into one






18. A pattern that describes a set of similar programs






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






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






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






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






23. Describes a though experiment or view of an entity






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






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






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






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






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






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






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






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






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






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






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






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






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






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






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






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






40. A collection of values






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






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






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






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






45. Depth first search






46. Composed of individually named data fields






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






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






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






50. Describes a function that modifies its arguments