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






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






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






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






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






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






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. Describes a data structure or device in which all accesses have the same cost - O(1)






10. A case where a program calls itself






11. Composed of individually named data fields






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






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






14. A pointer to data






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






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






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






18. A number that is defined as an object so that it has a runtime type and methods that can be used - e.g. Integer in Java






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






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






21. Two variables that reference the same object






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






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






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






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






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






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






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






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






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






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






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






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






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






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






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






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






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






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






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






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






42. The process of collecting garbage for recycling






43. Any container with linear ordering






44. First-child/next-sibling






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






46. To combine two ordered linear structures into one






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






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






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






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