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 stack containing a stack frame of variable value for each active invocation of procedure






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






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






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






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






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






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






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






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






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






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






12. Given two sets - the intersection is the set of elements that are members of both sets






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






14. A case where a program calls itself






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






16. A collection of values






17. Describes a though experiment or view of an entity






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






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






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






21. A process that removes unwanted elements from a collection






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






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






24. A variable containing the address of other data






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






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






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






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






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






30. A section of the runtime stack holding the values of all variables for one invocation






31. Composed of individually named data fields






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






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






34. A case where tow data structures share some elements






35. A pointer to data






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






37. A description of operations on a data type that could have multiple possible implementations






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






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






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






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






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






43. The next element in a linked list






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






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






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






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






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






49. First in first out: describes ordering of a queue






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