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






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






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






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






5. A pointer to the next element in a linked list






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






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






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






9. Any container with linear ordering






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






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






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






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






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






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






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






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






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






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






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






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






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






23. Container for storing a collection of data in unique key/value pairs






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






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






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






27. A pointer to data






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






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






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






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






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






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






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






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






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






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






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






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






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






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






42. A case where a program calls itself






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






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






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






46. A pattern that describes a set of similar programs






47. The next element in a linked list






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






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






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