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. Use of a function or method without knowing how it's accomplished






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






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






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






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






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






7. All nodes below a give node in a tree






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






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






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






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






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






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






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






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






16. Describes a function that modifies its arguments






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






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






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






20. The next element in a linked list






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






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






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






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






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






26. A node of a tree that has children






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






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






29. A process that removes unwanted elements from a collection






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






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






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






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






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






35. Given two sets -the union is the set of elements that are members of either set






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






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






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






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






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






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






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






43. Describes a though experiment or view of an entity






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






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






46. A collection of values






47. A variable containing the address of other data






48. To hide similar items with the same name






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






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