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. In a tree - a node that points to a given node






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






3. To combine two ordered linear structures into one






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






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






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






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






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






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






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






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






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






13. A node of a tree that has children






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






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






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






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






18. A pointer to data






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






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






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






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






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






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






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






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






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






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






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






30. A pattern that describes a set of similar programs






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






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






33. Depth first search






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






35. A variable containing the address of other data






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






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






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






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






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






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






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






43. Describes a though experiment or view of an entity






44. A case where tow data structures share some elements






45. Composed of individually named data fields






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






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






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






49. Describes a function that modifies its arguments






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