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 order of processing a tree in which the parent node is processed after its children






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






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






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






5. A node of a tree that has children






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






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






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






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






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






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






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






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






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






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






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






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






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






20. Two variables that reference the same object






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






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






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






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






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






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






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






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






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






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






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






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






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






34. A pattern that describes a set of similar programs






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






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






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






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






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






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






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






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






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






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






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






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






47. A variable containing the address of other data






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






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






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