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






2. All nodes below a give node in a tree






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






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






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






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






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






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






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






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






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






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






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






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






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






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






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






18. A node of a tree that has children






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






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






21. A variable containing the address of other data






22. Two variables that reference the same object






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






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






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






26. First-child/next-sibling






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






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






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






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






31. To hide similar items with the same name






32. Depth first search






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






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






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






36. Describes a though experiment or view of an entity






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






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






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






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






41. The next element in a linked list






42. A linked list in which the last element points back to the first element






43. Describes a data structure or device in which all accesses have the same cost - O(1)






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






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






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






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






48. A process that removes unwanted elements from a collection






49. Any container with linear ordering






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