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 tree node containing a contents value but with no children






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






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






5. A pointer to data






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






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






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






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






10. Describes a though experiment or view of an entity






11. In a tree - a node that points to a given node






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






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






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






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






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






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






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






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






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






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






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






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 sequence of records - where each record contains a link to the next one






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






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






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






28. To combine two ordered linear structures into one






29. A node of a tree that has children






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






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






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






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






34. A case where a program calls itself






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






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






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






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






39. A process that removes unwanted elements from a collection






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






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






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






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






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






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






46. Depth first search






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






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






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)