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. To look through a data structure until a goal object is found






2. To combine two ordered linear structures into one






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






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






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






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






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






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






9. A case where tow data structures share some elements






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






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






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






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






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






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






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






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






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






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






20. Composed of individually named data fields






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






22. Describes a function that modifies its arguments






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






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






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






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






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






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






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






30. A collection of values






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






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






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






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






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






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






37. The next element in a linked list






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






39. A node of a tree that has children






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






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






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






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






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






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






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






47. A process that removes unwanted elements from a collection






48. To hide similar items with the same name






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






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